Secure Bit Commitment Function against Divertibility
Secure Bit Commitment Function against Divertibility
复制标题
针对可转移性的安全比特承诺功能
DOI：
10.1007/3-540-47555-9_27
复制
发表时间：
1992
期刊：
影响因子：
--
通讯作者：
A. Fujioka
中科院分区：
文献类型：
--
作者：
K. Ohta;T. Okamoto;A. Fujioka
一些零知识交互式证明（ZKIP）具有可转移性，即由真实证明者A发布的证明证据可以转移到多个验证者B和C，中间验证者B在A的帮助下充当阿萨，混淆另一个验证者C，而不揭示A-B交互和B-C交互之间的关系。本文提出了抗可转移性安全的概念，并在合理的假设下证明了基于伪随机生成元的Naor比特承诺函数是抗可转移性安全的。在ZKIP中使用该比特承诺可以将可撤销的ZKIP转换为可撤销的自由ZKIP，该自由ZKIP可以抵抗黑手党欺诈攻击和多验证者攻击。
Some zero-knowledge interactive proofs (ZKIPs) have divertibility, that is, evidence of proof issued by a genuine prover,A, can be transferred to plural verifiers,Band thenC, where the intermediate verifier,B, acts asA, withA’s help, to confound the other verifierCwithout revealing the relation between theA-Binteraction and theB-Cinteraction. This property is a serious problem in practice, e.g. the mafia fraud attack on identification scheme and the multi-verifier attack against undeniable signatures.This paper proposes a new concept,security against divertibility, and proves that Naor’s bit commitment function based on pseudo-random generators is secure against divertibility under the reasonable assumption. Usage of this bit commitment inZKIPcan convert adivertible ZKIPto adivertible-free-ZKIPwhich is secure against the mafia fraud attack and the multi-verifier attack.