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

According to our database, Luís T. A. N. Brandão authored at least 11 papers between 2011 and 2019.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2019

The Forge-and-Lose Technique and Other Contributions to Secure Two-Party Computation with Commitments.

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

PhD thesis, 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

Cryptogr. Commun., 2019

Towards Standardization of Threshold Schemes at NIST.

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

Proceedings of ACM Workshop on Theory of Implementation Security, 2019

2018

Psst, Can You Keep a Secret?

Apostol Vassilev, Nicky Mouha, Luís T. A. N. Brandão

Computer, 2018

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

Very-Efficient Simulatable Flipping of Many Coins into a Well - (and a New Universally-Composable Commitment Scheme).

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

Proceedings of the Public-Key Cryptography - PKC 2016, 2016

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.

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

IACR Cryptol. ePrint Arch., 2015

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

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

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2011

On the Reliability and Availability of Systems Tolerant to Stealth Intrusion.

Luís T. A. N. Brandão, Alysson Neves Bessani

Proceedings of the 5th Latin-American Symposium on Dependable Computing, 2011