Modified ID-Based threshold decryption and its application to mediated ID-Based encryption

Authors:
Hak Soo Ju;Dae Youb Kim;Dong Hoon Lee;Haeryong Park;Kilsoo Chun
Affiliations:
Korea Information Security Agency(KISA), Korea;Center for Information Security Technologies;Center for Information Security Technologies;Korea Information Security Agency(KISA), Korea;Korea Information Security Agency(KISA), Korea
Venue:
APWeb'06 Proceedings of the 8th Asia-Pacific Web conference on Frontiers of WWW Research and Development
Year:
2006

Citing 7
Cited 0

Practical multi-candidate election system

Proceedings of the twentieth annual ACM symposium on Principles of distributed computing
Identity-Based Encryption from the Weil Pairing

CRYPTO '01 Proceedings of the 21st Annual International Cryptology Conference on Advances in Cryptology
Wallet Databases with Observers

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Efficient revocation and threshold pairing based cryptosystems

Proceedings of the twenty-second annual symposium on Principles of distributed computing
Fine-grained control of security capabilities

ACM Transactions on Internet Technology (TOIT)
ID-based threshold decryption without random oracles and its application in key escrow

InfoSecu '04 Proceedings of the 3rd international conference on Information security
Hierarchical identity based encryption with constant size ciphertext

EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Chai, Cao and Lu first proposed an ID-based threshold decryption scheme without random oracles. Their approach is based on the Bilinear Diffie-Hellman Inversion assumption, and prove that it is selective chosen plaintext secure without random oracles. However, to ensure correctness of their ID-based threshold decryption scheme, it is necessary to guarantee that the shared decryption is performed correctly through some public verification function. We modify Chai et al.’s scheme to ensure that all decryption shares are consistent. We also present the first mediated ID based encryption scheme based on the Bilinear Diffie Hellman Inversion assumption without random oracles. In addition, we extend it into a mediated hierarchical ID-based encryption scheme.