Succinct Classical Verification of Quantum Computation. | 0 | 0.34 | 2022 |
OpenFHE: Open-Source Fully Homomorphic Encryption Library. | 0 | 0.34 | 2022 |
One Server for the Price of Two: Simple and Fast Single-Server Private Information Retrieval. | 0 | 0.34 | 2022 |
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. | 0 | 0.34 | 2022 |
Witness Encryption and Null-IO from Evasive LWE. | 0 | 0.34 | 2022 |
Continuous LWE is as Hard as LWE & Applications to Learning Gaussian Mixtures. | 0 | 0.34 | 2022 |
Asymptotically Quasi-Optimal Cryptography | 0 | 0.34 | 2022 |
Rate-1 Non-Interactive Arguments for Batch-NP and Applications. | 0 | 0.34 | 2022 |
Locally Verifiable Signature and Key Aggregation. | 0 | 0.34 | 2022 |
Rate-1 Non-Interactive Arguments for Batch-NP and Applications. | 0 | 0.34 | 2022 |
Fast Vector Oblivious Linear Evaluation from Ring Learning with Errors | 0 | 0.34 | 2021 |
Succinct LWE Sampling, Random Polynomials, and Obfuscation | 0 | 0.34 | 2021 |
On the Hardness of Average-Case k-SUM. | 0 | 0.34 | 2021 |
Structure Versus Hardness Through The Obfuscation Lens | 0 | 0.34 | 2021 |
Somewhere Statistical Soundness, Post-Quantum Security, and SNARGs | 0 | 0.34 | 2021 |
The T-Wise Independence Of Substitution-Permutation Networks | 0 | 0.34 | 2021 |
Does Fully Homomorphic Encryption Need Compute Acceleration? | 0 | 0.34 | 2021 |
Cryptography from Information Loss. | 0 | 0.34 | 2020 |
Data structures meet cryptography: 3SUM with preprocessing | 0 | 0.34 | 2020 |
SETH-Hardness of Coding Problems | 0 | 0.34 | 2019 |
Reusable Non-Interactive Secure Computation. | 1 | 0.35 | 2019 |
Homomorphic Encryption Standard. | 0 | 0.34 | 2019 |
2-Message Publicly Verifiable WI from (Subexponential) LWE. | 0 | 0.34 | 2019 |
Adversarially Robust Property-Preserving Hash Functions. | 0 | 0.34 | 2019 |
Zero-Knowledge Proofs of Proximity. | 0 | 0.34 | 2018 |
Anonymous IBE, Leakage Resilience and Circular Security from New Assumptions. | 8 | 0.43 | 2018 |
How to Subvert Backdoored Encryption: Security Against Adversaries that Decrypt All Ciphertexts. | 0 | 0.34 | 2018 |
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates. | 2 | 0.37 | 2018 |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. | 2 | 0.37 | 2018 |
A Note on Perfect Correctness by Derandomization. | 2 | 0.38 | 2017 |
Limits on the Locality of Pseudorandom Generators and Applications to Indistinguishability Obfuscation. | 3 | 0.37 | 2017 |
Minimizing the Complexity of Goldreich's Pseudorandom Generator. | 0 | 0.34 | 2017 |
Fast Proxy Re-Encryption for Publish/Subscribe Systems. | 3 | 0.42 | 2017 |
Multikey Fully Homomorphic Encryption and Applications. | 1 | 0.37 | 2017 |
On the Non-Existence of Blockwise 2-Local PRGs with Applications to Indistinguishability Obfuscation. | 6 | 0.43 | 2017 |
New Protocols for Conditional Disclosure of Secrets (and More). | 0 | 0.34 | 2017 |
Sieve: Cryptographically Enforced Access Control for User Data in Untrusted Clouds. | 0 | 0.34 | 2016 |
Fine-grained Cryptography. | 0 | 0.34 | 2016 |
On Basing Private Information Retrieval on NP-Hardness. | 4 | 0.40 | 2016 |
Obfuscating Conjunctions Under Entropic Ring Lwe | 12 | 0.63 | 2016 |
Watermarking Cryptographic Capabilities. | 4 | 0.40 | 2016 |
Structure vs Hardness through the Obfuscation Lens. | 5 | 0.39 | 2016 |
SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers. | 30 | 0.88 | 2016 |
3-Message Zero Knowledge Against Human Ignorance. | 4 | 0.38 | 2016 |
Circuit-ABE from LWE: Unbounded Attributes and Semi-Adaptive Security. | 13 | 0.52 | 2016 |
Indistinguishability Obfuscation from DDH-Like Assumptions on Constant-Degree Graded Encodings | 4 | 0.38 | 2016 |
From Statistical Zero Knowledge to Secret Sharing. | 1 | 0.35 | 2015 |
From Selective To Adaptive Security In Functional Encryption | 43 | 0.99 | 2015 |
Secret Sharing and Statistical Zero Knowledge. | 4 | 0.39 | 2015 |
Succinct Garbling and Indistinguishability Obfuscation for RAM Programs | 26 | 0.66 | 2015 |