No Access

EFFICIENT ID-BASED MULTI-RECEIVER THRESHOLD DECRYPTION

Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road Shanghai, 200240, China

Search for more papers by this author

ZHENFU CAO

Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road Shanghai, 200240, China

Search for more papers by this author

, and

XIAOLEI DONG

Department of Computer Science and Engineering, Shanghai Jiao Tong University, 800 Dongchuan Road Shanghai, 200240, China

Search for more papers by this author

https://doi.org/10.1142/S0129054107005091Cited by:4 (Source: Crossref)

Abstract

Threshold decryption allows a message encrypted under a public key to be read only when a quorum of users cooperate to decrypt the ciphertext. However, such threshold decryption scheme does not apply well in the situation where all the users have their own public/private key pairs, but not share any private key associated with a public key, such as mobile ad hoc network featured by its dynamic character. An immediate way to achieve threshold decryption in this situation is to split the message into pieces, then encrypt these pieces under the public keys of different users. However, it is not efficient. In this paper, we propose an efficient identity based multi-receiver threshold decryption scheme that could be applied efficiently in the above situation. We also define the security notions and prove the security in random oracle model. At last, we add the broadcast feature to the scheme, such that a message could be broadcast to any number of groups.

Keywords:

References

J. Baek, R. Safavi and W. Susilo, Identity based multi-receiver encryption and its application to broadcast encryption, 8th International Workshop on Practice and Theory in Public Key Cryptography PKC 2005, Lecture Notes in Computer Science 3386, ed. Serge Vaudenay (Springer-Verlag, New York, 2005) pp. 380–397. Google Scholar
J. Baek and Y. Zheng, Identity-based threshold decryption, 7th International Workshop on Theory and Practice in Public Key Cryptography, Lecture Notes in Computer Science 2947, eds. F. Bao, R. Deng and J. Zhou (Springer-Verlag, New York, 2004) pp. 262–276. Google Scholar
O. Baudron, D. Pointcheval and J. Stern, Extended notions of securing for multi-cast public key cryptosystems, 27th International Colloquium, ICALP 2000, Lecture Notes in Computer Science 1853, eds. G. Goos, J. Hartmanis and J. van Leeuwen (Springer-Verlag, New York, 2000) pp. 499–511. Google Scholar
M. Bellare, A. Boldyreva and S. Micali, Public key encryption in a Multi-user setting: security proofs and improvements, Proc. Advances in Cryptology-Eurocrypt 2000, Lecture Notes in Computer Science 1807, ed. B. Preneel (Springer-Verlag, New York, 2000) pp. 259–274. Google Scholar
M. Bellare, A. Boldyreva and J. Staddon, Randomness re-use in multi-recepient encryption schemes, 6th International Workshop on Practice and Theory in Public Key Cryptography PKC 2003, Lecture Notes in Computer Science 2567, ed. Y. G. Desmedt (Springer-Verlag, New York, 2003) pp. 85–99. Google Scholar
D. Boneh and X. Boyen, Efficient selective-ID secure identity based encryption without random oracles, Advances in Cryptology-Eurocrypt'04, Lecture Notes in Computer Science 3027, eds. C. Cachin and J. Camenisch (Springer-Verlag, New York, 2004) pp. 223–238. Google Scholar
D. Boneh and M. Franklin, Identity-based encryption from the Weil Pairing, Proc. Advances in Cryptology - CRYPTO 2001, Lecture Notes in Computer Science 2139, ed. J. Kilian (Springer-Verlag, New York, 2001) pp. 213–229. Google Scholar
E. Bresson, J. Stern and M. Szydlo, Threshold Ring Signatures and Applications to Ad-hoc Groups, Advances in Cryptology - CRYPTO 2002, Lecture Notes in Computer Science 2442, ed. M. Yung (Springer-Verlag, New York, 2002) pp. 465–480. Google Scholar
R. Canetti, S. Halevi and J. Katz, A forward-secure public-key encryption scheme, Proceedings of Eurocrypt 2003, Lecture Notes in Computer Science 2656, ed. E. Biham (Springer-Verlag, New York, 2003) pp. 255–271. Google Scholar
Y. Dodis and N. Fazio, Public key broadcast encryption for stateless receivers, Proc. Digital Rights Management: ACM CCS-9 Workshop, DRM 2002, Lecture Notes in Computer Science 2696, ed. J. Feigenbaum (Springer-Verlag, New York, 2002) pp. 61–80. Google Scholar
A. Fiat and M. Naor, Broadcast Encryption, Proc. Adcances in Cryptology - Crypto'93, Lecture Notes in Computer Science 773, ed. D. R. Stinson (Springer-Verlag, New York, 1994) pp. 480–491. Google Scholar
D. Halevy and A. Shamir, The LSD broadcast encryption scheme, Proceedings of Crypto'02, Lecture Notes in Computer Science 2442, ed. M. Yung (Springer-Verlag, New York, 2002) pp. 47–60. Google Scholar
K. Kurosawa, Multi-recipient public key encryption with shortened ciphertext, 5th International Workshop on Practice and Theory in Public Key Cryptography PKC 2002, Lecture Notes in Computer Science 2274, eds. D. Naccache and P. Paillier (Springer-Verlag, New York, 2002) pp. 48–63. Google Scholar
B. Libert and J. J. Quisquater, Efficient revocation and threshold pairing based cryptosystems, Proceedings of the Annual ACM Symposium on Principles of Distributed Computing (ACM Press, New York, 2003) pp. 163–171. Google Scholar
A. Shamir, Communications of the ACM 22(11), 612 (1979), DOI: 10.1145/359168.359176. Crossref, Web of Science, Google Scholar
A. Shamir, Identity based cryptosystems and signature schemes, Proc. Advances in Cryptology-Crypto'84, Lecture Notes in Computer Science 0196, eds. G. R. Blakley and D. Chaum (Springer-Verlag, New York, 1984) pp. 48–53. Google Scholar
V. Shoup and R. Gennaro, Securing threshold cryptosystems against chosen ciphertext attack, Proc. Advances in Cryptology-Eurocrypt'98, Lecture Notes in Computer Science 1403, ed. Kaisa Nyberg (Springer-Verlag, New York, 1998) pp. 1–16. Google Scholar
X. Yi, IEEE communications letters 7(2), 76 (2003). Web of Science, Google Scholar