By Topic

Cryptanalysis and improvements of an anonymous multi-receiver identity-based encryption scheme

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $33
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
H. Wang ; School of Information Engineering, Dalian Ocean University, People's Republic of China; Department of Computer Engineering and Maths, UNESCO Chair in Data Privacy, Universitat Rovira i Virgili, Tarragona, Catalonia ; Y. Zhang ; H. Xiong ; B. Qin

In 2010, Fan et al. presented an anonymous multi-receiver identity-based encryption scheme where they adopt Lagrange interpolating polynomial mechanism. They showed that their scheme makes it impossible for an attacker or any other message receiver to derive the identity of a message receiver such that the privacy of every receiver can be guaranteed. They also formally showed that every receiver in the proposed scheme is anonymous to any other receiver. In this work, the authors study the security of Fan et al.'s anonymous multi-receiver identity-based encryption scheme. It is regretful that they found their scheme is insecure. Every receiver in Fan et al.'s scheme is not anonymous to any other receiver. The authors showed that simple protocol changes can fix these weaknesses and render Fan et al.'s scheme. The improved scheme is proved to satisfy the confidentiality and receiver anonymity in the random oracle.

Published in:

IET Information Security  (Volume:6 ,  Issue: 1 )