default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDLuís T. A. N. Brandão
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2019
[b1]Luís T. A. N. Brandão:
The Forge-and-Lose Technique and Other Contributions to Secure Two-Party Computation with Commitments. Carnegie Mellon University, USA, 2019
Journal Articles
- 2019
- [j3]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): 1339-1362 (2019) - 2018
- [j2]Apostol Vassilev, Nicky Mouha, Luís T. A. N. Brandão:
Psst, Can You Keep a Secret? Computer 51(1): 94-97 (2018) - 2015
- [j1]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): 135-155 (2015)
Conference and Workshop Papers
- 2019
- [c4]Luís T. A. N. Brandão:
Towards Standardization of Threshold Schemes at NIST. TIS@CCS 2019: 29 - 2016
- [c3]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: 297-326 - 2013
- [c2]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: 441-463 - 2011
- [c1]Luís T. A. N. Brandão, Alysson Neves Bessani:
On the Reliability and Availability of Systems Tolerant to Stealth Intrusion. LADC 2011: 35-44
Informal and Other Publications
- 2024
- [i5]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, Morgan W. Mitchell, Katherine E. Stange, Paul D. Beale, Luís T. A. N. Brandão, Harold Booth, René Peralta, Sae Woo Nam, Richard P. Mirin, Martin J. Stevens, Emanuel Knill, Lynden K. Shalm:
Traceable random numbers from a nonlocal quantum advantage. CoRR abs/2411.05247 (2024) - 2019
- [i4]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: 708 (2019) - 2016
- [i3]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 abs/1611.02968 (2016) - 2015
- [i2]Luís T. A. N. Brandão:
Very-efficient simulatable flipping of many coins into a well. IACR Cryptol. ePrint Arch. 2015: 640 (2015) - 2013
- [i1]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: 577 (2013)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-09 13:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
