Nul-viden-bevis
Et nul-viden-bevis er en kryptografisk protokol, hvor en bevisfører kan overbevise en verificerer om, at en påstand er sand, uden at afsløre yderligere information ud over påstandens sandhed. Indført af Goldwasser, Micali og Rackoff i 1985, har nul-viden-beviser dybtgående anvendelser inden for autentifikation, privatlivsbevarende verifikation og blockchain-systemer.
Læs hele metoden
Log ind med en gratis konto for at læse dette afsnit.
Method map
The neighbourhood of related methods — select a node to explore.
Kilder
- 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 ↗
Sådan citerer du denne side
ScholarGate. (2026, June 3). Zero-Knowledge Proof Protocol and Interactive Verification. ScholarGate. https://scholargate.app/da/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.
- Digital signaturordningKryptografi↔ compare
- Analyse af RSA-krypteringssystemetKryptografi↔ compare
- TLS ProtokolanalyseKryptografi↔ compare
Har du fundet en fejl på denne side? Indberet den eller foreslå en rettelse →