Skip to main content
U.S. flag

An official website of the United States government

Official websites use .gov
A .gov website belongs to an official government organization in the United States.

Secure .gov websites use HTTPS
A lock ( ) or https:// means you’ve safely connected to the .gov website. Share sensitive information only on official, secure websites.

Publications

Search Publications by

Luís T. A. N. Brandão (IntlAssoc)

Search Title, Abstract, Conference, Citation, Keyword or Author
Displaying 1 - 8 of 8

ZKASP: ZKP-based Attestation of Software Possession for Measuring Instruments

March 9, 2022
Author(s)
Luis Brandao, Carlos Galhardo, Rene Peralta
Software-controlled measuring instruments used in commercial transactions, such as fuel dispensers and smart meters, are sometimes subject to "memory replacement" attacks. Cybercriminals replace the approved software by a malicious one that then tampers

Privacy-enhancing cryptography to complement differential privacy

November 3, 2021
Author(s)
Luis Brandao, Rene Peralta
In this post, we illustrate how various techniques from privacy-enhancing cryptography, coupled with differential privacy protection, can be used to protect data privacy while enabling data utility. Of notable interest is the setting where there are

NIST Roadmap Toward Criteria for Threshold Schemes for Cryptographic Primitives

July 7, 2020
Author(s)
Luis Brandao, Michael S. Davidson, Apostol T. Vassilev
This document constitutes a preparation toward devising criteria for the standardization of threshold schemes for cryptographic primitives by the National Institute of Standards and Technology (NIST). The large diversity of possible threshold schemes, as

Notes on Interrogating Random Quantum Circuits

May 29, 2020
Author(s)
Luis Brandao, Rene C. Peralta
Consider a quantum circuit that, when fed a constant input, produces a fixed-length random bit- string in each execution. Executing it many times yields a sample of many bit-strings that contain fresh randomness inherent to the quantum evaluation. When the

Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions

August 17, 2019
Author(s)
Luis Brandao, Cagdas Calik, Meltem Sonmez Turan, Rene Peralta
A special metric of interest about Boolean functions is multiplicative complexity (MC): the minimum number of AND gates sufficient to implement a function with a Boolean circuit over the basis XOR, AND, NOT}. In this paper we study the MC of symmetric

Time to Standardize Threshold Schemes for Cryptographic Primitives

April 10, 2019
Author(s)
Luis Brandao, Michael S. Davidson, Nicky W. Mouha, Apostol T. Vassilev
This bulletin summarizes the information found in NISTIR 8214: Threshold Schemes for Cryptographic Primitives. NIST is interested in promoting the security of implementations of cryptographic primitives. This security depends not only on the theoretical

Threshold Schemes for Cryptographic Primitives

March 1, 2019
Author(s)
Luis T. A. N. Brandao, Nicky W. Mouha, Apostol T. Vassilev
The Computer Security Division at the National Institute of Standards and Technology is interested in promoting the security of implementations of cryptographic primitives. This security depends not only on the theoretical properties of the primitives but

Psst, Can you Keep a Secret?

January 2, 2018
Author(s)
Apostol T. Vassilev, Nicky W. Mouha, Luis T. A. N. Brandao
The security of encrypted data depends not only on the theoretical properties of cryptographic primitives but also on the robustness of their implementations in software and hardware. Threshold cryptography introduces a computational paradigm that enables