Advances in Cryptology — CRYPTO’ 88 [electronic resource] : Proceedings / edited by Shafi Goldwasser.

Cryptographic Primitives -- Weakening Security Assumptions and Oblivious Transfer -- Limits on the Provable Consequences of One-way Permutations -- Generalized Secret Sharing and Monotone Functions -- Zero-Knowledge -- Everything Provable is Provable in Zero-Knowledge -- A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm -- Zero-Knowledge With Finite State Verifiers -- Number Theory -- Intractable Problems in Number Theory -- A Family of Jacobians Suitable for Discrete Log Cryptosystems -- Computation of Approximate L-th Roots Modulo n and Application to Cryptography -- Cryptanalysis -- On the McEliece Public-Key Cryptosystem -- A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers -- Pseudorandomness -- On the Existence of Pseudorandom Generators -- On The Randomness of Legendre and Jacobi Sequences -- Efficient, Perfect Random Number Generators -- Signatures and Authentication -- How To Sign Given Any Trapdoor Function -- A “Paradoxical” Indentity-Based Signature Scheme Resulting from Zero-Knowledge -- A Modification of the Fiat-Shamir Scheme -- An Improvement of the Fiat-Shamir Identification and Signature Scheme -- On the Theory of Security I -- A Basic Theory of Public and Private Cryptosystems -- Proving Security Against Chosen Ciphertext Attacks -- Non-Interactive Zero-Knowledge with Preprocessing -- On the Theory of Security II -- The Noisy Oracle Problem -- On Generating Solved Instances of Computational Problems -- Bounds and Constructions for Authentication - Secrecy Codes with Splitting -- Protocols -- Untraceable Electronic Cash -- Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals -- A Universal Problem in Secure and Verifiable Distributed Computation -- Security Concerns -- An Abstract Theory of Computer Viruses -- Abuses in Cryptography and How to Fight Them -- How to (Really) Share a Secret -- Linear Complexity -- The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition -- On the Linear Syndrome Method in Cryptanalysis -- Aperiodic Linear Complexities of de Bruijn Sequences -- Systems -- The Application of Smart Cards for Rsa Digital Signatures in a Network Comprising Both Interactive and Store-and-Forward Facilities -- Speeding Up Secret Computations with Insecure Auxiliary Devices -- Developing Ethernet Enhanced-Security System -- A Secure Audio Teleconference System -- Short Rump Session Presentations -- Diffie-Hellman is as Strong as Discrete Log for Certain Primes -- Secret Error-Correcting Codes (SECC) -- The Detection of Cheaters in Threshold Schemes -- On the Power of 1-way Functions -- “Practical IP” ? MA -- Zero-Knowledge Authentication Scheme with Secret Key Exchange.