Κεφάλαιο 10Adobe PDF (297.25 kB)
Title Details:
Zero-Knowledge Proofs
Authors: Pagourtzis, Aristeidis
Zachos, Efstathios
Grontas, Panagiotis
Reviewer: Poulakis, Dimitrios
Subject: MATHEMATICS AND COMPUTER SCIENCE > > >
MATHEMATICS AND COMPUTER SCIENCE >
NATURAL SCIENCES AND AGRICULTURAL SCIENCES > PHYSICS > INDERDISCIPLINARY PHYSICS AND RELATED AREAS OF SCIENCE AND TECHNOLOGY > >
ENGINEERING AND TECHNOLOGY > > >
MATHEMATICS AND COMPUTER SCIENCE > >
MATHEMATICS AND COMPUTER SCIENCE > >
MATHEMATICS AND COMPUTER SCIENCE > MATHEMATICS > NUMBER THEORY > COMPUTATIONAL NUMBER THEORY
Description:
Abstract:
Interactive proof systems. Properties: completeness, soundness, zero knowledge. Relation to NP-completeness. Variations of properties: special soundness, Honest Verifier Zero Knowledge. Examples: Schnorr protocol, Chaum-Pedersen protocol. Applications: authentication/identification protocols, malleable cryptography. S-protocols, composition of S-protocols (AND, OR). Witness hiding, witness indistinguishable proofs. Transformation to non-interactive proofs.
Type: Chapter
Creation Date: 2015
Item Details:
License: Attribution - NonCommercial - ShareAlike 4.0 International (CC BY-NC-SA 4.0)
Handle http://hdl.handle.net/11419/5449
Bibliographic Reference: Pagourtzis, A., Zachos, E., & Grontas, P. (2015). Zero-Knowledge Proofs [Chapter]. In Pagourtzis, A., Zachos, E., & Grontas, P. 2015. Computational Cryptography [Undergraduate textbook]. Kallipos, Open Academic Editions. https://hdl.handle.net/11419/5449
Language: Greek
Is Part of: Computational Cryptography
Publication Origin: Kallipos, Open Academic Editions