Short variable length domain extenders with beyond birthday bound security
From MaRDI portal
Publication:1633453
DOI10.1007/978-3-030-03326-2_9zbMath1446.94116OpenAlexW2892492927MaRDI QIDQ1633453
Bart Mennink, Yu Long Chen, Mridul Nandi
Publication date: 20 December 2018
Full work available at URL: https://doi.org/10.1007/978-3-030-03326-2_9
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
- A calculus of mobile processes. I
- State separation for code-based game-playing proofs
- A cryptographic analysis of the TLS 1.3 handshake protocol
- A formal security analysis of the Signal messaging protocol
- A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
- Post-quantum security of Fiat-Shamir
- GNUC: a new universal composability framework
- Simplified Universal Composability Framework
- Dependent types and multi-monadic effects in F*
- On the Security of the TLS Protocol: A Systematic Analysis
- Non-uniform Cracks in the Concrete: The Power of Free Precomputation
- Proving the TLS Handshake Secure (As It Is)
- Formalizing Human Ignorance
- Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
- On the Security of TLS-DHE in the Standard Model
- Secure Identity-Based Encryption in the Quantum Random Oracle Model
- Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols
- An equational approach to secure multi-party computation
- Careful with Composition: Limitations of the Indifferentiability Framework
- (De-)Constructing TLS 1.3
- Constructive Cryptography – A Primer
- The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
- Long-Term Security and Universal Composability
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- Computer-Aided Security Proofs for the Working Cryptographer
- Efficient Identity-Based Encryption Without Random Oracles
- HMQV: A High-Performance Secure Diffie-Hellman Protocol
- Theory of Cryptography
This page was built for publication: Short variable length domain extenders with beyond birthday bound security
