An efficient IBE scheme with tight security reduction in the random oracle model
From MaRDI portal
Publication:264126
DOI10.1007/S10623-015-0035-0zbMATH Open1361.94046OpenAlexW1996421816MaRDI QIDQ264126FDOQ264126
Authors: Jong Hwan Park, Dong Hoon Lee 
Publication date: 5 April 2016
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-015-0035-0
Recommendations
- Efficient Identity-Based Encryption with Tight Security Reduction
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- Practical Identity-Based Encryption Without Random Oracles
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient selective identity-based encryption without random oracles
Cites Work
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- A tapestry of identity-based encryption: practical frameworks compared
- Generic constructions of identity-based and certificateless kEMs
- Title not available (Why is that?)
- Fully, (Almost) Tightly Secure IBE and Dual System Groups
- The exact security of digital signatures -- how to sign with RSA and Rabin
- Identity-based cryptosystems and signature schemes
- Functional encryption: definitions and challenges
- Public key broadcast encryption for stateless receivers
- Functional encryption for inner product predicates from learning with errors
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
- Trapdoors for hard lattices and new cryptographic constructions
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE
- Practical Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Anonymous Hierarchical Identity-Based Encryption with Constant Size Ciphertexts
- Hierarchical ID-Based Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Title not available (Why is that?)
- Title not available (Why is that?)
- Secure integration of asymmetric and symmetric encryption schemes
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Constant Size Ciphertext
- Fuzzy Identity-Based Encryption
- Searchable Encryption Revisited: Consistency Properties, Relation to Anonymous IBE, and Extensions
- CCA2 Secure IBE: Standard Model Efficiency through Authenticated Symmetric Encryption
- Efficient Identity-Based Encryption with Tight Security Reduction
- Automata, Languages and Programming
- Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
- Direct Chosen-Ciphertext Secure Identity-Based Key Encapsulation Without Random Oracles
- Cryptography and Coding
- Public Key Cryptography - PKC 2006
Cited In (13)
- Iterated random oracle: a universal approach for finding loss in security reduction
- Information Security and Cryptology - ICISC 2005
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient Identity-Based Encryption with Tight Security Reduction
- Efficient selective identity-based encryption without random oracles
- Fully secure IBE with tighter reduction in prime order bilinear groups
- A variant of Boneh-Franklin IBE with a tight reduction in the random oracle model
- An IBE scheme using ECC combined public key
- Tightly Secure IBE Under Constant-Size Master Public Key
- Generic Methods to Achieve Tighter Security Reductions for a Category of IBE Schemes
- Practical Identity-Based Encryption Without Random Oracles
- OrBit: OR-proof identity-based identification with tight security for (as low as) 1-bit loss
This page was built for publication: An efficient IBE scheme with tight security reduction in the random oracle model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q264126)
