An efficient receiver deniable encryption scheme and its applications

Journal of Networks

Volumn 5, Issue 6, 2010, Pages 683-690

  Meng, Bo ^a   Wang, Jiang Qing ^a  

^a SOUTH CENTRAL UNIVERSITY FOR NATIONALITIES   (China)

Author keywords

BCP commitment scheme; Deniable encryption; Internet voting; Protocol security

Indexed keywords

CIPHERTEXTS; COMMITMENT SCHEME; CRYPTOGRAPHIC PRIMITIVES; CRYPTOGRAPHIC PROTOCOLS; ELECTRONIC AUCTION; ENCRYPTION SCHEMES; HIGH POTENTIAL; INTERNET VOTING; INTERNET VOTING PROTOCOL; PHYSICAL ASSUMPTIONS; SECURE MULTI-PARTY COMPUTATION;

INTERNET; INTERNET PROTOCOLS; NETWORK SECURITY;

CRYPTOGRAPHY;

EID: 78651376016     PISSN: 17962056     EISSN: None     Source Type: Journal    
DOI: 10.4304/jnw.5.6.683-690     Document Type: Article

References (18)

1. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, "Deniable encryption," (preliminary version), May 10, 1996.
2. R. Canetti, C. Dwork, M. Naor, and R. Ostrovsky, "Deniable encryption," Proceedings of the 17th Annual international Cryptology Conference on Advances in Cryptology, pp. 90-104, Springer-Verlag, London, 1997.
3. J. Assange, R. Weinmann, "Rubberhose filesystem, " http://iq.org/~proff/rubberhose.org/,1997
4. Z. Rja¡|skov́a, "Electronic Voting Schemes," Master thesis. Department of Computer Science Faculty of Mathematics, Physics and Informatics Comenius University, Bratislava, April 2002.
5. M. Klonowski, P. Kubiak, and M. Kutyłowsk, "Practical Deniable Encryption," SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008. pp599-609.
6. M.H. Ibrahim, "A Method for Obtaining Deniable Public-Key Encryption," International Journal of Network Security, Vol.8, No.1, PP.1-9, Jan. 2009
7. R. Canetti, R. Gennaro, "Incoercible multiparty computation," In Proceedings of the 37th Annual Symposium on Foundations of Computer Science (October 14-16, 1996). FOCS. IEEE Computer Society, Washington, DC, 504
8. M.H. Ibrahim, "Receiver-deniable Public-Key Encryption," International Journal of Network Security, Vol.8, No.2, PP.159-165, Mar. 2009
9. E. Bresson, D. Catalano, and D. Pointcheval, "A simple public key cryptosystem with a double trapdoor decryption mechanism and its applications". In: Laih CS, ed. Aciacrypt 2003. LNCS 2894, Berlin: Springer-Verlag, 2003. 37-54
10. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," In: Blakely, G.R., Chaum, D. (eds.) CRYPTO 1984. LNCS, vol. 196,pp. 10-18. Springer, Heidelberg (1985)
11. T. ElGamal, "A public key cryptosystem and a signature scheme based on discrete logarithms," IEEE Trans. Inf. Theory 31(4), 469-472 (1985)
12. J. Benaloh, D. Tuinstra, "Receipt-free secret-ballot elections," Proceeding of the Twenty-Sixth Annual ACM Symposium on theory of Computing, Montréal, Québec, Canada, May 1994. ACM New York, NY, USA
13. T. Okamoto, "Receipt-free electronic voting schemes for large scale elections," Proceeding of Security Protocols Workshop, Springer-Verlag, LNCS 1361, 1997: 25-35. 1997
14. A. Juels, M. Jakobsson, "Coercion-resistant electronic elections," 2002. http://www.voteauction.net/VOTEAUCTION/165.pdf
15. A. Acquisti, "Receipt-Free Homomorphic Elections and Write-in Voter Verified Ballots," Technical Report 2004/105, International Association for Cryptologic Research, May 2, 2004, and Carnegie Mellon Institute for Software Research International, CMU-ISRI-04-116, 2004. http://www.heinz.cmu.edu/~acquisti/papers/acquisti-electronic_voting.pdf
16. B. Meng, "An Internet Voting Protocol with Receipt-free and Coercion-resistant," IEEE 7th International Conference on Computer and Information Technology, University of Aizu, Fukushima Japan, 16 ~ 19 October, 2007.IEEE CS
17. B. Meng, "A Secure Internet Voting Protocol Based on Non-interactive Deniable Authentication Protocol and Proof Protocol that Two Ciphertexts are Encryption of the Same Plaintext," Journal of Networks.2009,4(5):370-377.
18. D. L. Chaum, "Untraceable electronic mail, return addresses, and digital pseudonyms," Communications of the ACM, 24(2), 1981: 84-88.