Lecture Notes in Computer Science

Advances in Cryptology - CRYPTO '87

Proceedings

Editors: Pomerance, Carl (Ed.)

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-48184-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
About this 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 [19]. 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 [19, 15, 171. 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. (In cryptographic applications the prover has some trapdoor information, or knows the cleartext of a publicly known ciphertext) A correct proof-system must have the following properties: If XE L, the prover will convince the verifier to accept the pmf with very high probability. If XP L no prover, no matter what program it follows, is able to convince the verifier to accept the proof, except with vanishingly small probability.

Table of contents (43 chapters)

  • Standards for Data Security — a Change of Direction

    Price, Wyn L.

    Pages 3-8

  • Integrating Cryptography in ISDN

    Presttun, Kåre

    Pages 9-18

  • Special Uses and Abuses of the Fiat-Shamir Passport Protocol (extended abstract)

    Desmedt, Yvo (et al.)

    Pages 21-39

  • Direct Minimum-Knowledge Computations (Extended Abstract)

    Impagliazzo, Russell (et al.)

    Pages 40-51

  • Non-Interactive Zero-Knowledge Proof Systems

    Santis, Alfredo (et al.)

    Pages 52-72

Buy this book

eBook $69.99
price for USA (gross)
  • ISBN 978-3-540-48184-3
  • Digitally watermarked, DRM-free
  • Included format: PDF
  • ebooks can be used on all reading devices
  • Immediate eBook download after purchase
Loading...

Recommended for you

Loading...

Bibliographic Information

Bibliographic Information
Book Title
Advances in Cryptology - CRYPTO '87
Book Subtitle
Proceedings
Editors
  • Carl Pomerance
Series Title
Lecture Notes in Computer Science
Series Volume
293
Copyright
1988
Publisher
Springer-Verlag Berlin Heidelberg
Copyright Holder
Springer-Verlag Berlin Heidelberg
eBook ISBN
978-3-540-48184-3
DOI
10.1007/3-540-48184-2
Series ISSN
0302-9743
Edition Number
1
Number of Pages
X, 466
Topics