| Time- and Space-Efficient Arguments from Groups of Unknown Order
|
2021 |
Block, Alexander R. |
| Broadcast Encryption with Size N1/3 and More from k-Lin
|
2021 |
Wee, Hoeteck |
| Fine-Grained Secure Attribute-Based Encryption
|
2021 |
Wang, Yuyu |
| White Box Traitor Tracing
|
2021 |
Zhandry, Mark |
| The t-wise Independence of Substitution-Permutation Networks
|
2021 |
Liu, Tianren |
| Low-Complexity Weak Pseudorandom Functions in ACO[MOD2]
|
2021 |
Boyle, Elette |
| A Logarithmic Lower Bound for Oblivious RAM (for All Parameters)
|
2021 |
Komargodski, Ilan |
| Puncturable Pseudorandom Sets and Private Information Retrieval with Near-Optimal Online Bandwidth and Time
|
2021 |
Shi, Elaine |
| Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions
|
2021 |
Baum, Carsten |
| Non-interactive Batch Arguments for NP from Standard Assumptions
|
2021 |
Choudhuri, Arka Rai |
| Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs
|
2021 |
Liang, Xiao |
| Functional Encryption for Turing Machines with Dynamic Bounded Collusion from LWE
|
2021 |
Agrawal, Shweta |
| Multi-input Quadratic Functional Encryption from Pairings
|
2021 |
Agrawal, Shweta |
| Composition wıth Knowledge Assumptions
|
2021 |
Kerber, Thomas |
| Targeted Lossy Functions and Applications
|
2021 |
Quach, Willy |
| MPC-Friendly Symmetric Cryptography from Alternating Moduli: Candidates, Protocols, and Applications
|
2021 |
Dinur, Itai |
| No Time to Hash: On Super-Efficient Entropy Accumulation
|
2021 |
Dodis, Yevgeniy |
| Oblivious RAM with Worst-Case Logarithmic Overhead
|
2021 |
Asharov, Gilad |
| KHAPE: Asymmetric PAKE from Key-Hiding Key Exchange
|
2021 |
Gu, Yanqi |
| Witness Authenticating NIZKs and Applications
|
2021 |
Feng, Hanwen |
Tag hinzufügen