高效的基于混合加密的乐观Mix-net协议

李龙海; 黄诚强; 许尚妹; 付少锋

doi:10.3969/j.issn.1000-436x.2014.z2.021

您当前的位置：

首页 >

文章列表页 >

高效的基于混合加密的乐观Mix-net协议

学术论文 | 更新时间：2024-06-05

- 高效的基于混合加密的乐观Mix-net协议
- Efficient hybrid-encryption-based optimistic Mix-net protocol
- 通信学报 2014年35卷第Z2期页码：154-164
- 作者机构：
  
  西安电子科技大学计算机学院，陕西西安 710071
- 作者简介：
  
  [ "李龙海（1976-），男，河北冀州人，博士，西安电子科技大学副教授、硕士生导师，主要研究方向为匿名通信、隐私保护技术和计算机网络安全。" ]
  [ "黄诚强（1989-），男，福建福州人，西安电子科技大学硕士生，主要研究方向为计算机与网络安全。" ]
  [ "许尚妹（1990-），女，浙江杭州人，西安电子科技大学硕士生，主要研究方向为计算机与网络安全。" ]
  [ "付少锋（1975-），男，陕西户县人，西安电子科技大学副教授，主要研究方向为计算机网络安全和嵌入式系统。" ]
- 基金信息：
  
  国家自然科学基金资助项目(61101142)
- DOI：10.3969/j.issn.1000-436x.2014.z2.021
  中图分类号： TP393.08
- 网络出版日期：2014-11，
  
  纸质出版日期：2014-11-30
- 稿件说明：
移动端阅览
李龙海, 黄诚强, 许尚妹, 等. 高效的基于混合加密的乐观Mix-net协议[J]. 通信学报, 2014,35(Z2):154-164.

Long-hai LI, Cheng-qiang HUANG, Shang-mei XU, et al. Efficient hybrid-encryption-based optimistic Mix-net protocol[J]. Journal on communications, 2014, 35(Z2): 154-164.
李龙海, 黄诚强, 许尚妹, 等. 高效的基于混合加密的乐观Mix-net协议[J]. 通信学报, 2014,35(Z2):154-164. DOI： 10.3969/j.issn.1000-436x.2014.z2.021.

Long-hai LI, Cheng-qiang HUANG, Shang-mei XU, et al. Efficient hybrid-encryption-based optimistic Mix-net protocol[J]. Journal on communications, 2014, 35(Z2): 154-164. DOI： 10.3969/j.issn.1000-436x.2014.z2.021.

摘要

提出了一种高效的基于混合加密算法的Mix-net协议。正常情况下，当所有Mix服务器都忠实地执行协议时，其运算速度优于其他所有已知的具有公开可验证性的Mix-net。采用一种“乐观的”、基于散列运算的方法验证混洗过程的正确性，避免了构造复杂的、耗时的零知识证明，因此获得了速度上的提升。只用两轮逐元素的测试过程确保消息未被恶意服务器篡改，并且测试中仅涉及低代价的散列运算。公钥加密和对称密钥加密的有效结合也加速了混洗。这些优化措施使单个Mix服务器的运算量几乎和服务器数目无关，除了少量可忽略的计算任务。此外，任何人都可以通过少量的指数运算快速验证输出结果的正确性。方案也满足健壮性。这些特点使该方案非常适合用在大规模的电子选举中。

Abstract

An efficient hybrid-encryption-based Mix-net is presented that is much faster than all previous Mix-nets with public verifiability when all mix-servers execute the mixing protocol honestly (the usual case).The improvement by taking an “optimistic” and hash-based approach to verify the correctness of mixing is achieved without requiring complex and costly zero-knowledge proofs.Only two element-wise testing processes with low-cost computations of hash functions are involved to make certain messages are not manipulated by a cheating server.An efficient integration of public-key and symmetric-key operations also speeds up the mixing.As a result

the computational task of each mix-server is almost independent of the number of mix-servers except for some negligible tasks.Anyone can verify the correctness of a result rapidly by computing a few exponentiations.The scheme is robust

too.Those characteristics make it very suitable for large scale electronic voting.

关键词

Keywords

references

CHAUM D . Untraceable electronic mail,return addresses,and digital pseudonyms [J ] . Communications of the ACM , 1981 , 24 ( 2 ): 84 - 88 .

DINGLEDINE R , MATHEWSON N , SYVERSON P . Tor:the second-generation onion router [A ] . Proceedings of the 13th USENIX Security Symposium [C ] . San Antonio , 2004 . 03 - 320 .

