Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
From MaRDI portal
Publication:2902914
DOI10.1007/978-3-642-27375-9_3zbMath1378.94055OpenAlexW1805451635MaRDI QIDQ2902914
Publication date: 22 August 2012
Published in: Theory of Security and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-27375-9_3
Related Items (35)
MoSS: modular security specifications framework ⋮ Short variable length domain extenders with beyond birthday bound security ⋮ Composition with knowledge assumptions ⋮ From Indifferentiability to Constructive Cryptography (and Back) ⋮ Simultaneous Secrecy and Reliability Amplification for a General Channel Model ⋮ Virtual Grey-Boxes Beyond Obfuscation: A Statistical Security Notion for Cryptographic Agents ⋮ Robust Authenticated Encryption and the Limits of Symmetric Cryptography ⋮ CryptHOL: game-based proofs in higher-order logic ⋮ Composable and finite computational security of quantum message transmission ⋮ A unified and composable take on ratcheting ⋮ Universally Composable Firewall Architectures Using Trusted Hardware ⋮ Query-Complexity Amplification for Random Oracles ⋮ Witness-succinct universally-composable SNARKs ⋮ Universal Composition with Responsive Environments ⋮ A more complete analysis of the signal double ratchet algorithm ⋮ Anonymous authenticated communication ⋮ Identity-based encryption for fair anonymity applications: defining, implementing, and applying rerandomizable RCCA-secure IBE ⋮ Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) ⋮ Efficient proofs of retrievability using expander codes ⋮ Universal reductions: reductions relative to stateful oracles ⋮ Categorical composable cryptography: extended version ⋮ Categorical composable cryptography ⋮ Security limitations of classical-client delegated quantum computing ⋮ Adaptive security of multi-party protocols, revisited ⋮ The IITM model: a simple and expressive model for universal composability ⋮ State separation for code-based game-playing proofs ⋮ RIV for Robust Authenticated Encryption ⋮ Classical leakage resilience from fault-tolerant quantum computation ⋮ Toward an algebraic theory of systems ⋮ Simplified Universal Composability Framework ⋮ TARDIS: a foundation of time-lock puzzles in UC ⋮ Revisiting (R)CCA security and replay protection ⋮ Memory Erasability Amplification ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Quantum Authentication with Key Recycling
This page was built for publication: Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
