Linked e-resources
Details
Table of Contents
Universal Composition with Global Subroutines: Capturing Global Setup within plain UC
Security analysis of SPAKE2+
Schrödinger's Pirate: How To Trace a Quantum Decoder
Quantum Encryption with Certified Deletion
Secure Quantum Extraction Protocols
Non-interactive Classical Verification of Quantum Computation
Classical Verification of Quantum Computations with Efficient Verifier
Coupling of Random Systems
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity
Zero-Communication Reductions
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
On the Security of Time-Lock Puzzles and Timed Commitments
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
On the Complexity of Arithmetic Secret Sharing
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
Transparent Error Correcting in a Computationally Bounded World
New Techniques in Replica Encodings with Client Setup.
Security analysis of SPAKE2+
Schrödinger's Pirate: How To Trace a Quantum Decoder
Quantum Encryption with Certified Deletion
Secure Quantum Extraction Protocols
Non-interactive Classical Verification of Quantum Computation
Classical Verification of Quantum Computations with Efficient Verifier
Coupling of Random Systems
Towards Defeating Backdoored Random Oracles: Indifferentiability with Bounded Adaptivity
Zero-Communication Reductions
Lower Bounds on the Time/Memory Tradeoff of Function Inversion
Super-Linear Time-Memory Trade-Offs for Symmetric Encryption
Algebraic Distinguishers: From Discrete Logarithms to Decisional Uber Assumptions
On the Security of Time-Lock Puzzles and Timed Commitments
Expected-Time Cryptography: Generic Techniques and Applications to Concrete Soundness
On the Complexity of Arithmetic Secret Sharing
Robust Secret Sharing with Almost Optimal Share Size and Security Against Rushing Adversaries
The Share Size of Secret-Sharing Schemes for Almost All Access Structures and Graphs
Transparent Error Correcting in a Computationally Bounded World
New Techniques in Replica Encodings with Client Setup.