DOCSLIB.ORG
Explore
Sign Up
Log In
Upload
Search
Home
» Tags
» Antoine Joux
Antoine Joux
Garbled Protocols and Two-Round MPC from Bilinear Maps
Onyx: New Encryption and Signature Schemes with Multivariate Public Key in Degree 3
ACM SIGLOG News 1 October 2015, Vol
The Gödel Prize 2020 - Call for Nominatonn
SETH-Based Lower Bounds for Subset Sum and Bicriteria Path
Some Notions of Entropy for Cryptography∗
The Gödel Prize 2019 - Call for Nominations Deadline: February 15, 2019
Bounded Independence Plus Noise Fools Products
Cryptographic Assumptions: a Position Paper
EATCS General Assembly 2013
SIGACT Viability
New Generic Algorithms for Hard Knapsacks
Mathematisches Forschungsinstitut Oberwolfach Cryptography
Download This PDF File
Search Problems:A Cryptographic Perspective
Lipics-CCC-2017-14.Pdf (0.6
Multiparty Non-Interactive Key Exchange and More from Isogenies on Elliptic Curves
Classical Computation in the Quantum World
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