IBE with Incompressible Master Secret and Small Identity Secrets. | 0 | 0.34 | 2022 |
Deletion inference, reconstruction, and compliance in machine (un)learning. | 0 | 0.34 | 2022 |
On the Worst-Case Inefficiency of CGKA. | 0 | 0.34 | 2022 |
A More Complete Analysis of the Signal Double Ratchet Algorithm. | 0 | 0.34 | 2022 |
Succinct Zero Knowledge for Floating Point Computations | 0 | 0.34 | 2022 |
Amortizing Rate-1 OT and Applications to PIR and PSI. | 0 | 0.34 | 2021 |
Laconic Private Set Intersection and Applications | 0 | 0.34 | 2021 |
Identity-based Encryption from the Diffie-Hellman Assumption | 0 | 0.34 | 2021 |
Amortizing Rate-1 OT and Applications to PIR and PSI | 0 | 0.34 | 2021 |
Tight Verifiable Delay Functions. | 0 | 0.34 | 2020 |
Black-Box Constructions of Bounded-Concurrent Secure Computation. | 0 | 0.34 | 2020 |
Reusable Two-Round MPC from DDH. | 0 | 0.34 | 2020 |
Separating Two-Round Secure Computation From Oblivious Transfer. | 0 | 0.34 | 2020 |
Adversarially Robust Learning Could Leverage Computational Hardness. | 0 | 0.34 | 2020 |
Efficient Range-Trapdoor Functions and Applications: Rate-1 OT and More. | 0 | 0.34 | 2019 |
Ad Hoc Multi-Input Functional Encryption. | 0 | 0.34 | 2019 |
Laconic Conditional Disclosure of Secrets and Applications | 0 | 0.34 | 2019 |
Trapdoor Hash Functions and Their Applications. | 0 | 0.34 | 2019 |
Leveraging Linear Decryption: Rate-1 Fully-Homomorphic Encryption and Time-Lock Puzzles. | 1 | 0.36 | 2019 |
Two-Round Multiparty Secure Computation from Minimal Assumptions. | 11 | 0.44 | 2018 |
New Techniques for Efficient Trapdoor Functions and Applications. | 0 | 0.34 | 2018 |
Obfuscation from Low Noise Multilinear Maps. | 0 | 0.34 | 2018 |
On the Round Complexity of OT Extension. | 1 | 0.34 | 2018 |
Two-Round Multiparty Secure Computation Minimizing Public Key Operations. | 0 | 0.34 | 2018 |
Registration-Based Encryption from Standard Assumptions. | 0 | 0.34 | 2018 |
Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings. | 2 | 0.37 | 2018 |
Adaptively Secure Garbling with Near Optimal Online Complexity. | 3 | 0.37 | 2018 |
Trapdoor Functions from the Computational Diffie-Hellman Assumption. | 0 | 0.34 | 2018 |
Adaptive Garbled RAM from Laconic Oblivious Transfer. | 0 | 0.34 | 2018 |
Limits on the Power of Garbling Techniques for Public-Key Encryption. | 0 | 0.34 | 2018 |
A New Approach to Black-Box Concurrent Secure Computation. | 1 | 0.35 | 2018 |
A Simple Construction Of Io For Turing Machines | 2 | 0.35 | 2018 |
Incremental Program Obfuscation. | 2 | 0.37 | 2017 |
Identity-Based Encryption from the Diffie-Hellman Assumption. | 18 | 0.55 | 2017 |
Two-Message Witness Indistinguishability and Secure Computation in the Plain Model from New Assumptions. | 1 | 0.35 | 2017 |
From Selective IBE to Full IBE and Selective HIBE. | 5 | 0.41 | 2017 |
On the Exact Round Complexity of Self-Composable Two-Party Computation. | 2 | 0.36 | 2017 |
When Does Functional Encryption Imply Obfuscation? | 4 | 0.37 | 2017 |
Garbled Protocols and Two-Round MPC from Bilinear Maps | 7 | 0.40 | 2017 |
Cryptanalysis of Indistinguishability Obfuscations of Circuits over GGH13. | 8 | 0.42 | 2017 |
Breaking the Sub-Exponential Barrier in Obfustopia. | 18 | 0.54 | 2017 |
Laconic Oblivious Transfer and its Applications. | 9 | 0.44 | 2017 |
Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives. | 5 | 0.38 | 2017 |
Hiding secrets in software: a cryptographic approach to program obfuscation. | 1 | 0.36 | 2016 |
Obfuscation without the Vulnerabilities of Multilinear Maps. | 0 | 0.34 | 2016 |
The Exact Round Complexity of Secure Computation. | 23 | 0.64 | 2016 |
Functional Encryption Without Obfuscation. | 33 | 0.80 | 2016 |
Secure Obfuscation in a Weak Multilinear Map Model. | 28 | 0.68 | 2016 |
TWORAM: Efficient Oblivious RAM in Two Rounds with Applications to Searchable Encryption. | 13 | 0.55 | 2016 |
Unifying Security Notions of Functional Encryption. | 3 | 0.38 | 2016 |