通信学报

• 学术论文 • 上一篇    下一篇

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

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

  1. 西安电子科技大学 计算机学院,陕西 西安 710071
  • 出版日期:2014-11-25 发布日期:2014-12-17
  • 基金资助:
    国家自然科学基金资助项目(61101142);中央高校基本科研基金资助项目(K50510030012)

Efficient hybrid-encryption-based optimistic Mix-net protocol

  • Online:2014-11-25 Published:2014-12-17

摘要: 提出了一种高效的基于混合加密算法的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 inde-pendent 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.

No Suggested Reading articles found!