Deniable problems in secret authentication

doi:10.7523/j.issn.2095-6134.2009.6.015

›› 2009, Vol. 26 ›› Issue (6): 835-840.DOI: 10.7523/j.issn.2095-6134.2009.6.015

• Research Articles • Previous Articles Next Articles

Deniable problems in secret authentication

TANG Qiang, JI Dong-Yao

State Key Lab. of Information Security, Graduate University of the Chinese Academy of Sciences, Beijing 100049, China

Received:2009-01-14 Revised:2009-05-05 Online:2009-11-15

Abstract

Abstract:

One privacy-related problem is that the member in a group would like to only communicate with the member of the same group. When they are in the same group, message should be authenticated.Otherwise, nothing about the affiliation information could be leaked. After the communication, the sender would not like to leave evidence for convincing others.To the best of our knowledge,all the existing designs are not efficient in solving this kind of problems. We formalized the problem, proposed a non-interactive deniable organization hiding authentication, and proved our scheme in our model.

Key words: privacy protection, deniable authentication, secret handshakes, provable security

CLC Number:

TP309

TANG Qiang, JI Dong-Yao. Deniable problems in secret authentication[J]. , 2009, 26(6): 835-840.

References

[1] Jacobbson M, Sakko K, Impagliazzo R. Designated verifier proofs and their applications //EUROCRYPT96,LNCS. Springer, 1996,1070: 143-154.

[2] Naor M. Deniable ring authentication // CRYPTO02, LNCS. Springer, 2002,2442:481-498.

[3] Dwork C,Naor M, Sahai A. Concurrent zero-knowledge //30^th ACM Symposium on the Theory of Computing.Dallas, 1998:409-418.

[4] Rivest R L, Shamir A, Tauman Y. How to leak a secret //ASIACRYPT01, LNCS. Springer, 2001,2248:552-565.

[5] Balfanz D, Durfee G, Shankar N, et al. Secret handshakes from pairing-based key agreements //IEEE Symposium on Security and Privacy, 2003:180-196.

[6] Castelluccia C,Jarecki S, Tsudik G. Secret handshakes from CA-oblivious encryption //ASIACRYPT04,LNCS. Springer, 2004,3329:293-307.

[7] Jarecki S, Liu X M. Affiliation-hiding envelope and authentication schemes with efficient support for multiple credentials //International Conference on Automata, Languages, and Programming 2008,LNCS. Springer, 2008,5126:715-726.

[8] Fan L, Xu C X,Li J H. Deniable authenticationprotocolbasedon Diffie-Hellman algorithm
[J].IEE Electronics Letter,2002,38(14):705-706.

[9] Shao Z. Efficient deniable authentication protocol based ongeneralized ElG amal signature scheme
[J]. Computer Standards & Interfaces, 2004,26(5):449-454.

[10] Lee W B,Wu C C,Tsaur W J. A novel deniable authentication protocol based on generalized ElGamal signature scheme
[J].Information Science,2007,177:1376-1381.

[11] Raimondo M D,Gennaro R. New approaches for deniable authentication //ACM CCS05.2005:112-121.

[12] Schnorr C. Efficient identification and signatures for smart cards //CRYPTO89,LNCS. Springer, 1990:239-252.

[13] Taher ElGamal. A public-key cryptosystem and a signature scheme based on discrete logarithms
[J].IEEE Transactions on Information Theory, 1985,IT-31(4):469-472.

Deniable problems in secret authentication

PDF (PC)

Knowledge

Abstract

Cite this article

share this article

References

Related Articles 4

Recommended Articles

Metrics

Comments

[1]	SHAO Xiu-Feng, LI Rong-Hua. On the security proof of a protocol for private integer comparison [J]. , 2011, 28(2): 262-265.
[2]	PAN Jia-Xin, MA Chang-She, WANG Li-Bin. Efficient and semantically secure password-based group key exchange protocol [J]. , 2010, 27(4): 547-555.
[3]	WANG Peng. A note on pseudorandomness and unforgeability of MACs [J]. , 2010, 27(2): 263-266.
[4]	NI Yang, ZHANG Yu-Qing. Computational Analysis of TLS Handshake Protocol [J]. Journal of University of Chinese Academy of Sciences, 2008, 25(1): 110-116.