| On the Insider Security of MLS
|
2022 |
Alwen, Joël |
| A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling
|
2022 |
Pino, Rafael del |
| Succinct Classical Verification of Quantum Computation
|
2022 |
Bartusek, James |
| Batch Arguments for NP and More from Standard Bilinear Group Assumptions
|
2022 |
Waters, Brent |
| Syndrome Decoding in the Head: Shorter Signatures from Zero-Knowledge Proofs
|
2022 |
Feneuil, Thibauld |
| Breaking Rainbow Takes a Weekend on a Laptop
|
2022 |
Beullens, Ward |
| Correlated Pseudorandomness from Expand-Accumulate Codes
|
2022 |
Boyle, Elette |
| Password-Authenticated Key Exchange from Group Actions
|
2022 |
Abdalla, Michel |
| Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation
|
2022 |
Ishai, Yuval |
| Practical Sublinear Proofs for R1CS from Lattices
|
2022 |
Nguyen, Ngoc Khanh |
| Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable (Extended Abstract)
|
2022 |
Albrecht, Martin R. |
| Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work: A Provably Secure Blockchain Protocol
|
2022 |
Fitzi, Matthias |
| Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem
|
2022 |
Boudgoust, Katharina |
| Public-Key Watermarking Schemes for Pseudorandom Functions
|
2022 |
Yang, Rupeng |
| Efficient NIZKs and Signatures from Commit-and-Open Protocols in the QROM
|
2022 |
Don, Jelle |
| Locally Verifiable Signature and Key Aggregation
|
2022 |
Goyal, Rishab |
| horter Hash-and-Sign Lattice-Based Signatures
|
2022 |
Espitau, Thomas |
| On the Feasibility of Unclonable Encryption, and More
|
2022 |
Ananth, Prabhanjan |
| On Codes and Learning with Errors over Function Fields
|
2022 |
Bombar, Maxime |
| CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs
|
2022 |
Cremers, Cas |
Tag hinzufügen