| No. | Title | Author | Year |
|---|---|---|---|
| 1 | On the Computational Hardness Needed for Quantum Cryptography | Brakerski, Zvika et al. | 2023 |
| 2 | Factoring and Pairings Are Not Necessary for IO: Circular-Secure LWE Suffices | Brakerski, Zvika et al. | 2022 |
| 3 | Lattice-Inspired Broadcast Encryption and Succinct Ciphertext-Policy ABE | Brakerski, Zvika et al. | 2022 |
| 4 | On the Hardness of Average-Case k-SUM | Brakerski, Zvika et al. | 2021 |
| 5 | Separating Two-Round Secure Computation From Oblivious Transfer | Applebaum, Benny et al. | 2020 |
| 6 | Simpler Proofs of Quantumness | Brakerski, Zvika et al. | 2020 |
| 7 | Brief Announcement: Zero-Knowledge Protocols for Search Problems | Berger, Ben et al. | 2018 |
| 8 | Hierarchical Functional Encryption | Brakerski, Zvika et al. | 2017 |
| Current Page : | |
| Number of result pages: | 1 |
| Number of documents: | 8 |