Correlated Pseudorandomness from Expand-Accumulate Codes

Correlated Pseudorandomness from Expand-Accumulate Codes

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:International Cryptology Conference (42. : 2022 : Santa Barbara, Calif.; Online) Advances in cryptology - CRYPTO 2022 ; Part 2
1. Verfasser: Boyle, Elette (VerfasserIn)
Weitere Verfasser: Couteau, Geoffroy (VerfasserIn), Gilboa, Niv (VerfasserIn), Ishai, Yuval (VerfasserIn), Kohl, Lisa (VerfasserIn), Resch, Nicolas (VerfasserIn), Scholl, Peter (VerfasserIn)
Pages:2022
Format: UnknownFormat
Sprache:eng
Veröffentlicht: 2022
Schlagworte:
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Titel Jahr Verfasser
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General 2022 Lyubashevsky, Vadim
Universally Composable End-to-End Secure Messaging 2022 Canetti, Ran
On the Impossibility of Key Agreements from Quantum Random Oracles 2022 Austrin, Per
MuSig-L: Lattice-Based Multi-signature with Single-Round Online Phase 2022 Boschini, Cecilia
Practical Statistically-Sound Proofs of Exponentiation in Any Group 2022 Hoffmann, Charlotte
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks 2022 Matt, Christian
Multimodal Private Signatures 2022 Nguyen, Khoa
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
Alle Artikel auflisten