Shorter identity-based encryption via asymmetric pairings
From MaRDI portal
Publication:404944
DOI10.1007/S10623-013-9834-3zbMATH Open1299.94080OpenAlexW1999078045WikidataQ123027269 ScholiaQ123027269MaRDI QIDQ404944FDOQ404944
Authors: Jie Chen, Hoon Wei Lim, San Ling, Huaxiong Wang, Hoeteck Wee 
Publication date: 4 September 2014
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-013-9834-3
Recommendations
- Shorter IBE and signatures via asymmetric pairings
- Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security
- Efficient Identity-Based Encryption with Tight Security Reduction
- Identity-based broadcast encryption with shorter transmissions
- Efficient revocable identity-based encryption with short public parameters
- An identity-based encryption scheme with compact ciphertexts
- On Constructing Pairing-Free Identity-Based Encryptions
- Identity-based Encryption from the Diffie-Hellman Assumption
Cites Work
- Short signatures from the Weil pairing
- A taxonomy of pairing-friendly elliptic curves
- Identity-based cryptosystems and signature schemes
- Functional encryption: definitions and challenges
- 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
- Practical Identity-Based Encryption Without Random Oracles
- Title not available (Why is that?)
- An Identity Based Encryption Scheme Based on Quadratic Residues
- Identity-Based Encryption from the Weil Pairing
- Advances in Cryptology - EUROCRYPT 2004
- Efficient Identity-Based Encryption Without Random Oracles
- Pairing-Friendly Elliptic Curves of Prime Order
- Advances in Cryptology – CRYPTO 2004
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Fully secure functional encryption: attribute-based encryption and (hierarchical) inner product encryption
- Fully secure functional encryption with general relations from the decisional linear assumption
- Hierarchical Predicate Encryption for Inner-Products
- Predicate Encryption Supporting Disjunctions, Polynomial Equations, and Inner Products
- Tools for simulating features of composite order bilinear groups in the prime order setting
- Converting pairing-based cryptosystems from composite-order groups to prime-order groups
- Evidence that XTR is more secure than supersingular elliptic curve cryptosystems
- Elliptic curves suitable for pairing based cryptography
- Title not available (Why is that?)
- Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)
- Homomorphic Encryption and Signatures from Vector Decomposition
- Easy Decision Diffie-Hellman Groups
- Anonymity from Asymmetry: New Constructions for Anonymous HIBE
- Advances in Cryptology – CRYPTO 2004
Cited In (9)
- Identity-based matchmaking encryption from standard assumptions
- Multi-receiver Identity-Based Key Encapsulation with Shortened Ciphertext
- Variants of Waters' dual system primitives using asymmetric pairings. (Extended abstract)
- Title not available (Why is that?)
- Constant-size structure-preserving signatures: generic constructions and simple assumptions
- Registered attribute-based signature
- Efficient revocable identity-based encryption with short public parameters
- New revocable IBE in prime-order groups: adaptively secure, decryption key exposure resistant, and with short public parameters
- Shorter IBE and signatures via asymmetric pairings
This page was built for publication: Shorter identity-based encryption via asymmetric pairings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q404944)
