Search
International Association for Cryptologic Research
What's new
Archive
Paper awards
Videos
Authors
Coauthors
By year
By venue
All Committees
Most Committees
Report errors
About
Publications of Crypto 1988
Page
Title
2-7
Weakening Security Assumptions and Oblivious Transfer (Abstract)
8-26
Limits on the Provable Consequences of One-way Permutations
27-35
Generalized Secret Sharing and Monotone Functions
37-56
Everything Provable is Provable in Zero-Knowledge
57-70
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
71-75
Zero-Knowledge With Finite State Verifiers
77-93
Intractable Problems in Number Theory
94-99
A Family of Jacobians Suitable for Discrete Log Cryptosystems
100-117
Computation of Approximate L-th Roots Modulo
n
and Application to Cryptography
119-131
On the McEliece Public-Key Cryptosystem
132-144
A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers
146-162
On the Existence of Pseudorandom Generators
163-172
On the Randomness of Legendre and Jacobi Sequences
173-198
Efficient, Perfect Random Number Generators
200-215
How To Sign Given Any Trapdoor Function
216-231
A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge
232-243
A Modification of the Fiat-Shamir Scheme
244-247
An Improvement of the Fiat-Shamir Identification and Signature Scheme
249-255
A Basic Theory of Public and Private Cryptosystems
256-268
Proving Security Against Chosen Cyphertext Attacks
269-282
Non-Interactive Zero-Knowledge with Preprocessing
284-296
The Noisy Oracle Problem
297-310
On Generating Solved Instances of Computational Problems
311-317
Bounds and Constructions for Authentication-Secrecy Codes with Splitting
319-327
Untraceable Electronic Cash
328-335
Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals
336-352
A Universal Problem in Secure and Verifiable Distributed Computation
354-374
An Abstract Theory of Computer Viruses
375-389
Abuses in Cryptography and How to Fight Them
390-448
How to (Really) Share a Secret
450-468
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
469-478
On the Linear Syndrome Method in Cryptoanalysis
479-482
Aperiodic Linear Complexities of de Bruijn Sequences
484-496
The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Foreward Facilities
497-506
Speeding Up Secret Computations with Insecure Auxiliary Devices
507-519
Developing Ethernet Enhanced-Security System
520-528
A Secure Audio Teleconference System
530-539
Diffie-Hillman is as Strong as Discrete Log for Certain Primes
540-563
Secret Error-Correcting Codes (SECC)
564-577
The Detection of Cheaters in Threshold Schemes
578-579
On the Power of 1-way Functions (Abstract)
580-582
"Practical IP" <= MA
583-588
Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract)