Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme

DOI10.1007/978-3-642-01001-9_24zbMath1239.94034OpenAlexW2097834299MaRDI QIDQ3627448

Mihir Bellare, Thomas Ristenpart

Publication date: 12 May 2009

Published in: Advances in Cryptology - EUROCRYPT 2009 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-01001-9_24

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items

Born and raised distributively: fully distributed non-interactive adaptively-secure threshold signatures with short shares ⋮ Sequential aggregate signatures, multisignatures, and verifiably encrypted signatures without random oracles ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Short signatures from Diffie-Hellman: realizing almost compact public key ⋮ Linearly homomorphic structure-preserving signatures and their applications ⋮ Digital Signatures with Memory-Tight Security in the Multi-challenge Setting ⋮ Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps ⋮ Multi-client inner product encryption: function-hiding instantiations without random oracles ⋮ Lattice-based signatures with tight adaptive corruptions and more ⋮ Key encapsulation mechanism with tight enhanced security in the multi-user setting: impossibility result and optimal tightness ⋮ Lattice-based programmable hash functions and applications ⋮ Programmable hash functions and their applications ⋮ Ring-based identity based encryption -- asymptotically shorter MPK and tighter security ⋮ Reflections on the security proofs of Boneh-Franklin identity-based encryption scheme ⋮ All-but-many encryption ⋮ New chosen-ciphertext secure identity-based encryption with tight security reduction to the bilinear Diffie-Hellman problem ⋮ Verifiable random functions from non-interactive witness-indistinguishable proofs ⋮ Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model ⋮ Verifiable Random Functions from Standard Assumptions ⋮ On the tight security of TLS 1.3: theoretically sound cryptographic parameters for real-world deployments ⋮ Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme ⋮ Verifiable Security of Boneh-Franklin Identity-Based Encryption ⋮ Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance ⋮ Verifiable random functions with optimal tightness ⋮ Optimal Security Proofs for Signatures from Identification Schemes ⋮ Direct chosen-ciphertext secure identity-based key encapsulation without random oracles ⋮ Adaptively secure constrained pseudorandom functions in the standard model ⋮ Short identity-based signatures with tight security from lattices

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A taxonomy of pairing-friendly elliptic curves
• Identity-Based Encryption Gone Wild
• The Security of Triple Encryption and a Framework for Code-Based Game-Playing Proofs
• Practical Identity-Based Encryption Without Random Oracles
• Programmable Hash Functions and Their Applications
• Efficient Chosen-Ciphertext Secure Identity-Based Encryption with Wildcards
• Simulation without the Artificial Abort: Simplified Proof and Improved Concrete Security for Waters’ IBE Scheme
• An Identity Based Encryption Scheme Based on Quadratic Residues
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Advances in Cryptology - EUROCRYPT 2004
• Efficient Identity-Based Encryption Without Random Oracles
• Fuzzy Identity-Based Encryption
• Blind Identity-Based Encryption and Simulatable Oblivious Transfer
• General Ad Hoc Encryption from Exponent Inversion IBE
• HIBE With Short Public Parameters Without Random Oracle
• Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
• Information Security and Cryptology - ICISC 2005
• Selecting cryptographic key sizes