Luís T. A. N. Brandão

Publication Activity (10 Years)

Years Active: 2011-2019
Publications (10 Years): 5

Top Topics

Boolean Functions

Prime Implicants

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Upper bounds on the multiplicative complexity of symmetric Boolean functions. Cryptogr. Commun. 11 (6) (2019)
Luís T. A. N. Brandão
Towards Standardization of Threshold Schemes at NIST. TIS@CCS (2019)
Luís T. A. N. Brandão, Çagdas Çalik, Meltem Sönmez Turan, René Peralta
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions. IACR Cryptol. ePrint Arch. 2019 (2019)
Luís T. A. N. Brandão, Nicolas Christin, George Danezis
A Public Comment on NCCoE's White Paper on Privacy-Enhancing Identity Brokers. CoRR (2016)
Luís T. A. N. Brandão
Very-Efficient Simulatable Flipping of Many Coins into a Well - (and a New Universally-Composable Commitment Scheme). Public Key Cryptography (2) (2016)
Luís T. A. N. Brandão, Nicolas Christin, George Danezis, anonymous
Toward Mending Two Nation-Scale Brokered Identification Systems. Proc. Priv. Enhancing Technol. 2015 (2) (2015)
Luís T. A. N. Brandão
Very-efficient simulatable flipping of many coins into a well. IACR Cryptol. ePrint Arch. 2015 (2015)
Luís T. A. N. Brandão
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique. IACR Cryptol. ePrint Arch. 2013 (2013)
Luís T. A. N. Brandão
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique - (Extended Abstract). ASIACRYPT (2) (2013)
Luís T. A. N. Brandão, Alysson Neves Bessani
On the Reliability and Availability of Systems Tolerant to Stealth Intrusion. LADC (2011)