BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Experimental relativistic zero-knowledge proofs - Claude Crepeau (
 ÉTS / Inria)
DTSTART:20251024T113000Z
DTEND:20251024T123000Z
UID:TALK237994@talks.cam.ac.uk
CONTACT:Adrian Kent
DESCRIPTION:Protecting secrets is a key challenge in our contemporary\ninf
 ormation-based era. In common situations\, however\, revealing\nsecrets ap
 pears unavoidable\, for instance\, when identifying oneself in\na bank to 
 retrieve money. In turn\, this may have highly undesirable\nconsequences i
 n the unlikely\, yet not unrealistic\, case where the\nbank’s security g
 ets compromised. This naturally raises the question\nof whether disclosing
  secrets is fundamentally necessary for\nidentifying oneself\, or more gen
 erally for proving a statement to be\ncorrect. Developments in computer sc
 ience provide an elegant solution\nvia the concept of zero-knowledge proof
 s: a prover can convince a\nverifier of the validity of a certain statemen
 t without facilitating\nthe elaboration of a proof at all. In this work\, 
 we report the\nexperimental realisation of such a zero-knowledge protocol 
 involving\ntwo separated verifier-prover pairs. Security is enforced via t
 he\nphysical principle of special relativity\, and no computational\nassum
 ption (such as the existence of one-way functions) is required.\nOur imple
 mentation exclusively relies on off-the-shelf equipment and\nworks at both
  short (60m) and long distances (>400m) in about one\nsecond. This demonst
 rates the practical potential of multi-prover\nzero-knowledge protocols\, 
 promising for identification tasks.\n\nJoint work with Pouriya Alikhani\, 
 Nicolas Brunner\, Sébastien Designolle\,\nRaphaël Houlmann\, Weixu Shi\,
  Nan Yang\, and Hugo Zbinden\nin Nature\, https://www.nature.com/articles/
 s41586-021-03998-y
LOCATION:Centre for Mathematical Sciences\, Room TBD
END:VEVENT
END:VCALENDAR