Skip to main content
SpringerLink
Log in

Advances in Cryptology - CRYPTO '88

Proceedings

  • Conference proceedings
  • © 1990

Overview

Editors:
  1. Shafi Goldwasser

    1. Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA

    View editor publications

    You can also search for this editor in PubMed   Google Scholar

Part of the book series: Lecture Notes in Computer Science (LNCS, volume 403)

This is a preview of subscription content, log in via an institution to check access.

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (44 papers)

  1. Front Matter

    Pages I-XI
    Download chapter PDF

  2. Cryptographic Primitives

    1. Weakening Security Assumptions and Oblivious Transfer

      • Claude Crépeau, Joe Kilian
      Pages 2-7

    2. Limits on the Provable Consequences of One-way Permutations

      • Russell Impagliazzo, Steven Rudich
      Pages 8-26

    3. Generalized Secret Sharing and Monotone Functions

      • Josh Benaloh, Jerry Leichter
      Pages 27-35

  3. Zero-Knowledge

    1. Everything Provable is Provable in Zero-Knowledge

      • Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali et al.
      Pages 37-56

    2. A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm

      • Oded Goldreich, Eyal Kushilevitz
      Pages 57-70

    3. Zero-Knowledge With Finite State Verifiers

      • Cynthia Dwork, Larry Stockmeyer
      Pages 71-75

  4. Number Theory

    1. Intractable Problems in Number Theory

      • Eric Bach
      Pages 77-93

    2. A Family of Jacobians Suitable for Discrete Log Cryptosystems

      • Neal Koblitz
      Pages 94-99

    3. Computation of Approximate L-th Roots Modulo n and Application to Cryptography

      • Marc Girault, Philippe Toffin, Brigitte Vallée
      Pages 100-117

  6. Pseudorandomness

    1. On the Existence of Pseudorandom Generators

      • Oded Goldreich, Hugo Krawczyk, Michael Luby
      Pages 146-162

    2. On The Randomness of Legendre and Jacobi Sequences

      • Ivan Bjerre Damgård
      Pages 163-172

    3. Efficient, Perfect Random Number Generators

      • S. Micali, C. P. Schnorr
      Pages 173-198

  7. Signatures and Authentication

    1. How To Sign Given Any Trapdoor Function

      • Mihir Bellare, Silvio Micali
      Pages 200-215

    2. A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge

      • Louis Claude Guillou, Jean-Jacques Quisquater
      Pages 216-231

    3. A Modification of the Fiat-Shamir Scheme

      • Kazuo Ohta, Taisuaki Okamoto
      Pages 232-243

    4. An Improvement of the Fiat-Shamir Identification and Signature Scheme

      • Silvio Micali, Adi Shamir
      Pages 244-247

  8. On the Theory of Security I

    1. A Basic Theory of Public and Private Cryptosystems

      • Charles Rackoff
      Pages 249-255
Back to top

Keywords

Editors and Affiliations

  • Laboratory for Computer Science, Massachusetts Institute of Technology, Cambridge, USA

    Shafi Goldwasser

Bibliographic Information

Publish with us

Policies and ethics

Back to top

Search

Navigation