تفاصيل الكتاب

978-3-540-48184-3

Advances in Cryptology - CRYPTO -87

Publication Date: 1988

ISBN: 978-3-540-48184-3

Internet Resource: Please Login to download book


Zero-knowledge interactive proofsystems are a new technique which can be used as a cryptographic tool for designing provably secure protocols. Goldwasser, Micali, and Rackoff originally suggested this technique for controlling the knowledge released in an interactive proof of membership in a language, and for classification of languages. In this approach, knowledge is defined in terms of complexity to convey knowledge if it gives a computational advantage to the receiver, theory, and a message is said for example by giving him the result of an intractable computation. The formal model of interacting machines is described in. A proof-system (for a language L) is an interactive protocol by which one user, the prover, attempts to convince another user, the verifier, that a given input x is in L. We assume that the verifier is a probabilistic machine which is limited to expected polynomial-time computation, while the prover is an unlimited probabilistic machine.


Subject: Computer Science, authentication, cryptoanalysis, cryptography, cryptology, cryptosystems, data security, digital signature, encryption, privacy, security