期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一个新的(t,N-2)弹性的Mix Net 被引量：3

A New (t,N-2)-Resilience Mix Net
下载PDF
导出
摘要 Mixnet是实现匿名通信、电子投票选举、电子支付以及电子投标的有力工具 .该文建立了 (t,N - 2 )Mixnet模型 ,利用Shamir门限方案、ElGamal公钥体制、零知识证明等密码技术设计了一个基于这个模型的Mixnet协议 .该协议将同一密文组让不同的两个服务器组进行盲化解密示证和比较 ,从而使得该协议具有 (t - 1,N - 2 ) AA弹性及秘密性、正确性和可验证性等优点 ,同时通信量和计算量方面也少于已知的基于ElGamal公钥体制的可验证Mixnet协议 . A model of (t, N-2)-resilience Mix net is set up. A Mix net protocol based on the model is presented with the primitive cryptography tools of Shamir secret share scheme, ElGamal public key system, zero -knowledge and so on. Given an array of encrypt messages, two different groups of mix servers blind and decrypt the same array, then compare them, and finally publish the correct deciphered text on bulletin board. Our Mix net protocol mainly has the following properties: (1) The output of Mix net is(t,N-2) AA-resilience that means the Mix net can also output right the decipher text and can not find the relationship between the input and output although there are N-2 malicious users among N senders and t-1 dishonest servers in t servers which may cooperate; (2) Because of the ElGamal public key system the input length of Mix net does not change with the number of Mix net servers; (3) The communication and computing cost is less than that of other verifiable Mix nets that we know presently due to the technique of dividing Mix net servers into two groups .
作者 高虎明 陈晓峰 王育民
机构地区 西安电子科技大学ISN国家重点实验室
出处 《计算机学报》 EI CSCD 北大核心 2003年第10期1361-1365,共5页 Chinese Journal of Computers
基金 国家自然科学基金 ( 60 0 73 0 5 2 )资助
关键词 密码 匿名通信 (t N-2)弹性 MixNet 可验证性 秘密性 正确性 Mix net confidentiality correctness verifiability
分类号 TN918.2 [电子电信—通信与信息系统]
  • 引文网络
  • 相关文献

参考文献12

  • 1Chaum D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 1981, 24(2) ,84～88.
  • 2Reiter M K, Rubin A D. Crowdst Anonymity for Web Transaction. ACM Transactions on Information and System Security, 1998,1(1):66～92.
  • 3Syverson P F, Goldschlag D M, Reed M G. Anonymous connections and onion routing. IEEE Journal of Selected Areas in Commun. , 1998,16(4) : 482～494.
  • 4Pfitzmann A, Pfitzmann B. How to break the direct RSA-implementation of mixes. In:Advances in Cryptology—EUROCRYPT'89. Berlin: Springer-Verlag, 1989. 373～381.
  • 5Pfitzmann A, Pfitzmann B, Waidner M. ISDN-mixes: Untraceable communication with very small bandwidth overhead.In: Proceedings of the GI/ITG Conference on Communication in Distributed Systems,Mannheim, Germany, 1991. 451～463.
  • 6Ogata W, Kurosawa K, Sako K, Takatani K. Fault tolerant anonymous channel. In: Proceedings of ICICS'97, LNCS 1334,Berlin: Springer-Verlag, 1997, 440～ 444.
  • 7Abe M. Universally verifiable mix-net with verifieation work independent of the number of mix-eenters. In: Proceedings of EUROCRYPT' 98, LNCS 1403, Berlin: Springer-Verlag,1998, 437～447.
  • 8Abe M. A mix-network on permutation networks. In: Proceedings of ASIACRYPT' 99, LNCS 1716, Berlin: Springer-Verlag, 1999, 258～273.
  • 9Jakobsson M. A practical mix. In.. Proceedings of EUROCRYPT'98, LNCS 1403, Berlin: Springer-Verlag, 1998, 448～461.
  • 10Jakobsson M. Flash mixing. In: Proceedings of PODC' 99,ACM, 1999. 83～89.

同被引文献31

  • 1王继林,伍前红,陈德人,王育民.匿名技术的研究进展[J].通信学报,2005,26(2):112-118. 被引量：16
  • 2[1]Markus Jakobsson,Ari Juels,Ronald L Rivest.Making mix nets robust for electronic voting by randomized partial checking.In:Proc of the 11th USENIX Security Symposium.Berkeley,CA,USA:USENIX Association,2002.339-353
  • 3[2]Ronald Cramer,Rosario Gennaro,Berry Schoenmakers.A secure and optimally efficient multi-authority election scheme.European Trans on Telecommunications,1997,8(5):481-490
  • 4[3]Atsushi Fujioka,Tatsuaki Okamoto,Kazuo Ohta.A practical secret voting scheme for large scale elections.In:Proc of the Workshop on the Theory and Application of Cryptographic Techniques:Advances in Cryptology.Berlin:Springer-Verlag,1992.244-251
  • 5[4]David Chaum.Secret-ballot receipts:True voter-verifiable elections.IEEE Security & Privacy,2004,2(1):38-47
  • 6[5]David Chaum,T P Pedersen.Wallet databases with observers.In:Advances in Cryptology-Crypto'92.Berlin:Springer-Verlag,1992.89-105
  • 7[6]M Bellare,J Garay,T Rabin.Batch verification with applications to cryptography and checking.LATIN'98.Campinas,Brazil,1998
  • 8[11]Ronald Cramer,Ivan Damgard,Berry schoenmakers.Proofs of partial knowledge and simplified design of witness hiding protocols.In:Yvo Desmedt ed.Proc of CRYPTO'94,LNCS 839.Berlin:Springer-Verlag,1994.174-187
  • 9[12]M Jakobsson,A Juels.Millimix-mixing in small batches.DIMACS,The State University of New Jersey,Tech Rep:99-33,1999
  • 10[13]C A Neff.A verifiable secret shuffle and its application to e-voting.In:Proc of the 8th ACM Conf on Computer and Communications Security.New York:ACM Press,2001.116-125

引证文献3

计算机学报
2003年 第10期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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