Experimental relativistic zero-knowledge proofs

被引:0
|
作者
Pouriya Alikhani
Nicolas Brunner
Claude Crépeau
Sébastien Designolle
Raphaël Houlmann
Weixu Shi
Nan Yang
Hugo Zbinden
机构
[1] McGill University,School of Computer Science
[2] University of Geneva,Department of Applied Physics
[3] National University of Defense Technology,Department of Electronic Science
[4] Concordia University,Department of Computer Science and Software Engineering
来源
Nature | 2021年 / 599卷
关键词
D O I
暂无
中图分类号
学科分类号
摘要
Protecting secrets is a key challenge in our contemporary information-based era. In common situations, however, revealing secrets appears unavoidable; for instance, when identifying oneself in a bank to retrieve money. In turn, this may have highly undesirable consequences in the unlikely, yet not unrealistic, case where the bank’s security gets compromised. This naturally raises the question of whether disclosing secrets is fundamentally necessary for identifying oneself, or more generally for proving a statement to be correct. Developments in computer science provide an elegant solution via the concept of zero-knowledge proofs: a prover can convince a verifier of the validity of a certain statement without facilitating the elaboration of a proof at all1. In this work, we report the experimental realization of such a zero-knowledge protocol involving two separated verifier–prover pairs2. Security is enforced via the physical principle of special relativity3, and no computational assumption (such as the existence of one-way functions) is required. Our implementation exclusively relies on off-the-shelf equipment and works at both short (60 m) and long distances (≥400 m) in about one second. This demonstrates the practical potential of multi-prover zero-knowledge protocols, promising for identification tasks and blockchain applications such as cryptocurrencies or smart contracts4.
引用
收藏
页码:47 / 50
页数:3
相关论文
共 50 条
  • [1] Experimental relativistic zero-knowledge proofs
    Alikhani, Pouriya
    Brunner, Nicolas
    Crepeau, Claude
    Designolle, Sebastien
    Houlmann, Raphael
    Shi, Weixu
    Yang, Nan
    Zbinden, Hugo
    [J]. NATURE, 2021, 599 (7883) : 47 - +
  • [2] ZERO-KNOWLEDGE PROOFS
    MCGEOCH, CC
    [J]. AMERICAN MATHEMATICAL MONTHLY, 1993, 100 (07): : 682 - 685
  • [3] ZERO-KNOWLEDGE PROOFS
    WAYNER, P
    [J]. BYTE, 1987, 12 (11): : 149 - 152
  • [4] ON THE KNOWLEDGE TIGHTNESS OF ZERO-KNOWLEDGE PROOFS
    ITOH, T
    KAWAKUBO, A
    [J]. IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 1994, E77A (01) : 47 - 55
  • [5] Zero-knowledge proofs of retrievability
    Yan Zhu
    HuaiXi Wang
    ZeXing Hu
    Gail-Joon Ahn
    HongXin Hu
    [J]. Science China Information Sciences, 2011, 54 : 1608 - 1617
  • [6] Zero-knowledge proofs of retrievability
    Zhu Yan
    Wang HuaiXi
    Hu ZeXing
    Ahn, Gail-Joon
    Hu HongXin
    [J]. SCIENCE CHINA-INFORMATION SCIENCES, 2011, 54 (08) : 1608 - 1617
  • [7] Unifying Zero-Knowledge Proofs of Knowledge
    Maurer, Ueli
    [J]. PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2009, 2009, 5580 : 272 - 286
  • [8] A Survey on Zero-Knowledge Proofs
    Feng, Li
    McMillin, Bruce
    [J]. ADVANCES IN COMPUTERS, VOL 94, 2014, 94 : 25 - 69
  • [9] Efficient Zero-Knowledge Proofs
    Groth, Jens
    [J]. PROGRESS IN CRYPTOLOGY - AFRICACRYPT 2011, 2011, 6737 : 379 - 379
  • [10] Zero-knowledge proofs of retrievability
    AHN Gail-Joon
    [J]. Science China(Information Sciences), 2011, 54 (08) : 1608 - 1617