欢迎访问中国科学院大学学报,今天是
论文

秘密认证中的可否认性问题

  • 唐强 ,
  • 姬东耀
展开
  • 中国科学院研究生院信息安全国家重点实验室,北京 100049

收稿日期: 2009-01-14

  修回日期: 2009-05-05

  网络出版日期: 2009-11-15

基金资助

国家自然科学基金(90604010)、国家973计划(2007CB311202)和国家863计划(2006AA01Z427)资助 

Deniable problems in secret authentication

  • TANG Qiang ,
  • JI Dong-Yao
Expand
  • State Key Lab. of Information Security, Graduate University of the Chinese Academy of Sciences, Beijing 100049, China

Received date: 2009-01-14

  Revised date: 2009-05-05

  Online published: 2009-11-15

摘要

针对一类隐私性问题,一些特定组织中的成员只愿意与本组成员进行一些交流,或者发布一些请求;接收方不是该小组的成员时,不能获知消息;当双方在一个小组时,消息能够被阅读并要求经过认证;通信结束时,发送方不希望接收方向其他人证明他曾发送某请求.目前所有的相关研究都不能很好地解决这类问题.我们形式化地描述了这个问题,构造了一个非交互的可否认的秘密认证协议,并证明了该协议的安全性和可否认性.

本文引用格式

唐强 , 姬东耀 . 秘密认证中的可否认性问题[J]. 中国科学院大学学报, 2009 , 26(6) : 835 -840 . DOI: 10.7523/j.issn.2095-6134.2009.6.015

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.

参考文献


[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 //30th 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.

文章导航

/