通信学报

• 技术报告 • 上一篇    下一篇

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

李龙海,付少锋,苏锐丹   

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

Optimistic Mix-net protocol based on bilinear pairings

  • Online:2013-11-25 Published:2013-11-15

摘要: 提出了一种新的基于双线性对的乐观Mix-net协议。利用双线性对工具简化了密钥管理,在不同的协议会话中服务器端不用重新生成密钥,并且当前会话不会为其他会话提供解密预言机服务。采用了“哑元追踪法”保证混洗过程的完整性,简化了正确性证明的构造。对ElGamal联合解密过程做了优化,降低了每个服务器节的指数运算量。在没有服务器作弊的情况下,对输入密文组的混洗和解密速度比其他可公开验证的Mix-net方案高得多。

Abstract: A novel pairing-based optimistic Mix-net scheme was proposed. The key management is made easier by employing bilinear paring primitives and there is no need for the participating mix servers to re-generate keys jointly between mix-sessions to avoid providing decryption oracle service to other mix-sessions. Integrity of messages during mixing is partially guaranteed by using “dummy messages tracing” technology resulting in a simpler construction for proofs of correctness. An optimization method for the joint ElGamal decryption involved in the protocol was also proposed, which can reduce the number of exponentiations computed by each mix server. The Mix-net will shuffle and decrypt input ciphertexts much faster than all previous Mix-nets with public verifiability when all mix servers execute the mixing protocol honestly.

No Suggested Reading articles found!