Antoine Joux
Top View
- Oblivious Transfer Is in Miniqcrypt
- Lecture Notes in Computer Science 6110 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan Van Leeuwen
- Faster Space-Efficient Algorithms for Subset Sum, K-Sum and Related
- Curriculum Vitae for Joel Friedman, November 2000
- The Complexity of Public-Key Cryptography
- Cybersecurity Institute 20-074.Pdf
- Low Complexity Pseudorandom Generators and Indistinguishability Obfuscation by Alex Lombardi A.B., Harvard University (2016) A.M., Harvard University (2016)
- Arxiv:1911.01662V2 [Quant-Ph] 19 May 2021
- John Von Neumann
- Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
- On Polynomial Systems Arising from a Weil Descent
- Arithmetic of Pairings on Algebraic Curves for Cryptography Aurore Guillevic
- Bounded Independence Plus Noise
- The Complexity of Public-Key Cryptography
- Faster Space-Efficient Algorithms for Subset Sum, K-Sum and Related Problems