Luís T. A. N. Brandão --- academic webpage

My current focus of academic research is in cryptography, mainly in secure two-party computation. I am also very interested in matters of Identity and Privacy.

I am a candidate for a Ph.D. degree in Electrical & Computer Engineering from Carnegie Mellon University (College of Engineering) in the USA, and a degree of Doutor em Informática from Universidade de Lisboa (Faculdade de Ciências) in Portugal, in the scope of the CMU|Portugal Program. My Doctoral co-advisors are Alysson Bessani (@UL) and Nicolas Christin (@CMU).

Doctoral Dissertation

The Forge-and-Lose Technique and Other Contributions to Secure Two-Party Computation with Commitments.
Luís T. A. N. Brandão. Doctoral thesis / Ph.D. dissertation. Carnegie Mellon University and University of Lisbon. 2016
(Ph.D. thesis defense in October 2016. Final dissertation version in December 2016.)
PDF file (with merged institutional covers

Two excerpts: vision and thesis; preamble of the conclusions.


  • A Public Comment on NCCoE's White Paper on Privacy-Enhancing Identity Brokers.
    Luís T. A. N. Brandão, Nicolas Christin, George Danezis. 2015/2016. arXIV:1611:02968
    PDF with bookmarks

  • Very-efficient simulatable flipping of many coins (and a new universally composable commitment scheme).
    Luís T. A. N. Brandão.
    Public-Key Cryptography -- PKC 2016. LNCS, vol. 9615, pp. 297-–326, Springer Heidelberg (2016).
    DOI: 10.1007/978-3-662-49387-8_12. Full version at the Cryptology ePrint Archive, Report 2015/640. Bibtex.
    Slides -- an early high-level presentation at the TCC 2014 Rump Session (San Diego, USA, 2014-Feb-25): print 1pp.
    Slides -- presented at PKC 2016: animated

  • Toward Mending Two Nation-Scale Brokered Identification Systems.
    Luís T. A. N. Brandão, Nicolas Christin, George Danezis, and Anonymous.
    Proceedings on Privacy Enhancing Technologies (PETS), vol. 2015, issue 2, pp. 135--155, De Gruyter Open (June 2015).
    DOI: 10.1515/popets-2015-0022 (open access). Other PDFs: conference copy; local copy. Bibtex.
    Slides -- presentation at PETS 2015 (Philadelphia, USA, 2015-Jun-30): animated; print 1pp; print 2pp.

  • 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.
    Advances in Cryptology -- ASIACRYPT 2013. LNCS, vol. 8270, pp. 441--463. Springer Heidelberg (2013).
    DOI: 10.1007/978-3-642-42045-0_23. Full version at the Cryptology ePrint Archive, Report 2013/577. Bibtex.
    Slides -- a very extended presentation (updated on 2014-Jan-13): animated; print 2pp.
    Slides -- a short & simplified version (2014-Jan): animated; print 2pp.
    Previous presentations were made at: Asiacrypt 2013 (Bangalore, India, 2013-Dec-05); Crypto 2013 Rump Session (Santa Barbara, USA, 2013-Aug-20); Eurocrypt 2013 Rump Session (Athens, Greece, 2013-May-28).

  • On the Reliability and Availability of Replicated and Rejuvenating Systems Under Stealth Attacks and Intrusions.
    Luís T. A. N. Brandão and Alysson N. Bessani.
    Journal of the Brazilian Computer Society, vol. 18, pp. 61--80, Springer London (2012).
    DOI: 10.1007/s13173-012-0062-x (open access). PDF-updated-personal; Bibtex.
    Slides -- a presentation at FCUL (Lisbon, Portugal, November 2012): animated; print 1pp; print 2pp.
    Slides -- a presentation at NIST (Gaithersburg, USA, July 2012): animated; print 1pp; print 2pp.

  • On the Reliability and Availability of Systems Tolerant to Stealth Intrusion.
    Luís T. A. N. Brandão and Alysson Bessani.
    Latin-American Symposium on Dependable Computing -- LADC 2011, pp.35--44, IEEE (2011).
    DOI: 10.1109/LADC.2011.27. PDF-updated-personal; Bibtex.
    (This is a short version. The full version was published at JBCS -- see item above.)

Other slides / presentations



Email address: emg

Google Scholar: click here

Webpage updated in February 2017