Uthibitisho Usio na Maarifa
Uthibitisho usio na maarifa (zero-knowledge proof) ni itifaki ya kriptografia ambayo mtoaji (prover) anaweza kumshawishi mthibitishaji (verifier) kuwa taarifa ni ya kweli bila kufichua habari yoyote ya ziada zaidi ya ukweli wa taarifa hiyo. Uthibitisho huu, ulioanzishwa na Goldwasser, Micali, na Rackoff mwaka 1985, una matumizi makubwa katika uthibitishaji wa utambulisho, uthibitishaji unaohifadhi faragha, na mifumo ya blockchain.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Ramani ya mbinu
Jirani ya mbinu zinazohusiana — chagua nodi ili kuchunguza.
Vyanzo
- 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 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 3). Zero-Knowledge Proof Protocol and Interactive Verification. ScholarGate. https://scholargate.app/sw/cryptography/zero-knowledge-proof
Mbinu ipi?
Weka mbinu hii kando ya jamaa zake wa karibu na uzisome bega kwa bega — maktaba huweka vitabu mezani; uamuzi ni wako.
- Mpango wa Sahihi ya KidijitaliKriptografia↔ linganisha
- Uchambuzi wa Mfumo wa Usimbaji wa RSAKriptografia↔ linganisha
- Uchambuzi wa Itifaki ya TLSKriptografia↔ linganisha
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →