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 条
  • [41] ZPiE: Zero-Knowledge Proofs in Embedded Systems
    Salleras, Xavier
    Daza, Vanesa
    MATHEMATICS, 2021, 9 (20)
  • [42] General properties of quantum zero-knowledge proofs
    Kobayashi, Hirotada
    THEORY OF CRYPTOGRAPHY, 2008, 4948 : 107 - 124
  • [43] Distributed Zero-Knowledge Proofs Over Networks
    Bick, Aviv
    Kol, Gillat
    Oshman, Rotem
    PROCEEDINGS OF THE 2022 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2022, : 2426 - 2458
  • [44] Physical Zero-Knowledge Proofs for Five Cells
    Ruangwises, Suthee
    PROGRESS IN CRYPTOLOGY, LATINCRYPT 2023, 2023, 14168 : 315 - 330
  • [45] An Introduction to Zero-Knowledge Proofs in Blockchains and Economics
    Berentsen, Aleksander
    Lenzi, Jeremias
    Nyffenegger, Remo
    FEDERAL RESERVE BANK OF ST LOUIS REVIEW, 2023, 105 (04): : 280 - 294
  • [46] Zero-Knowledge Proofs via Polynomial Representations
    Di Crescenzo, Giovanni
    Fedyukovych, Vadym
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2012, 2012, 7464 : 335 - 347
  • [47] Practical Zero-Knowledge Proofs for Circuit Evaluation
    Ghadafi, Essam
    Smart, Nigel P.
    Warinschi, Bogdan
    CRYPTOGRAPHY AND CODING, PROCEEDINGS, 2009, 5921 : 469 - 494
  • [48] Round-optimal zero-knowledge proofs of knowledge for NP
    Li HongDa
    Feng DengGuo
    Li Bao
    Xue HaiXia
    SCIENCE CHINA-INFORMATION SCIENCES, 2012, 55 (11) : 2473 - 2484
  • [49] Round-optimal zero-knowledge proofs of knowledge for NP
    HongDa Li
    DengGuo Feng
    Bao Li
    HaiXia Xue
    Science China Information Sciences, 2012, 55 : 2473 - 2484
  • [50] Round-optimal zero-knowledge proofs of knowledge for NP
    LI HongDa1
    2State Key Lab of Information Security
    ScienceChina(InformationSciences), 2012, 55 (11) : 2473 - 2484