Experimental relativistic zero-knowledge proofs

by   Pouriya Alikhani, et al.

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 all. In this work, we report the experimental realisation of such a zero-knowledge protocol involving two separated verifier-prover pairs. Security is enforced via the physical principle of special relativity, 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-based applications such as cryptocurrencies or smart contracts.



There are no comments yet.


page 2


Raziel: Private and Verifiable Smart Contracts on Blockchains

Raziel combines secure multi-party computation and proof-carrying code t...

Practical Relativistic Zero-Knowledge for NP

In this work we consider the following problem: in a Multi-Prover enviro...

Demystifying the Role of zk-SNARKs in Zcash

Zero-knowledge proofs have always provided a clear solution when it come...

ZKPs: Does This Make The Cut? Recent Advances and Success of Zero-Knowledge Security Protocols

How someone can get health insurance without sharing his health informat...

Physical Zero-knowledge Proofs for Flow Free, Hamiltonian Cycles, and Many-to-many k-disjoint Covering Paths

In this paper we describe protocols which use a standard deck of cards t...

A Survey on Zero Knowledge Range Proofs and Applications

In last years, there has been an increasing effort to leverage Distribut...

An Improved Physical ZKP for Nonogram

Nonogram is a logic puzzle consisting of a rectangular grid with an obje...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.