Identity-based cryptosystems and signature schemes
Proceedings of CRYPTO 84 on Advances in cryptology
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Identity-Based Encryption from the Weil Pairing
SIAM Journal on Computing
Identity-Based Encryption from the Weil Pairing
CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Efficient Algorithms for Pairing-Based Cryptosystems
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
Toward Hierarchical Identity-Based Encryption
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
An Identity Based Encryption Scheme Based on Quadratic Residues
Proceedings of the 8th IMA International Conference on Cryptography and Coding
ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory
Direct chosen ciphertext security from identity-based techniques
Proceedings of the 12th ACM conference on Computer and communications security
Another Look at "Provable Security"
Journal of Cryptology
A forward-secure public-key encryption scheme
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Improved efficiency for CCA-secure cryptosystems built using identity-based encryption
CT-RSA'05 Proceedings of the 2005 international conference on Topics in Cryptology
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
HEAD: hybrid encryption with delegated decryption capability
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Provably Secure Timed-Release Public Key Encryption
ACM Transactions on Information and System Security (TISSEC)
A tapestry of identity-based encryption: practical frameworks compared
International Journal of Applied Cryptography
Batch Verification of Short Signatures
EUROCRYPT '07 Proceedings of the 26th annual international conference on Advances in Cryptology
An Efficient and Provable Secure Identity-Based Identification Scheme in the Standard Model
EuroPKI '08 Proceedings of the 5th European PKI workshop on Public Key Infrastructure: Theory and Practice
Secure Hierarchical Identity Based Encryption Scheme in the Standard Model
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
New Construction of Short Hierarchical ID-Based Signature in the Standard Model
Fundamenta Informaticae
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Removing Escrow from Identity-Based Encryption
Irvine Proceedings of the 12th International Conference on Practice and Theory in Public Key Cryptography: PKC '09
Simple CCA-Secure Public Key Encryption from Any Non-Malleable Identity-Based Encryption
Information Security and Cryptology --- ICISC 2008
EUROCRYPT '09 Proceedings of the 28th Annual International Conference on Advances in Cryptology: the Theory and Applications of Cryptographic Techniques
Practical Short Signature Batch Verification
CT-RSA '09 Proceedings of the The Cryptographers' Track at the RSA Conference 2009 on Topics in Cryptology
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
Theoretical Computer Science
Efficient hybrid encryption from ID-based encryption
Designs, Codes and Cryptography
Proxy re-signature schemes without random oracles
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
Construction of a hybrid HIBE protocol secure against adaptive attacks: without random oracle
ProvSec'07 Proceedings of the 1st international conference on Provable security
Blind identity-based encryption and simulatable oblivious transfer
ASIACRYPT'07 Proceedings of the Advances in Crypotology 13th international conference on Theory and application of cryptology and information security
CCA2 secure IBE: standard model efficiency through authenticated symmetric encryption
CT-RSA'08 Proceedings of the 2008 The Cryptopgraphers' Track at the RSA conference on Topics in cryptology
Group testing and batch verification
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
New constructions for identity-based unidirectional proxy re-encryption
Journal of Computer Science and Technology
Relations between semantic security and anonymity in identity-based encryption
Information Processing Letters
Efficient CDH-based verifiably encrypted signatures with optimal bandwidth in the standard model
ADHOC-NOW'11 Proceedings of the 10th international conference on Ad-hoc, mobile, and wireless networks
HIBE with short public parameters without random oracle
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Universal designated verifier signatures without random oracles or non-black box assumptions
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Anonymous hierarchical identity-based encryption (without random oracles)
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
Efficient identity-based signatures secure in the standard model
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
Direct chosen-ciphertext secure identity-based key encapsulation without random oracles
ACISP'06 Proceedings of the 11th Australasian conference on Information Security and Privacy
New constructions of constant size ciphertext HIBE without random oracle
ICISC'06 Proceedings of the 9th international conference on Information Security and Cryptology
A novel commutative blinding identity based encryption scheme
FPS'11 Proceedings of the 4th Canada-France MITACS conference on Foundations and Practice of Security
Variants of waters' dual system primitives using asymmetric pairings
PKC'12 Proceedings of the 15th international conference on Practice and Theory in Public Key Cryptography
New Construction of Short Hierarchical ID-Based Signature in the Standard Model
Fundamenta Informaticae
Adaptively secure efficient lattice (H)IBE in standard model with short public parameters
SPACE'12 Proceedings of the Second international conference on Security, Privacy, and Applied Cryptography Engineering
International Journal of Applied Cryptography
| Hi-index | 0.00 |
At Eurocrypt 2005, Brent Waters proposed an efficient Identity Based Encryption scheme which is secure in the standard model. One drawback of this scheme is that the number of elements in the public parameter is rather large. Here we propose a generalisation of Waters scheme. In particular, we show that there is an interesting trade-off between the tightness of the security reduction and smallness of the public parameter. For a given security level, this implies that if one reduces the number of elements in public parameter then there is a corresponding increase in the computational cost due to the increase in group size. This introduces a flexibility in choosing the public parameter size without compromising in security. In concrete terms, to achieve 80-bit security for 160-bit identities we show that compared to Waters protocol the public parameter size can be reduced by almost 90 % while increasing the computation cost by 30%. Our construction is proven secure in the standard model without random oracles. Additionally, we show that CCA security can also be achieved through the reduction to oracle decision bilinear Diffie-Hellman problem (OBDH).