Articles under category:
Cryptography
Cryptography
|
Vol 20, Article 3 (pp 1-87)
Verifier-on-a-Leash: New Schemes for Verifiable Delegated Quantum Computation, with Quasilinear Resources by Andrea Coladangelo, Alex B. Grilo, Stacey Jeffery, and Thomas Vidick |
|
Vol 16, Article 8 (pp 1-55)
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing by Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, and Hoeteck Wee |
|
Vol 14, Article 13 (pp 1-17)
On the Hardness of Learning With Errors with Binary Secrets by Daniele Micciancio |
|
Vol 14, Article 11 (pp 1-37)
How to Verify a Quantum Computation by Anne Broadbent |
|
Vol 14, Article 7 (pp 1-45)
Quantum Homomorphic Encryption for Polynomial-Size Circuits by Yfke Dulek, Christian Schaffner, and Florian Speelman |
|
Vol 12, Article 1 (pp 1-61)
[APRX-RND13 Spec Issue]
Private Learning and Sanitization: Pure vs. Approximate Differential Privacy by Amos Beimel, Kobbi Nissim, and Uri Stemmer |
|
Vol 9, Article 9 (pp 349-401)
Quantum Money from Hidden Subspaces by Scott Aaronson and Paul Christiano |
|
Vol 8, Article 10 (pp 231-238)
[NOTE]
Monotone Circuits: One-Way Functions versus Pseudorandom Generators by Oded Goldreich and Rani Izsak |
|
Vol 5, Article 13 (pp 257-282)
Optimal Cryptographic Hardness of Learning Monotone Functions by Dana Dachman-Soled, Homin K. Lee, Tal Malkin, Rocco A. Servedio, Andrew Wan, and Hoeteck Wee |
|
Vol 5, Article 8 (pp 141-172)
Parallel Repetition: Simplification and the No-Signaling Case by Thomas Holenstein |
|
Vol 5, Article 2 (pp 43-67)
Deterministic History-Independent Strategies for Storing Information on Write-Once Memories by Tal Moran, Moni Naor, and Gil Segev |