On the Reliability and Availability of Systems Tolerant to Stealth Intrusion. - Luís T. A. N. Brandão; Alysson Neves Bessani (LADC, 2011)

Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique - (Extended Abstract). - Luís T. A. N. Brandão (ASIACRYPT (2), 2013)

Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique. - Luís T. A. N. Brandão (IACR Cryptol. ePrint Arch., 2013)

Very-efficient simulatable flipping of many coins into a well. - Luís T. A. N. Brandão (IACR Cryptol. ePrint Arch., 2015)

Toward Mending Two Nation-Scale Brokered Identification Systems. - Luís T. A. N. Brandão; Nicolas Christin; George Danezis; anonymous (Proc. Priv. Enhancing Technol., 2015)

Very-Efficient Simulatable Flipping of Many Coins into a Well - (and a New Universally-Composable Commitment Scheme). - Luís T. A. N. Brandão (Public Key Cryptography (2), 2016)

A Public Comment on NCCoE's White Paper on Privacy-Enhancing Identity Brokers. - Luís T. A. N. Brandão; Nicolas Christin; George Danezis (CoRR, 2016)

Psst, Can You Keep a Secret? - Apostol Vassilev 001; Nicky Mouha; Luís T. A. N. Brandão (Computer, 2018)

Towards Standardization of Threshold Schemes at NIST. - Luís T. A. N. Brandão (TIS@CCS, 2019)

Upper bounds on the multiplicative complexity of symmetric Boolean functions. - Luís T. A. N. Brandão; Çagdas Çalik; Meltem Sönmez Turan; René Peralta 001 (Cryptogr. Commun., 2019)

The Forge-and-Lose Technique and Other Contributions to Secure Two-Party Computation with Commitments. - Luís T. A. N. Brandão (2019)

Traceable random numbers from a nonlocal quantum advantage. - Gautam A. Kavuri; Jasper Palfree; Dileep V. Reddy; Yanbao Zhang; Joshua C. Bienfang; Michael D. Mazurek; Mohammad A. Alhejji; Aliza U. Siddiqui; Joseph M. Cavanagh; Aagam Dalal; Carlos Abellán; Waldimar Amaya; et al. (CoRR, 2024)