Short variable length domain extenders with beyond birthday bound security
type: Item
instance of: scholarly article
title: Short variable length domain extenders with beyond birthday bound security
zbMATH Open document ID: 1446.94116
DOI: 10.1007/978-3-030-03326-2_9
author: Yu Long Chen
author: Bart Mennink
author: Mridul Nandi
publication date: 2018-12-20T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6996121
zbMATH Keywords: length doublers
zbMATH Keywords: LDT
zbMATH Keywords: beyond birthday bound
zbMATH Keywords: harmonic primitives
zbMATH Keywords: chi-squared
MaRDI profile type: Publication
full work available at URL: 978-3-030-03326-2 9
OpenAlex ID: W2892492927
cites work: Theory of Cryptography
cites work: Mind the Gap: Modular Machine-Checked Proofs of One-Round Key Exchange Protocols
cites work: Computer-Aided Security Proofs for the Working Cryptographer
cites work: Q3374913
cites work: Q3374905
cites work: Q4234051
cites work: The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
cites work: Non-uniform Cracks in the Concrete: The Power of Free Precomputation
cites work: Proving the TLS Handshake Secure (As It Is)
cites work: State separation for code-based game-playing proofs
cites work: A formal security analysis of the Signal messaging protocol
cites work: Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
cites work: Beyond eCK: perfect forward secrecy under actor compromise and ephemeral-key reveal
cites work: A cryptographic analysis of the TLS 1.3 handshake protocol
cites work: GNUC: a new universal composability framework
cites work: On the Security of TLS-DHE in the Standard Model
cites work: Q4414308
cites work: (De-)Constructing TLS 1.3
cites work: HMQV: A High-Performance Secure Diffie-Hellman Protocol
cites work: On the Security of the TLS Protocol: A Systematic Analysis
cites work: Constructive Cryptography – A Primer
cites work: Constructive Cryptography – A New Paradigm for Security Definitions and Proofs
cites work: Q4737239
cites work: An equational approach to secure multi-party computation
cites work: A calculus of mobile processes. I
cites work: A probabilistic polynomial-time process calculus for the analysis of cryptographic protocols
cites work: Long-Term Security and Universal Composability
cites work: Careful with Composition: Limitations of the Indifferentiability Framework
cites work: Formalizing Human Ignorance
cites work: Dependent types and multi-monadic effects in \(\mathrm{F}^*\)
cites work: Q4473975
cites work: Simplified Universal Composability Framework
cites work: Post-quantum security of Fiat-Shamir
cites work: Efficient Identity-Based Encryption Without Random Oracles
cites work: Secure Identity-Based Encryption in the Quantum Random Oracle Model
Recommended article: Domain Extension of Public Random Functions: Beyond the Birthday Barrier
Recommended article: On Capabilities of Hash Domain Extenders to Preserve Enhanced Security Properties
Recommended article: Beyond-birthday secure domain-preserving PRFs from a single permutation
Recommended article: On the Generic Insecurity of the Full Domain Hash
Recommended article: Beyond birthday bound secure fresh rekeying: application to authenticated encryption
Recommended article: Efficient Beyond-Birthday-Bound-Secure Deterministic Authenticated Encryption with Minimal Stretch
Recommended article: Beyond-Birthday-Bound Security Based on Tweakable Block Cipher
Recommended article: Foiling Birthday Attacks in Length-Doubling Transformations
Recommended article: A Domain Extender for the Ideal Cipher
Recommended article: Q4536804
description: scientific article; zbMATH DE number 6996121