期刊文献+

具有可撤销匿名性的DC-Net匿名通信方案 被引量:1

A DC-Net Anonymous Communication Scheme with Revocable Anonymity
下载PDF
导出
摘要 基于Golle和Juels的工作,提出了一种具有可撤销匿名性的DC-Net匿名通信方案。方案利用双线性对的密钥托管性质,使得用户广播的每个加密消息都以由n个执行成员组成的匿名回收部门作为一个潜在的接收者。当发现危害性匿名信息时,在至少t个回收执行成员的参与下对有关的协议消息进行联合门限解密,就可以追踪到发送者。在运行时几乎没有增加任何计算复杂度和通信复杂度,并且安全性与原方案相当。对DC-Net系统而言,这种方法比已有的利用群签名实现可回收匿名性高效得多。 A DC-Net anonymous communication scheme with revocable anonymity is proposed based on Golle and Juels's work. We employ the key escrow property of bilinear parings to make the anonymity revocation authority as an implicit receiver for every encrypted protocol message broadcasted by each user. When a vicious anonymous message being detected, at least t of the authority's total n enforcing participants can jointly decrypt some related protocol messages and trace the sender. Compared with the original scheme, our construction nearly adds no computation and communication complexity and has the same security. For DC-Net, it is much more efficient than the traditional method of providing revocable anonymity by utilizing group signatures.
出处 《计算机科学》 CSCD 北大核心 2007年第9期77-79,89,共4页 Computer Science
基金 国家自然科学基金面上项目(60473028)
关键词 匿名通信 DC-Net 可撤销匿名性 双线性对 Anonymous communication, DC-Net, Revocable anonymity, Bilinear pairings
  • 相关文献

参考文献10

  • 1Chaum D.The dining cryptographers problem:unconditional sender and recipient untraceability.Journal of Cryptology,1988,1(1):65-75.
  • 2Chaum D.Untraceable electronic mail,return addresses,and digital pseudonyms.Communications of the ACM,1981,24(2):84-88.
  • 3Stefan K,Rolf W,Hannes F.Revocable anonymity.In:Proceedings of ETRICS 2006.Heidelberg:Springer-Verlag,2006.206-220.
  • 4von Ahn L,Bortz A,Hopper N.Selectively traceable anonymity.In:Proceedings of PET2006.Cambridge,UK:Springer-Verlag,2006.586-615.
  • 5Golle P,Juels A.Dining cryptographers revisited.In:Advances in Cryptology:Eurocrypt'2004.Berlin:Springer-Verlag,2004.456-473.
  • 6Waidner M.Unconditional sender and recipient untraceability in spite of active attacks.In:Advances in Cryptology:Eurocrypt'89.Berlin:Springer-Verlag,1989.302-319.
  • 7Boneh D,Franklin M.Identity based encryption from the Weil Pairing.SIAM J of Computing,2003,32(3):586-615.
  • 8Shamir A.How to share a secret.Communications of the ACM,1979,22(11):612-613.
  • 9Cramer R,Damgaard I,Schoenmakers B.Proofs of partial knowledge and simplified design of witness hiding protocols.In:Advances in Cryptology:Crypto'94.Berlin:Springer-Verlag,1994.174-187.
  • 10Bellare M,Rogaway P.Random oracles are practical:a paradigm for designing efficient protocols.In:Proceedings of ACM CCS'93.New York:ACM,1993.62-73.

同被引文献4

引证文献1

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部