| year |
venue |
title |
pages |
| 1988 | crypto | The Noisy Oracle Problem | 284-296 |
| 1988 | crypto | On the McEliece Public-Key Cryptosystem | 119-131 |
| 1988 | crypto | Generalized Secret Sharing and Monotone Functions | 27-35 |
| 1988 | crypto | The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition | 450-468 |
| 1988 | crypto | Diffie-Hillman is as Strong as Discrete Log for Certain Primes | 530-539 |
| 1988 | crypto | A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers | 132-144 |
| 1988 | crypto | Computation of Approximate L-th Roots Modulo n and Application to Cryptography | 100-117 |
| 1988 | crypto | On the Linear Syndrome Method in Cryptoanalysis | 469-478 |
| 1988 | crypto | A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm | 57-70 |
| 1988 | crypto | Speeding Up Secret Computations with Insecure Auxiliary Devices | 497-506 |
| 1988 | crypto | On the Existence of Pseudorandom Generators | 146-162 |
| 1988 | crypto | A Modification of the Fiat-Shamir Scheme | 232-243 |
| 1988 | crypto | Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract) | 583-588 |
| 1988 | crypto | A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge | 216-231 |
| 1988 | crypto | "Practical IP" <= MA | 580-582 |
| 1988 | crypto | Untraceable Electronic Cash | 319-327 |
| 1988 | crypto | Advances in Cryptology - CRYPTO '88, 8th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1988, Proceedings | online |
| 1988 | crypto | Developing Ethernet Enhanced-Security System | 507-519 |
| 1988 | crypto | The Detection of Cheaters in Threshold Schemes | 564-577 |
| 1988 | crypto | A Universal Problem in Secure and Verifiable Distributed Computation | 336-352 |
| 1988 | crypto | Secret Error-Correcting Codes (SECC) | 540-563 |
| 1988 | crypto | Limits on the Provable Consequences of One-way Permutations | 8-26 |
| 1988 | crypto | On Generating Solved Instances of Computational Problems | 297-310 |
| 1988 | crypto | A Basic Theory of Public and Private Cryptosystems | 249-255 |
| 1988 | crypto | An Abstract Theory of Computer Viruses | 354-374 |
| 1988 | crypto | Weakening Security Assumptions and Oblivious Transfer (Abstract) | 2-7 |
| 1988 | crypto | A Family of Jacobians Suitable for Discrete Log Cryptosystems | 94-99 |
| 1988 | crypto | How To Sign Given Any Trapdoor Function | 200-215 |
| 1988 | crypto | Proving Security Against Chosen Cyphertext Attacks | 256-268 |
| 1988 | crypto | On the Randomness of Legendre and Jacobi Sequences | 163-172 |
| 1988 | crypto | Non-Interactive Zero-Knowledge with Preprocessing | 269-282 |
| 1988 | crypto | Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals | 328-335 |
| 1988 | crypto | Everything Provable is Provable in Zero-Knowledge | 37-56 |
| 1988 | crypto | The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Foreward Facilities | 484-496 |
| 1988 | crypto | Intractable Problems in Number Theory | 77-93 |
| 1988 | crypto | Abuses in Cryptography and How to Fight Them | 375-389 |
| 1988 | crypto | How to (Really) Share a Secret | 390-448 |
| 1988 | crypto | On the Power of 1-way Functions (Abstract) | 578-579 |
| 1988 | crypto | Bounds and Constructions for Authentication-Secrecy Codes with Splitting | 311-317 |
| 1988 | crypto | Aperiodic Linear Complexities of de Bruijn Sequences | 479-482 |
| 1988 | crypto | A Secure Audio Teleconference System | 520-528 |
| 1988 | crypto | Efficient, Perfect Random Number Generators | 173-198 |
| 1988 | crypto | An Improvement of the Fiat-Shamir Identification and Signature Scheme | 244-247 |
| 1988 | crypto | Zero-Knowledge With Finite State Verifiers | 71-75 |
| 1988 | eurocrypt | Windmill Generators: A Generalization and an Observation of How Many There Are | 325-330 |
| 1988 | eurocrypt | Linear Recurring m-Arrays | 351-357 |
| 1988 | eurocrypt | Some Constructions for Authentication-Secrecy Codes | 57-75 |
| 1988 | eurocrypt | Some New Classes of Geometric Threshold Schemes | 389-401 |
| 1988 | eurocrypt | A New Class of Nonlinear Functions for Running-key Generators (Extended Abstract) | 317-324 |
| 1988 | eurocrypt | Some Applications of Multiple Key Ciphers | 455-467 |
| 1988 | eurocrypt | A Generalized Birthday Attack | 129-156 |
| 1988 | eurocrypt | Lock-In Effect in Cascades of Clock-Controlled Shift-Registers | 331-343 |
| 1988 | eurocrypt | How to Break Okamoto's Cryptosystem by Reducing Lattice Bases | 281-291 |
| 1988 | eurocrypt | The Probabilistic Theory of Linear Complexity | 191-209 |
| 1988 | eurocrypt | Public Quadratic Polynominal-Tuples for Efficient Signature-Verification and Message-Encryption | 419-453 |
| 1988 | eurocrypt | Manipulations and Errors, Detection and Localization | 97-106 |
| 1988 | eurocrypt | Elections with Unconditionally-Secret Ballots and Disruption Equivalent to Breaking RSA | 177-182 |
| 1988 | eurocrypt | Anonymous and Verifiable Registration in Databases | 167-176 |
| 1988 | eurocrypt | Properties of the Euler Totient Function Modulo 24 and Some of its Cryptographic Implications | 267-274 |
| 1988 | eurocrypt | Fast Correltaion Attacks on Stream Ciphers (Extended Abstract) | 301-314 |
| 1988 | eurocrypt | Authentication Codes with Multiple Arbiters (Extended Abstract) | 51-55 |
| 1988 | eurocrypt | Substantial Number of Cryptographic Keys and Its Application to Encryption Designs | 361-373 |
| 1988 | eurocrypt | A New Probabilistic Encryption Scheme | 415-418 |
| 1988 | eurocrypt | A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory | 123-128 |
| 1988 | eurocrypt | A Universal Algorithm for Homophonic Coding | 405-414 |
| 1988 | eurocrypt | Cryptanalysis of F.E.A.L | 293-299 |
| 1988 | eurocrypt | A Fast Modular Arithmetic Algorithm Using a Residue Table (Extended Abstract) | 245-250 |
| 1988 | eurocrypt | Advances in Cryptology - EUROCRYPT '88, Workshop on the Theory and Application of of Cryptographic Techniques, Davos, Switzerland, May 25-27, 1988, Proceedings | online |
| 1988 | eurocrypt | A Probabilistic Primality test Based on the Properties of Certain Generalized Lucas Numbers | 211-223 |
| 1988 | eurocrypt | Fast RSA-Hardware: Dream or Reality? | 257-264 |
| 1988 | eurocrypt | A Measure of Semiequivocation | 375-387 |
| 1988 | eurocrypt | Privacy Protected Payments - Realization of a Protocol that Guarantees Payer Anonymity | 107-122 |
| 1988 | eurocrypt | A Smart Card Implementation of the Fiat-Shamir Identification Scheme | 87-95 |
| 1988 | eurocrypt | An Interactive Data Exchange Protocol Based on Discrete Exponentiation | 159-166 |
| 1988 | eurocrypt | Fast Exponentiation in GF(2n) | 251-255 |
| 1988 | eurocrypt | Passports and Visas Versus IDS (Extended Abstract) | 183-188 |
| 1988 | eurocrypt | Efficient Zero-Knowledge Identification Scheme for Smart Cards | 77-84 |
| 1988 | eurocrypt | Key Agreements Based on Function Composition | 3-10 |
| 1988 | eurocrypt | Security of Improved Identity-Based Conference Key Distribution Systems | 11-19 |
| 1988 | eurocrypt | Factorization of Large Integers on a Massively Parallel Computer | 235-243 |
| 1988 | eurocrypt | Subliminal-Free Authentication and Signature (Extended Abstract) | 23-33 |
| 1988 | eurocrypt | On the Construction of Random Number Generators and Random Function Generators | 225-232 |
| 1988 | eurocrypt | Proof of Massey's Conjectured Algorithm | 345-349 |
| 1988 | eurocrypt | An Observation on the Security of McEliece's Public-Key Cryptosystem | 275-280 |
| 1988 | eurocrypt | Zero-Knowledge Proofs of Identity And Veracity of Transaction Receipts | 35-49 |
| 1988 | jofc | How to Share a Secret with Cheaters | 133-138 |
| 1988 | jofc | Zero-Knowledge Proofs of Identity | 77-94 |
| 1988 | jofc | A Key-Exchange System Based on Imaginary Quadratic Fields | 107-118 |
| 1988 | jofc | The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability | 65-75 |
| 1988 | jofc | Is the Data Encryption Standard a Group? (Results of Cycling Experiments on DES) | 3-36 |
| 1988 | jofc | A Key Distribution System Equivalent to Factoring | 95-105 |
| 1988 | jofc | Some Constructions and Bounds for Authentication Codes | 37-52 |
| 1988 | jofc | A Generalization of Hellman's Extension to Shannon's Approach to Cryptography | 129-131 |
| 1988 | jofc | A Construction for Authentication/Secrecy Codes from Certain Combinatorial Designs | 119-127 |
| 1988 | jofc | The Generation of Random Numbers that Are Probably Prime | 53-64 |
