An official website of the United States government
Here’s how you know
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.
2019: NISTIR 8213 Draft: A Reference for Randomness Beacons: Format and Protocol Version 2. Jointly with H. Booth, J. Kelsey, and R. Peralta. doi:10.6028/NIST.IR.8213-draft
Selected publications external to NIST
2016/2017: The Forge-and-Lose Technique and Other Contributions to Secure Two-Party Computation with Commitments. PhD. Thesis. doi:10.1184/r1/6723590
2016: Very-Efficient Simulatable Flipping of Many Coins into a Well. Public-Key Cryptography – PKC 2016. doi:10.1007/978-3-662-49387-8_12
2015: A Public Comment on NCCoE's White Paper on Privacy-Enhancing Identity Brokers. Joint with N. Christin and G. Danezis. arXiv:1611.02968v1
2015: Toward Mending Two Nation-Scale Brokered Identification Systems. Proceedings on Privacy Enhancing Technologies. Jointly with N. Christin, G. Danezis and Anonymous. doi:10.1515/popets-2015-0022
2013: Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique. Advances in Cryptology - ASIACRYPT 2013. doi:10.1007/978-3-642-42045-0_23
2012: On the Reliability and Availability of Replicated and Rejuvenating Systems under Stealth Attacks and Intrusions. Journal of the Brazilian Computer Society. Jointly with A. Bessani. doi:10.1007/s13173-012-0062-x
In this post, we illustrate how various techniques from privacy-enhancing cryptography, coupled with differential privacy protection, can be used to protect
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
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
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