| Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS
|
2023 |
Golovnev, Alexander |
| PAC Privacy: Automatic Privacy Measurement and Control of Data Processing
|
2023 |
Xiao, Hanshen |
| Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance
|
2023 |
Dodis, Yevgeniy |
| Universal Amplification of KDM Security: From 1-Key Circular to Multi-Key KDM
|
2023 |
Waters, Brent |
| Anamorphic Signatures: Secrecy from a Dictator Who Only Permits Authentication!
|
2023 |
Kutyłowski, Mirosław |
| Lattice-Based Succinct Arguments from Vanishing Polynomials
|
2023 |
Cini, Valerio |
| Succinct Arguments for RAM Programs via Projection Codes
|
2023 |
Ishai, Yuval |
| TreePIR: Sublinear-Time and Polylog-Bandwidth Private Information Retrieval from DDH
|
2023 |
Lazzaretti, Arthur |
| Lattice Signature with Efficient Protocols, Application to Anonymous Credentials
|
2023 |
Jeudy, Corentin |
| The Query-Complexity of Preprocessing Attacks
|
2023 |
Ghoshal, Ashrujit |
| Extractors: Low Entropy Requirements Colliding with Non-malleability
|
2023 |
Aggarwal, Divesh |
| Orbweaver: Succinct Linear Functional Commitments from Lattices
|
2023 |
Fisch, Ben |
| Lattice-Based Succinct Arguments for NP with Polylogarithmic-Time Verification
|
2023 |
Bootle, Jonathan |
| SNARGs for Monotone Policy Batch NP
|
2023 |
Brakerski, Zvika |
| Anonymous Tokens with Stronger Metadata Bit Hiding from Algebraic MACs
|
2023 |
Chase, Melissa |
| Multi-party Homomorphic Secret Sharing and Sublinear MPC from Sparse LPN
|
2023 |
Dao, Quang |
| Revisiting Time-Space Tradeoffs for Function Inversion
|
2023 |
Golovnev, Alexander |
| One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
|
2023 |
Liu, Yanyi |
| Individual Cryptography
|
2023 |
Dziembowski, Stefan |
| Non-interactive Zero-Knowledge from Non-interactive Batch Arguments
|
2023 |
Champion, Jeffrey |
Tag hinzufügen