| Page | Title |
|---|
| 3-33 | Boosting Authenticated Encryption Robustness with Minimal Modifications |
| 3-32 | Secure Computation Based on Leaky Correlations: High Resilience Setting |
| 3-35 | Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks |
| 33-65 | Laconic Oblivious Transfer and Its Applications |
| 34-65 | ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication |
| 36-66 | Generic Transformations of Predicate Encodings: Constructions and Applications |
| 66-92 | Black-Box Parallel Garbled RAM |
| 66-97 | Message Franking via Committing Authenticated Encryption |
| 67-98 | Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption |
| 95-126 | Non-Malleable Codes for Space-Bounded Tampering |
| 98-129 | Key Rotation for Authenticated Encryption |
| 101-132 | Memory-Tight Reductions |
| 127-157 | Four-Round Concurrent Non-Malleable Commitments from One-Way Functions |
| 133-160 | Kurosawa-Desmedt Meets Tight Security |
| 133-163 | Be Adaptive, Avoid Overcommitting |
| 158-189 | Distinguisher-Dependent Simulation in Two Rounds and its Applications |
| 161-193 | Asymptotically Compact Adaptively Secure Lattice IBEs and Verifiable Random Functions via Generalized Partitioning Techniques |
| 167-187 | The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited |
| 188-222 | Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic |
| 193-223 | Incremental Program Obfuscation |
| 194-224 | Identity-Based Encryption from Codes with Rank Metric |
| 223-254 | Secure Arithmetic Computation with Constant Computational Overhead |
| 224-251 | From Obfuscation to the Security of Fiat-Shamir for Proofs |
| 227-249 | Degree Evaluation of NFSR-Based Cryptosystems |
| 250-279 | Cube Attacks on Non-Blackbox Polynomials Based on Division Property |
| 252-279 | Indistinguishability Obfuscation for Turing Machines: Constant Overhead and Amortization |
| 255-287 | Encryption Switching Protocols Revisited: Switching Modulo p |
| 283-297 | Middle-Product Learning with Errors |
| 283-309 | Quantum Security of NMAC and Related Constructions - PRF Domain Extension Against Quantum attacks |
| 291-323 | The Bitcoin Backbone Protocol with Chains of Variable Difficulty |
| 298-331 | All-But-Many Lossy Trapdoor Functions from Lattices and Applications |
| 310-341 | Quantum Non-malleability and Authentication |
| 324-356 | Bitcoin as a Transaction Ledger: A Composable Treatment |
| 332-364 | All-But-Many Lossy Trapdoor Functions and Selective Opening Chosen-Ciphertext Security from LWE |
| 342-371 | New Security Notions and Feasibility Results for Authentication of Quantum Data |
| 357-388 | Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol |
| 365-394 | Amortization with Fewer Equations for Proving Knowledge of Small Secrets |
| 375-403 | Time-Memory Tradeoff Attacks on the MTP Proof-of-Work Scheme |
| 391-419 | Robust Non-interactive Multiparty Computation Against Constant-Size Collusion |
| 397-426 | Private Multiplication over Finite Fields |
| 404-427 | Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners |
| 420-446 | The Price of Low Communication in Secure Multi-party Computation |
| 427-461 | Anonymous Attestation with Subverted TPMs |
| 428-451 | Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak |
| 447-467 | Topology-Hiding Computation on All Graphs |
| 455-485 | Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time |
| 462-494 | Hedging Public-Key Encryption in the Real World |
| 468-499 | A New Approach to Round-Optimal Secure Multiparty Computation |
| 486-514 | LPN Decoded |
| 497-523 | Information-Theoretic Indistinguishability via the Chi-Squared Method |
| 503-536 | Watermarking Cryptographic Functionalities from Standard Lattice Assumptions |
| 517-547 | Optimal Security Reductions for Unique Signatures: Bypassing Impossibilities with a Counterexample |
| 524-555 | Indifferentiability of Iterated Even-Mansour Ciphers with Non-idealized Key-Schedules: Five Rounds Are Necessary and Sufficient |
| 537-569 | Identity-Based Encryption from the Diffie-Hellman Assumption |
| 548-580 | Compact Structure-Preserving Signatures with Almost Tight Security |
| 556-583 | Encrypted Davies-Meyer and Its Dual: Towards Optimal Security Using Mirror Theory |
| 570-596 | The First Collision for Full SHA-1 |
| 581-612 | Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs |
| 587-618 | A Formal Treatment of Multi-key Channels |
| 599-629 | Indistinguishability Obfuscation from SXDH on 5-Linear Maps and Locality-5 PRGs |
| 613-644 | Fast Secure Two-Party ECDSA Signing |
| 619-650 | Ratcheted Encryption and Key Exchange: The Security of Messaging |
| 630-660 | Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs |
| 647-678 | Proving Resistance Against Invariant Attacks: How to Choose the Round Constants |
| 651-681 | PRF-ODH: Relations, Instantiations, and Impossibility Results |
| 661-695 | Lower Bounds on Obfuscation from All-or-Nothing Encryption Primitives |
| 679-707 | Breaking the FF3 Format-Preserving Encryption Standard over Small Domains |
| 682-710 | A New Distribution-Sensitive Secure Sketch and Popularity-Proportional Hashing |
| 696-723 | Structure vs. Hardness Through the Obfuscation Lens |
| 708-732 | Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security |
| 727-757 | Conditional Disclosure of Secrets: Amplification, Closure, Amortization, Lower-Bounds, and Separations |
| 758-790 | Conditional Disclosure of Secrets via Non-linear Reconstruction |
