Quantum Bit-commitment for small storage based on quantum one-way permutations

被引：0

作者：

Keisuke Tanaka

机构：

[1] Tokyo Institute of Technology,Department of Mathematical and Computing Sciences

来源：

New Generation Computing | 2003年 / 21卷

关键词：

Bit-Commitment; Error Correcting Code; One-Way Permutation; Quantum Computation; Quantum Protocol;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

We propose a quantum bit-commitment scheme based on quantum one-way permutations with the unconditionally binding and computationally concealing property. Our scheme reduces exponentially the number of bits which the receiver needs to store until, the opening phase compared with the classical counterpart.

引用

页码：339 / 345

页数：6

共 6 条

[1]

Justesen J.(1972)A Class of Constructive Asymptotically Good Algebraic Codes IEEE Transactions on Information Theory 18 652-656

[2]

Mayers D.(1997)Unconditionally Secure Quantum Bit Commitment is Impossible Physical Review Letters 78 3414-3417

[3]

Naor M.(1998)Perfect Zeroknowledge Arguments for NP Using Any One-way Permutation Journal of Cryptology 11 78-108

[4]

Ostrovsky R.(undefined)undefined undefined undefined undefined-undefined

[5]

Ventkatesan R.(undefined)undefined undefined undefined undefined-undefined

[6]

Young M.(undefined)undefined undefined undefined undefined-undefined

← 1 →