Efficient Privacy of Message Encryption Algorithm for Anonymous Receivers in E-Commerce

Abstract

protecting the privacy of message receivers is an important issue in pay services of e-commerce and the distribution of digital contents on the Internet. This paper proposes an efficient privacy of message encryption algorithm called PMEA for pay services of e-commerce. In PMEA, each of the receivers only needs to perform constant times of pairing computation to decrypt the received message. PMEA adopts bilinear pairings on elliptic curves to protect the privacy of message receivers, to ensure that an attacker or any other message receiver can not derive the identity of a message receiver such that the privacy of every receiver can be guaranteed. Detailed theoretical analysis proves that PMEA is secure and anonymous for message receivers.

Improved Anonymous Multi-receiver Identity-Based Encryption

“…To protect signer anonymity, Lal and Kushwah [14] proposed an anonymous ID-based signcryption scheme for multireceivers in the random oracle model, and Zhang and Xu [15] proposed an ID-based signcryption scheme for multiple receivers in the standard model. To protect receiver's anonymity, Wang et al [16] and Xu [17], respectively, proposed ID-based encryption schemes for multi-receivers. However, in both [16] and [17], each group member needs to maintain two sets of public-key and private-key pairs, and one of the key-pair sets changes as group membership changes.…”

“…To protect receiver's anonymity, Wang et al [16] and Xu [17], respectively, proposed ID-based encryption schemes for multi-receivers. However, in both [16] and [17], each group member needs to maintain two sets of public-key and private-key pairs, and one of the key-pair sets changes as group membership changes. These approaches, however, are inefficient.…”