A study on MIX-nets and its applications

MIX-net及其应用研究

• 批准号: 14580358
• 负责人: KUROSAWA Kaoru
• 金额: $ 2.18万
• 依托单位: Ibaraki University
• 依托单位国家: 日本
• 项目类别: Grant-in-Aid for Scientific Research (C)
• 财政年份: 2002
• 资助国家: 日本
• 起止时间: 2002 至 2003
• 项目状态: 已结题
• 来源: https://kaken.nii.ac.jp/en/grant/KAKENHI-PROJECT-14580358/
• 关键词: Shuffle; privacy; MIX-net; ElGamal encryption; Paillier encryption; Decisional DH assumption; Decisional Nth residue assumption; 匿名性; 安全性

This research preject proposes a formal model for security of verifiable shuffles and prove the security of some recently proposed shuffle schemes in this model. The model is general and can be extended to mix-nets and verifiable shuffle decryption. The research preject also proposes a new, verifiable shuffle system based on Paillier encryption scheme and prove its security in the proposed model. The new shuffle has the least number of rounds and exponentiations if a variant of Paillier scheme is used

本研究提出了一个可验证置乱安全的形式化模型，并证明了最近提出的一些置乱方案在该模型下的安全性。该模型具有通用性，可以推广到混合网络和可验证的置乱解密。研究课题还提出了一个新的基于Paillier加密方案的可验证的置乱系统，并在该模型中证明了其安全性。如果使用Paillier方案的变体，则新的Shuffle具有最少的轮数和指数

项目成果

Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa: "Verifiable shuffles A formal model and a Paillier-based efficient construction with provable Security"Proc. of Applied Cryptography and Network Network Security, LNCS series. (2004)

Lan Nguyen、Rei Safavi-Naini、Kaoru Kurosawa：“可验证的洗牌正式模型和基于 Paillier 的高效构造，具有可证明的安全性”Proc。

L.Nguen, R.S.Naini, K.Kurosawa: "Verifiable Shuffle : A formal model and a Paillier-based efficient const ruction with provable security"Proc.of Applied Cryptography and Network Security. LNCS(未定). (2004)

L.Nguen、R.S.Naini、K.Kurosawa：“可验证的洗牌：具有可证明安全性的形式化模型和基于 Paillier 的高效构造”Proc.of Applied Cryptography and Network Security（待定）。

Lan Nguyen, Rei Safavi-Naini, Kaoru Kurosawa: "Verifiable Shuffle : A formal model and a Paillier-based efficient construction with provable security"Proc.of Applied Cryptography and Network Security (ACNS'04). LNCS 未定. (2004)

Lan Nguyen、Rei Safavi-Naini、Kaoru Kurosawa：“可验证的洗牌：具有可证明安全性的形式化模型和基于 Paillier 的高效构造”Proc.of 应用密码学和网络安全 (ACNS04)。