A Lightweight Message Encrypt Protocol for Electronic Commerce

Abstract:

In this paper, we propose a publicly verifiable batch encryption scheme. It allows a trusted entity to verify that two or more cipher texts hind the same message without revealing it. The message can also be verified by running a single PVE scheme with the same public value for each cipher text. However, it requires more computation than our scheme. According to our analysis, our scheme can reduce the overhead of computations by 66%. Furthermore, our scheme can be applied to voting and network testing to prove the fairness.

• Periodical: Applied Mechanics and Materials (Volume 432)
• Pages: 545-548
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.432.545
• Online since: September 2013
• Authors: Xiao Jun Zhong, Lu Yao
• Keywords: Network Testing, Publicly Verifiable Batch Encryption, Voting

References

[1] A. Essex,; U. Hengartner: IEEE Security & Privacy, Vol. 10(2012), pp.18-24.

[2] K. Kurosawa: IEEE Transactions on Information Theory, Vol. 56(2010), pp.5366-5374.

[3] K. Peng: IET Information Security, Vol. 6(2012), pp.249-257.

[4] J. Benaloh,; T. Moran,; L. Naish,; K. Ramchen,; V. Teague: IEEE Transactions on Information Forensics and Security, Vol. 4(2009), pp.685-698.

DOI: 10.1109/tifs.2009.2033757

[5] S. Dziembowski,; U. Maurer: IEEE Transactions on Information Theory, Vol. 54(2008), pp.2790-2792.

[6] M. Changshe, L. Feiyu, C. Kefei: Journal of Systems Engineering and Electronics, Vol. 17(2006), pp.858-863.

DOI: 10.1016/s1004-4132(07)60028-0