• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Symposium on Information Theory and its Applications >A New Three-Pass Code-based Zero-Knowledge Identification Scheme with Cheating Probability of Exactly Half
【24h】

A New Three-Pass Code-based Zero-Knowledge Identification Scheme with Cheating Probability of Exactly Half

机译：一种新的基于三阶段密码的零知识识别方案，其作弊概率为一半

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

In 1996, Stern proposed a three-pass zero-knowledge identification (ID) scheme where the cheating probability, i.e., the success probability of cheating prover, is 2/3. Since then, variants and generalization of Stern's ID have been proposed. However, within two-bit challenge space, all of them are having the cheating probability of more than half or reaching half only in an asymptotic manner with more than three passes in one round. In this paper, we propose the first code-based zero-knowledge three-pass ID scheme with the cheating probability of exactly half even with only two-bit challenge space. Our proposed ID scheme can reduce the necessary number of rounds in order to achieve the targeted security against impersonation. Since rewinding technique cannot be used against a quantum adversary in the security proof, we prove the security using the lossy paradigm and rely on the decisional version of syndrome decoding problem so that we do not have to rewind the adversary.
机译：Stern在1996年提出了一种三通零知识识别（ID）方案，其作弊概率（即作弊证明者成功的概率）为2/3。从那时起，已经提出了Stern ID的变体和一般化。但是，在两位数的挑战空间中，所有这些人的作弊几率都超过了一半，或者仅以渐近的方式在一个回合中经过了三遍以上就达到了一半。在本文中，我们提出了第一个基于代码的零知识三遍ID方案，即使只有2位质询空间，其作弊概率也仅为一半。我们提出的ID方案可以减少必要的回合次数，以实现针对假冒的目标安全性。由于在安全性证明中不能使用倒带技术来对抗量子对手，因此我们使用有损范式来证明安全性，并依靠校正子解码问题的决策版本，因此我们不必倒带对手。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号