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 条
  • [31] Stacked Garbling for Disjunctive Zero-Knowledge Proofs
    Heath, David
    Kolesnikov, Vladimir
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2020, PT III, 2020, 12107 : 569 - 598
  • [32] Computational soundness of symbolic zero-knowledge proofs
    Backes, Michael
    Unruh, Dominique
    JOURNAL OF COMPUTER SECURITY, 2010, 18 (06) : 1077 - 1155
  • [33] Physical Zero-Knowledge Proofs of Physical Properties
    Fisch, Ben
    Freund, Daniel
    Naor, Moni
    ADVANCES IN CRYPTOLOGY - CRYPTO 2014, PT II, 2014, 8617 : 313 - 336
  • [34] Zero-Knowledge Proofs for Classical Planning Problems
    Correa, Augusto B.
    Buchner, Clemens
    Christen, Remo
    THIRTY-SEVENTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, VOL 37 NO 10, 2023, : 11955 - 11962
  • [35] PUBLICLY VERIFIABLE NONINTERACTIVE ZERO-KNOWLEDGE PROOFS
    LAPIDOT, D
    SHAMIR, A
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 353 - 365
  • [36] On the Existence of Three Round Zero-Knowledge Proofs
    Fleischhacker, Nils
    Goyal, Vipul
    Jain, Abhishek
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT III, 2018, 10822 : 3 - 33
  • [38] On relationships between statistical zero-knowledge proofs
    Okamoto, T
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 60 (01) : 47 - 108
  • [39] HOW TO UTILIZE THE RANDOMNESS OF ZERO-KNOWLEDGE PROOFS
    OKAMOTO, T
    OHTA, K
    LECTURE NOTES IN COMPUTER SCIENCE, 1991, 537 : 456 - 475
  • [40] Probabilistically Checkable Proofs of Proximity with Zero-Knowledge
    Ishai, Yuval
    Weiss, Mor
    THEORY OF CRYPTOGRAPHY (TCC 2014), 2014, 8349 : 121 - 145