FUJIOKA A , OKAMOTO T , OHTA K . A practical secret voting scheme for large scale elections [A ] . Cryptology-Asiacrypt’92 [C ] . Queensland,Australia , 1992 . 244 - 251 .

NEFF A . A verifiable secret shuffle and its application to e-voting [A ] . Proceedings of ACM CCS ’01 [C ] . New York,USA , 2001 . 116 - 125 .

GABBER E , BIBBONS P , MATIAS Y . How to make personalized Web browsing simple,secure,and anonymous [A ] . Financial Cryptography ’97 [C ] . Anguilla , 1997 . 17 - 31 .

JAKOBSSON M , RAIHI D . Mix-based electronic payments [A ] . Proceedings of SAC ’98 [C ] . Kingston,Canada , 1998 . 157 - 173 .

SEBE F , MIRET J , PUJOLIS J , et al . Simple and efficient hash-based verifiable mixing for remote electronic voting [J ] . Computer Communications , 2010 , 33 ( 6 ): 667 - 675 .

WIKSTROM D . A sender verifiable Mix-net and a new proof of a shuffle [A ] . Advances in Cryptology-Asiacrypt ’05 [C ] . Chennai (Madras),India , 2005 . 273 - 292 .

GOLLE P , ZHONG S , BONEH D , et al . Optimistic mixing for exit-polls [A ] . Advances in Cryptology-Asiacrypt ’02 [C ] . Queenstown,New Zealand , 2002 . 451 - 465 .

ABE M . Flaws in some robust optimistic Mix-nets [A ] . Proceedings of Information Security and Privacy,8th Australasian Conference [C ] . Wollongong,Australia , 2003 . 39 - 50 .

WIKSTROM D . Five practical attacks for “optimistic mixing for exit-polls” [A ] . Proceedings of Selected Areas of Cryptography (SAC) [C ] . Ottawa,Canada , 2003 . 160 - 174 .

LONGHAI L , SHAOFENG F , XIANGQUAN C . A new relation attack on the optimistic Mix-net [A ] . International Symposium on Computer Network and Multimedia Technology(CNMT 2009) [C ] . Wuhan , 2009 . 1 - 4 .

FURUKAWA J . Efficient,verifiable shuffle decryption and its requirements of unlinkability [A ] . Proceedings of PKC 2004 [C ] . Singapore , 2004 . 319 - 332 .

CRAMER R , DAMGAARD I , SCHOENMAKERS B . Proofs of partial knowledge and simplified design of witness hiding protocols [A ] . Cryptology–Crypto’94 [C ] . California,USA , 1994 . 174 - 187 .

FIAT A , SHAMIR A . How to prove yourself:practical solutions to identification and signature problems [A ] . Cryptology-Crypto’86 [C ] . California,USA , 1987 . 186 - 194 .

PEDERSEN P . Non-interactive and information theoretic secure verifiable secret sharing [A ] . Advances in Cryptology:Crypto'91 [C ] . California,USA , 1991 . 129 - 140 .

FURUKAWA J , SAKO K . An efficient scheme for proving a shuffle [A ] . Proceedings of Crypto’ 2001 [C ] . California,USA , 2001 . 368 - 387 .

NEFF A . A verifiable secret shuffle and its application to e-voting [A ] . Proceedings of ACM CCS ’01 [C ] . New York,USA , 2001 . 116 - 125 .

GROTH J . A verifiable secret shuffle of homomorphic encryptions [J ] . Journal of Cryptology , 2010 , 23 ( 4 ): 546 - 579 .

FURUKAWA J , MIYAUCHI H , MORI K . An implementation of a universally verifiable electronic voting scheme based on shuffling [A ] . Proceedings of Financial Cryptography'02 [C ] . Southampton,Bermuda , 2002 . 16 - 30 .

OHKUBO M , ABE M . A length-invariant hybrid mix [A ] . Cryptology-Asiacrypt’00 [C ] . Kyoto,Japan , 2000 . 178 - 191 .

OGATA W , KUROSAWA K , SAKO K , et al . Fault tolerant anonymous channel [A ] . Proceedings of.ICICS '97 [C ] . South Africa , 1997 . 440 - 444 .

ABE M . Mix-networks on permutation networks [A ] . CryptologyAsiacrypt’99 [C ] . Singapore , 1999 . 258 - 273 .

浏览量

下载量

CSCD

文章被引用时，请邮件提醒。

提交

工具集

关联资源

基于SDN节点淆乱机制的接收方不可追踪的混合匿名通道

选择密文安全的可验证Mix-Net协议

Tor匿名通信网络节点家族的测量与分析

主动网络流水印技术研究进展

基于双线性对的乐观Mix-net协议