Efficient selective identity-based encryption without random oracles
From MaRDI portal
Publication:656924
DOI10.1007/S00145-010-9078-6zbMATH Open1251.94022OpenAlexW2138018104WikidataQ121321312 ScholiaQ121321312MaRDI QIDQ656924FDOQ656924
Authors: Dan Boneh, Xavier Boyen 
Publication date: 13 January 2012
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://eprints.qut.edu.au/69165/1/Boyen_accepted_draft.pdf
Recommendations
Cites Work
- A taxonomy of pairing-friendly elliptic curves
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Identity-based cryptosystems and signature schemes
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- 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
- Practical Identity-Based Encryption Without Random Oracles
- Hierarchical Identity Based Encryption with Polynomially Many Levels
- Title not available (Why is that?)
- Hierarchical ID-Based Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- 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
- Efficient Identity-Based Encryption Without Random Oracles
- Chosen‐Ciphertext Security from Identity‐Based Encryption
- Pairing-Friendly Elliptic Curves of Prime Order
- Cryptography and Coding
- A Digital Signature Scheme Secure Against Adaptive Chosen-Message Attacks
- Securing threshold cryptosystems against chosen ciphertext attack
- The Weil pairing, and its efficient calculation
- Title not available (Why is that?)
- Topics in Cryptology – CT-RSA 2006
- Pairings for cryptographers
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology – CRYPTO 2004
- Security Analysis of the Strong Diffie-Hellman Problem
- Advances in Cryptology - EUROCRYPT 2004
- Optimal Randomness Extraction from a Diffie-Hellman Element
- Advances in Cryptology – CRYPTO 2004
- General Ad Hoc Encryption from Exponent Inversion IBE
- Topics in Cryptology – CT-RSA 2005
- Title not available (Why is that?)
- A non-interactive public-key distribution system
- Title not available (Why is that?)
- Title not available (Why is that?)
- Delegating Capabilities in Predicate Encryption Systems
- Algorithmic Number Theory
- Breaking generalized Diffie-Hellman modulo a composite is no easier than factoring
- Topics in Cryptology – CT-RSA 2005
- A Separation Between Selective and Full-Identity Security Notions for Identity-Based Encryption
- Title not available (Why is that?)
- Public Key Encryption with Searchable Keywords Based on Jacobi Symbols
Cited In (53)
- Identity-based Encryption from the Diffie-Hellman Assumption
- How to Generate and Use Universal Samplers
- Combined schemes for signature and encryption: the public-key and the identity-based setting
- An efficient IBE scheme with tight security reduction in the random oracle model
- New technique for chosen-ciphertext security based on non-interactive zero-knowledge
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Generalized IBE in the exponent-inversion framework
- Extended explicit relations between trace, definition field, and embedding degree
- From selective to full security: semi-generic transformations in the standard model
- General Ad Hoc Encryption from Exponent Inversion IBE
- Constant-round maliciously secure two-party computation in the RAM model
- Fully secure functional encryption for inner products, from standard assumptions
- Short signatures from Diffie-Hellman: realizing almost compact public key
- An identity-based key-encapsulation mechanism built on identity-based factors selection
- On the power of rewinding simulators in functional encryption
- Unbounded HIBE with tight security
- Turing machines with shortcuts: efficient attribute-based encryption for bounded functions
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Simple and generic constructions of succinct functional encryption
- Linear-map vector commitments and their practical applications
- From selective IBE to full IBE and selective HIBE
- \textsf{TOPAS} 2-pass key exchange with full perfect forward secrecy and optimal communication complexity
- From selective-ID to full-ID IBS without random oracles
- Identity-based matchmaking encryption without random oracles
- A Separation Between Selective and Full-Identity Security Notions for Identity-Based Encryption
- Constant-round maliciously secure two-party computation in the RAM model
- Attribute-based proxy re-encryption from standard lattices
- Hierarchical and non-monotonic key-policy attribute-based encryption and its application
- Revocable hierarchical identity-based encryption with shorter private keys and update keys
- Compact IBBE and fuzzy IBE from simple assumptions
- Identity-based encryption and hierarchical identity-based encryption
- Topics in Cryptology – CT-RSA 2004
- Adaptively secure inner product encryption from LWE
- Generic negation of pair encodings
- Efficient identity-based encryption from LWR
- Aggregatable distributed key generation
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Boneh-Boyen IBE
- Bounded-collusion decentralized ABE with sublinear parameters
- Practical Identity-Based Encryption Without Random Oracles
- Anonymous HIBE with short ciphertexts: full security in prime order groups
- A novel commutative blinding identity based encryption scheme
- Optimal generic attack against basic Boneh-Boyen signatures
- Self-updatable encryption: time constrained access control with hidden attributes and better efficiency
- Practical hybrid (hierarchical) identity-based encryption schemes based on the decisional bilinear Diffie-Hellman assumption
- Efficient RKA-Secure KEM and IBE Schemes Against Invertible Functions
- The \(k\)-BDH assumption family: bilinear map cryptography from progressively weaker assumptions
- Idealizing identity-based encryption
- Identity-Based Parallel Key-Insulated Encryption Without Random Oracles: Security Notions and Construction
- Certificateless encryption scheme with provable security in the standard model suitable for mobile devices
- Constructions of CCA-Secure Revocable Identity-Based Encryption
This page was built for publication: Efficient selective identity-based encryption without random oracles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656924)
