Universally composable security concurrent deniable authentication based on witness indistinguishable

Ruan Jian Xue Bao/Journal of Software

Volumn 18, Issue 11, 2007, Pages 2871-2881

  Feng, Tao ^a   Ma, Jian Feng ^a  

^a XIDIAN UNIVERSITY   (China)

Author keywords

Concurrent deniable authentication; Information security; Universally composable security; Verifiably smooth projective Hashing; Witness indistinguishable

Indexed keywords

AUTHENTICATION; CRYPTOGRAPHY; NETWORK PROTOCOLS;

CONCURRENT DENIABLE AUTHENTICATION; INFORMATION SECURITY; UNIVERSALLY COMPOSABLE SECURITY; VERIFIABLY SMOOTH PROJECTIVE HASHING; WITNESS-INDISTINGUISHABLE;

SECURITY OF DATA;

EID: 37349038164     PISSN: 10009825     EISSN: None     Source Type: Journal    
DOI: 10.1360/jos182871     Document Type: Article

References (17)

1. Dwork C, Naor M, Sahai A. Concurrent zero-knowledge. In: Vitter J, ed. Proc. of the 13th Annual ACM Symp. on Theory of Computing. New York: ACM Press, 1998. 409-418.
2. Xu CX, Fan L, Li JH. Deniable authentication protocol based on Diffie-Hellman algorithm. Computer Engineering, 2002, 28(10): 145-146 (in Chinese with English abstract).
3. Cao TJ, Lin DD, Xue R. An efficient ID-based deniable authentication protocol from pairings. In: Proc. of the I9th Int'l Conf. on Advanced Information Networking and Applications, Vol. 1. IEEE Press, 2005. 388-391.
4. Aumann Y, Authentication MR. Enhanced security and error correcting codes (extended abstract). In: Proc. of the 18th Annual Int'l Cryptology Conf. on Advances in Cryptology. London: Springer-Verlag, 1998. 299-303.
5. Deng X, Lee CH, Zhu H. Deniable authentication protocols. IEE Proc.-Computers Digital Techniques, 2001, 148(2): 101-104.
6. Zhu RW, Wong DS, Lee CH. Cryptanalysis of a suite of deniable authentication protocols. IEEE Communications Letters, 2006, 10(6): 504-506.
7. Raimondo MD, Gennaro R. New approaches for deniable authentication. In: Proc. of the 12th ACM Conf. on Computer and Communications Security. New York: ACM Press, 2005. 112-121.
8. Goldreich O, Micali S, Wigderson A. How to play any mental game or a completeness theorem for protocols with honest majority. In: Proc. of the 19th Annual ACM Conf. on Theory of Computing. New York: ACM Press, 1987. 218-229.
9. Canetti R, Lindell Y, Ostrovsky R, Sahai A. Universally composable two-party and multi-party secure computation. In: Proc. of the 34th ACM Symp. on the Theory of Computing. Quebec: ACM Press, 2002. 494-503.
10. Canetti R. Universally composable security: A new paradigm for cryptographic protocols. In: Proc. of the 42nd IEEE Symp. on the FOCS. New York: IEEE Computer Society Press, 2001. 136-145.
11. Kalai YT. Smooth projective hashing and two-message oblivious transfer. In: Advances in Cryptology, Eurocrypt 2005. LNCS 3494, Berlin: Springer-Verlag, 2005. 78-96.
12. Damgard I, Nielsen JB. Improved non-committing encryption schemes based on general complexity assumptions. In: Proc. of the CRYPTO 2000. LNCS 1880, Berlin: Springer-Verlag, 2000. 432-450.
13. Feige U, Shamir A. Witness indistinguishable and witness hiding protocols. In: Proc. of the 22nd ACM Symp. on the Theory of Computing. Baltimore: ACM Press, 1990. 416-426.
14. Paillier P. Public-Key cryptosystems based on composite-degree residuosity classes. In: Advances in Cryptology, Eurocrypt'99. LNCS 1592, Berlin: Springer-Verlag, 1999. 223-238.
15. Cramer R, Shoup V. Universal Hash proofs and a paradigm for adaptive chosen cipher text secure public-key encryption. In: Advances in Cryptology, Eurocrypt 2002. LNCS 2332, Berlin: Springer-Verlag, 2002. 45-64.
16. Canetti R, Halevi S, Katz J. Adaptively-Secure, non-interactive public-key encryption. http://eprint.iacr.org/2004/317.pdf.
17. Bellare M, Canetti R, Krawzyk H. A modular approach to the design and analysis of authentication and key exchange protocols. In: Proc. of the 30th Symp. on Theory of Computing. Dallas: ACM Press, 1998. 419-428.