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 条
  • [21] Zero-knowledge sets with short proofs
    Catalano, Dario
    Fiore, Dario
    Messina, Mariagrazia
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2008, 2008, 4965 : 433 - +
  • [22] Symbolic Malleable Zero-knowledge Proofs
    Backes, Michael
    Bendun, Fabian
    Maffei, Matteo
    Mohammadi, Esfandiar
    Pecina, Kim
    2015 IEEE 28TH COMPUTER SECURITY FOUNDATIONS SYMPOSIUM CSF 2015, 2015, : 412 - 426
  • [23] MINIMUM RESOURCE ZERO-KNOWLEDGE PROOFS
    KILIAN, J
    MICALI, S
    OSTROVSKY, R
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 435 : 545 - 557
  • [24] ZERO-KNOWLEDGE PROOFS OF COMPUTATIONAL POWER
    YUNG, M
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 434 : 196 - 207
  • [25] Experimenting with Zero-Knowledge Proofs of Training
    Garg, Sanjam
    Goel, Aarushi
    Jha, Somesh
    Mahloujifar, Saeed
    Mahmoody, Mohammad
    Policharla, Guru-Vamsi
    Wang, Mingyuan
    PROCEEDINGS OF THE 2023 ACM SIGSAC CONFERENCE ON COMPUTER AND COMMUNICATIONS SECURITY, CCS 2023, 2023, : 1880 - 1894
  • [26] Doubly adaptive zero-knowledge proofs
    Botta, Vincenzo
    Visconti, Ivan
    THEORETICAL COMPUTER SCIENCE, 2023, 968
  • [27] Zero-Knowledge Sets With Short Proofs
    Catalano, Dario
    Di Raimondo, Mario
    Fiore, Dario
    Messina, Mariagrazia
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2011, 57 (04) : 2488 - 2502
  • [28] Zero-Knowledge Proofs with Witness Elimination
    Kiayias, Aggelos
    Zhou, Hong-Sheng
    PUBLIC KEY CRYPTOGRAPHY-PKC 2009, PROCEEDINGS, 2009, 5443 : 124 - 138
  • [29] Complex zero-knowledge proofs of knowledge are easy to use
    Canard, Sebastien
    Coisel, Iwen
    Traore, Jacques
    PROVABLE SECURITY, PROCEEDINGS, 2007, 4784 : 122 - +
  • [30] Composition of Zero-Knowledge Proofs with Efficient Provers
    Birrelll, Eleanor
    Vadhan, Salil
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2010, 5978 : 572 - +