[go: up one dir, main page]

Follow
Luís T. A. N. Brandão
Luís T. A. N. Brandão
Verified email at nist.gov - Homepage
Title
Cited by
Cited by
Year
Phase transition in Random Circuit Sampling
A Morvan, B Villalonga, X Mi, S Mandrà, A Bengtsson, PV Klimov, Z Chen, ...
Nature 634, 328-333, 2024
2752024
NIST First Call for Multi-Party Threshold Schemes
LTAN Brandão, R Peralta
https://doi.org/10.6028/NIST.IR.8214C.2pd, 2025
85*2025
Secure Two-Party Computation with Reusable Bit-Commitments, via a Cut-and-Choose with Forge-and-Lose Technique
LTAN Brandão
Advances in Cryptology -- Asiacrypt 2013, 441-463, 2013
582013
A Reference for Randomness Beacons: Format and Protocol Version 2
J Kelsey, LTAN Brandão, R Peralta, H Booth
https://doi.org/10.6028/NIST.IR.8213-draft, 2019
532019
Threshold Schemes for Cryptographic Primitives: Challenges and Opportunities in Standardization and Validation of Threshold Cryptography
LTAN Brandão, N Mouha, A Vassilev
https://doi.org/10.6028/NIST.IR.8214, 2019
36*2019
Toward Mending Two Nation-Scale Brokered Identification Systems
LTAN Brandão, N Christin, G Danezis, Anonymous
Proceedings on Privacy Enhancing Technologies 2015 (2), 135-155, 2015
352015
NIST Roadmap Toward Criteria for Threshold Schemes for Cryptographic Primitives
LTAN Brandão, M Davidson, A Vassilev
https://doi.org/10.6028/NIST.IR.8214A, 2020
30*2020
On the reliability and availability of replicated and rejuvenating systems under stealth attacks and intrusions
LTAN Brandão, AN Bessani
Journal of the Brazilian Computer Society 18 (1), 61-80, 2012
29*2012
Notes on Threshold EdDSA/Schnorr Signatures
LTAN Brandão, M Davidson
https://doi.org/10.6028/NIST.IR.8214B.ipd, 2022
20*2022
Upper Bounds on the Multiplicative Complexity of Symmetric Boolean Functions
LTAN Brandão, Ç Çalık, MS Turan, R Peralta
Cryptology ePrint Archive: Report 2019/708, 2019
102019
Traceable random numbers from a non-local quantum advantage
GA Kavuri, J Palfree, DV Reddy, Y Zhang, JC Bienfang, MD Mazurek, ...
Nature, 1-6, 2025
72025
Very-Efficient Simulatable Flipping of Many Coins into a Well (and a New Universally-Composable Commitment Scheme)
LTAN Brandão
IACR International Workshop on Public Key Cryptography, 297-326, 2016
72016
Towards standardization of threshold schemes at NIST
LTAN Brandão
Proceedings of ACM Workshop on Theory of Implementation Security Workshop, 29-29, 2019
52019
Privacy-enhancing cryptography tools to complement differential privacy techniques
LTAN Brandão, R Peralta
4*2021
Keyed-hash Message Authentication Code (HMAC): Specification of HMAC and Recommendations for Message Authentication
MS Turan, L Brandao
NIST Special Publication 800, 2024
3*2024
Notes on Interrogating Random Quantum Circuits
LTAN Brandão, R Peralta
https://tsapps.nist.gov/publication/get_pdf.cfm?pub_id=929546, 2020
32020
A Framework for Interactive Argument Systems using Quasigroupic Homomorphic Commitments
LTAN Brandão
Cryptology ePrint Archive, Report 2006/472, 2006
22006
ZKASP: ZKP-based attestation of software possession for measuring instruments
LTAN Brandão, CEC Galhardo, R Peralta
Measurement Science and Technology 33, 2022
12022
A Public Comment on NCCoE's White Paper on Privacy-Enhancing Identity Brokers
LTAN Brandão, N Christin, G Danezis
arXiv preprint arXiv:1611.02968, 2016
12016
Toward a PEC Use-Case Suite
LTAN Brandão
https://csrc.nist.gov/pubs/other/2021/01/21/toward-a-pec-usecase-suite …, 2021
2021
The system can't perform the operation now. Try again later.
Articles 1–20