Quantum Security of Zero Knowledge Protocols
A Zero-Knowledge Proof basically is a protocol between two parties, the Prover and the Verifier, that allows the Prover to convince the Verifier about the truthness of a non trivial statement without revealing any additional information. Zero Knowledge Proofs have found a lot of practical applicatio...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis de maestría |
| Fecha de publicación: | 2024 |
| País: | España |
| Institución: | Universitat Politècnica de Catalunya (UPC) |
| Repositorio: | UPCommons. Portal del coneixement obert de la UPC |
| Idioma: | inglés |
| OAI Identifier: | oai:upcommons.upc.edu:2117/424269 |
| Acceso en línea: | https://hdl.handle.net/2117/424269 |
| Access Level: | acceso abierto |
| Palabra clave: | Cryptography Computer security Quantum Computing Quantum Security Zero-Knowledge Protocols Post-Quantum Cryptography Quantum Zero-Knowledge Proofs Cryptographic Protocols Quantum Rewinding Quantum Bit Error Rate (QBER) Quantum Information Quantum Adversaries Graph Isomorphism Quantum Cryptography Quantum Key Distribution (QKD) Lattice-based zkSNARKs Quantum Simulator Criptografia Seguretat informàtica Computació quàntica Àrees temàtiques de la UPC::Informàtica::Seguretat informàtica |
| Sumario: | A Zero-Knowledge Proof basically is a protocol between two parties, the Prover and the Verifier, that allows the Prover to convince the Verifier about the truthness of a non trivial statement without revealing any additional information. Zero Knowledge Proofs have found a lot of practical applications covering most of the protocols concerning about data privacy and protocol verification. Examples of that are anonymous cash or electronic voting. The possibility to have real quantum computers with a reasonable size in a near future is forcing the cryptographic community to devise new methods to provide security that resist quantum attacks. Most of the zero-knowledge protocols used nowadays are based on computational problems like the discrete logarithm problem that can no longer be considered hard, since there are known efficient ways to solve them with quantum algorithms. Cryptographic research about the quantum security of zero knowledge proofs started nearly 20 years ago in a very theoretical approach, but not many papers on that topic appeared since then. The goal of this thesis is writing a survey including the main concepts about quantum secure zero-knowledge protocols, the state-of-the-art both from the theoretical and practical approaches, and an exploration of their potential application areas. The survey will be a good starting document for further students willing to do research in this topic. |
|---|