Nulta-znanja dokaz
Dokaz nultog znanja je kriptografski protokol u kojem dokazivač (prover) može uveriti proveravaoca (verifier) da je neka tvrdnja istinita, a da pri tom ne otkriva nikakve dodatne informacije osim same istinitosti tvrdnje. Uvedeni od strane Goldwasser, Micali i Rackoff 1985. godine, dokazi nultog znanja imaju duboke primene u autentifikaciji, verifikaciji koja čuva privatnost i blokčejn sistemima.
Pročitajte celu metodu
Prijavite se besplatnim nalogom da biste pročitali ovaj odeljak.
Method map
The neighbourhood of related methods — select a node to explore.
Izvori
- Goldwasser, S., Micali, S., & Rackoff, C. (1985). The knowledge complexity of interactive proof systems. SIAM Journal on Computing, 18(1), 186–208. DOI: 10.1137/0218012 ↗
- Ben-Or, M., Goldwasser, S., Kilian, J., & Wigderson, A. (1988). Multi-prover interactive proofs: How to remove intractability assumptions. Proceedings of the 20th ACM STOC, 113–131. DOI: 10.1145/62212.62223 ↗
- Groth, J. (2016). On the size of pairing-based non-interactive arguments. Advances in Cryptology – EUROCRYPT 2016, 305–326. DOI: 10.1007/978-3-662-49896-5_11 ↗
Kako citirati ovu stranicu
ScholarGate. (2026, June 3). Zero-Knowledge Proof Protocol and Interactive Verification. ScholarGate. https://scholargate.app/sr/cryptography/zero-knowledge-proof
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Šema digitalnog potpisaKriptografija↔ compare
- Analiza RSA kriptosistemaKriptografija↔ compare
- Analiza TLS protokolaKriptografija↔ compare
Uočili ste grešku na ovoj stranici? Prijavite je ili predložite ispravku →