Design and analysis of a provable secure multi-recipient public key encryption scheme

Ruan Jian Xue Bao/Journal of Software

Volumn 20, Issue 10, 2009, Pages 2907-2914

  Pang, Liao Jun ^a   Li, Hui Xian ^b   Jiao, Li Cheng ^a   Wang, Yu Min ^a  

^a XIDIAN UNIVERSITY   (China)

^b NORTHWESTERN POLYTECHNICAL UNIVERSITY   (China)

Author keywords

Elliptic curve; Multi recipient public key encryption; Secret sharing; Secure broadcasting

Indexed keywords

BILINEAR PAIRING; CIPHERTEXTS; DECRYPTION KEYS; DESIGN AND ANALYSIS; DIFFIE-HELLMAN ASSUMPTION; ELLIPTIC CURVE; ENCRYPTION KEY; IND-CCA2 SECURITY; KEY-DISTRIBUTION PROTOCOLS; MULTI-RECIPIENT PUBLIC KEY ENCRYPTION; OPEN NETWORK; PUBLIC-KEY ENCRYPTION SCHEME; SECRET SHARING; SENSITIVE INFORMATIONS; THRESHOLD SECRET SHARING;

BROADCASTING; GEOMETRY; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

NETWORK SECURITY;

EID: 70449723369     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.3724/SP.J.1001.2009.03552     Document Type: Article

References (12)

1. IEEE Standard. P802.11i Draft Supplement to Standard for Telecommunications and Information Exchange Between Systems-LAN/MAN Specific Requirements - Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Specification for Enhanced Security. Piscataway: IEEE Press, 2002.
2. Chinese Standard. GB15629.11-2003/XG1-2006 of Telecommunications and Information Exchange Between Systems-LAN/MAN Specific Requirements - Part 11: Wireless Medium Access Control (MAC) and Physical Layer (PHY) Specifications: Specification for Enhanced Security. Beijing: Chinese Standard Press, 2006 (in Chinese).
3. Baudron O, Pointcheval D, Stern J. Extended notions of security for multicast public key cryptosystems. In: Widmayer P, Francisco T, et al., eds. Proc. of the Automata, Languages and Programming, the 29th Int'l Colloquium (ICALP 2000). LNCS 1853, Heidelberg: Springer-Verlag, 2000. 499-511.
4. Bellare M, Boldyreva A, Micali S. Public-Key encryption in a multi-user setting: Security proofs and improvements. In: Naor M, ed. Proc. of the Advances in Cryptology (Eurocrypt 2000). LNCS 1807, Heidelberg: Springer-Verlag, 2000. 259-274.
5. Kurosawa K. Multi-Recipient public-key encryption with shortened ciphertext. In: Naccache D, Paillier P, eds. Proc. of the 5th Int'l Workshop on Practice and Theory in Public Key Cryptography (PKC 2002). LNCS 2274, Heidelberg: Springer-Verlag, 2002. 48-63.
6. Mu Y, Susilo W, Lin Y. Identity-Based broadcasting. In: Johansson T, Maitra S, eds. Proc. of the 4th Int'l Conf. on Cryptology in India (INDOCRYPT 2003). LNCS 2904, Heidelberg: Springer-Verlag, 2003. 177-190.
7. Baek J, Safavi-Naini R, Susilo W. Efficient multi-receiver identity-based encryption and its application to broadcast encryption. In: Vaudenay S, ed. Proc. of the 8th Int'l Workshop on Practice and Theory in Public Key Cryptography (PKC 2005). LNCS 3386, Heidelberg: Springer-Verlag, 2005. 380-397.
8. Pang LJ, Liu Y, Wang YM. An efficient (t, n) threshold multi-secret sharing scheme. Acta Electronica Sinica, 2006, 34 (4): 587-589 (in Chinese with English abstract).
9. Okamoto T, Pointcheval D. REACT: Rapid enhanced-security asymmetric cryptosystem transform. In: Naccache D, ed. Proc. of the Cryptographer's Track at RSA Conference (CT-RSA 2001). LNCS 2020, Heidelberg: Springer-Verlag, 2001. 159-174.
10. Okamoto T, Pointcheval D. The gap-problems: A new class of problems for the security of cryptographic schemes. In: Kim KJ, ed. Proc. of the 4th Int'l Workshop on Practice and Theory in Public Key Cryptography (PKC 2001). LNCS 1992, Heidelberg: Springer-Verlag, 2001. 104-118.
11. Boneh D, Franklin M. Identity-Based encryption from the Weil pairing. In: Kilian J, ed. Proc. of the Advances in Cryptology (CRYPTO 2001). LNCS 2139, Heidelberg: Springer-Verlag, 2001. 213-229.
12. Shamir A. How to share a secret. Communications of the ACM, 1979, 22 (11): 612-613.