On Constructing Pairing-Free Identity-Based Encryptions
From MaRDI portal
Recommendations
- Public Key Cryptography - PKC 2006
- Identity-Based Encryption from the Weil Pairing
- scientific article; zbMATH DE number 1842494
- Practical Identity-Based Encryption Without Random Oracles
- Efficient Identity-Based Encryption Without Random Oracles
- A Variant of Boneh-Gentry-Hamburg’s Pairing-Free Identity Based Encryption Scheme
- A provable secure pairing-free certificateless identification scheme
- Constructing certificateless encryption and ID-based encryption from ID-based key agreement
- Identity based broadcast encryption without pairings
Cites work
- A simple public-key cryptosystem with a double trapdoor decryption mechanism and its applications
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology - EUROCRYPT 2004
- Advances in Cryptology – CRYPTO 2004
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Bonsai trees, or how to delegate a lattice basis
- Dual System Encryption: Realizing Fully Secure IBE and HIBE under Simple Assumptions
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Group Encryption
- scientific article; zbMATH DE number 1842494 (Why is no real title available?)
- Identity-based cryptosystems and signature schemes
- Identity-based encryption from the Diffie-Hellman assumption
- Linearly homomorphic encryption from \(\mathsf {DDH}\)
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- The random oracle model: a twenty-year retrospective
Cited in
(4)
This page was built for publication: On Constructing Pairing-Free Identity-Based Encryptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6108845)