Quantum-Safe Identity Verification using Relativistic Zero-Knowledge Proof Systems
Yao Ma, Wen Yu Kon, Jefferson Chu, Kevin Han Yong Loh, Kaushik Chakraborty, Charles Lim

TL;DR
This paper advances quantum-safe identity verification by improving relativistic zero-knowledge proof protocols, making them more practical and secure against malicious entangled provers, with enhanced scalability and relaxed constraints.
Contribution
It introduces a more scalable and stable implementation of relativistic zero-knowledge proofs and extends the protocol to a three-prover setup for increased security.
Findings
Relaxed relativistic constraints from 60m to 30m.
Enhanced stability and scalability of the proof protocol.
Extended security to three-prover configurations.
Abstract
Identity verification is the process of confirming an individual's claimed identity, which is essential in sectors like finance, healthcare, and online services to ensure security and prevent fraud. However, current password/PIN-based identity solutions are susceptible to phishing or skimming attacks, where malicious intermediaries attempt to steal credentials using fake identification portals. Alikhani et al. [Nature, 2021] began exploring identity verification through graph coloring-based relativistic zero-knowledge proofs (RZKPs), a key cryptographic primitive that enables a prover to demonstrate knowledge of secret credentials to a verifier without disclosing any information about the secret. Our work advances this field and addresses unresolved issues: From an engineering perspective, we relax further the relativistic constraints from 60m to 30m, and significantly enhance the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
