8. CRYPTO 1988: Santa Barbara, California, USA

Cryptographic Primitives

• Claude Crépeau, Joe Kilian:
  Weakening Security Assumptions and Oblivious Transfer (Abstract). 2-7
  
• Russell Impagliazzo, Steven Rudich:
  Limits on the Provable Consequences of One-way Permutations. 8-26
  
• Josh Cohen Benaloh, Jerry Leichter:
  Generalized Secret Sharing and Monotone Functions. 27-35
  

Zero-Knowledge

• Michael Ben-Or, Oded Goldreich, Shafi Goldwasser, Johan Håstad, Joe Kilian, Silvio Micali, Phillip Rogaway:
  Everything Provable is Provable in Zero-Knowledge. 37-56
  
• Oded Goldreich, Eyal Kushilevitz:
  A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm. 57-70
  
• Cynthia Dwork, Larry J. Stockmeyer:
  Zero-Knowledge With Finite State Verifiers. 71-75
  

Number Theory

• Eric Bach:
  Intractable Problems in Number Theory. 77-93
  
• Neal Koblitz:
  A Family of Jacobians Suitable for Discrete Log Cryptosystems. 94-99
  
• Marc Girault, Philippe Toffin, Brigitte Vallée:
  Computation of Approximate L-th Roots Modulo n and Application to Cryptography. 100-117
  

Cryptoanalysis

• Johan van Tilburg:
  On the McEliece Public-Key Cryptosystem. 119-131
  
• Michael Lucks:
  A Constraint Satisfaction Algorithm for the Automated Decryption of Simple Substitution Ciphers. 132-144
  

Pseudorandomness

• Oded Goldreich, Hugo Krawczyk, Michael Luby:
  On the Existence of Pseudorandom Generators. 146-162
  
• Ivan Damgård:
  On the Randomness of Legendre and Jacobi Sequences. 163-172
  
• Silvio Micali, Claus-Peter Schnorr:
  Efficient, Perfect Random Number Generators. 173-198
  

Signatures and Authentication

• Mihir Bellare, Silvio Micali:
  How To Sign Given Any Trapdoor Function. 200-215
  
• Louis C. Guillou, Jean-Jacques Quisquater:
  A "Paradoxical" Indentity-Based Signature Scheme Resulting from Zero-Knowledge. 216-231
  
• Kazuo Ohta, Tatsuaki Okamoto:
  A Modification of the Fiat-Shamir Scheme. 232-243
  
• Silvio Micali, Adi Shamir:
  An Improvement of the Fiat-Shamir Identification and Signature Scheme. 244-247
  

On the Theory of Security I

• Charles Rackoff:
  A Basic Theory of Public and Private Cryptosystems. 249-255
  
• Manuel Blum, Paul Feldman, Silvio Micali:
  Proving Security Against Chosen Cyphertext Attacks. 256-268
  
• Alfredo De Santis, Silvio Micali, Giuseppe Persiano:
  Non-Interactive Zero-Knowledge with Preprocessing. 269-282
  

On the Theory of Security II

• Uriel Feige, Adi Shamir, Moshe Tennenholtz:
  The Noisy Oracle Problem. 284-296
  
• Martín Abadi, Eric Allender, Andrei Z. Broder, Joan Feigenbaum, Lane A. Hemachandra:
  On Generating Solved Instances of Computational Problems. 297-310
  
• Marijke De Soete:
  Bounds and Constructions for Authentication-Secrecy Codes with Splitting. 311-317
  

Protocols

• David Chaum, Amos Fiat, Moni Naor:
  Untraceable Electronic Cash. 319-327
  
• Ivan Damgård:
  Payment Systems and Credential Mechanisms with Provable Security Against Abuse by Individuals. 328-335
  
• Ming-Deh A. Huang, Shang-Hua Teng:
  A Universal Problem in Secure and Verifiable Distributed Computation. 336-352
  

Security Concerns

• Leonard M. Adleman:
  An Abstract Theory of Computer Viruses. 354-374
  
• Yvo Desmedt:
  Abuses in Cryptography and How to Fight Them. 375-389
  
• Gustavus J. Simmons:
  How to (Really) Share a Secret. 390-448
  

Linear Complexity

• Réjane Forré:
  The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition. 450-468
  
• Kencheng Zeng, Minqiang Huang:
  On the Linear Syndrome Method in Cryptoanalysis. 469-478
  
• Richard T. C. Kwok, Maurice Beale:
  Aperiodic Linear Complexities of de Bruijn Sequences. 479-482
  

Systems

• J. R. Sherwood, V. A. Gallo:
  The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Foreward Facilities. 484-496
  
• Tsutomu Matsumoto, Koki Kato, Hideki Imai:
  Speeding Up Secret Computations with Insecure Auxiliary Devices. 497-506
  
• B. J. Herbison:
  Developing Ethernet Enhanced-Security System. 507-519
  
• D. G. Steer, L. Strawczynski, Whitfield Diffie, Michael J. Wiener:
  A Secure Audio Teleconference System. 520-528
  

Short Rump Session Presentations

• Bert den Boer:
  Diffie-Hillman is as Strong as Discrete Log for Certain Primes. 530-539
  
• Tzonelih Hwang, T. R. N. Rao:
  Secret Error-Correcting Codes (SECC). 540-563
  
• Ernest F. Brickell, Douglas R. Stinson:
  The Detection of Cheaters in Threshold Schemes. 564-577
  
• Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer:
  On the Power of 1-way Functions (Abstract). 578-579
  
• Gilles Brassard, Ivan Damgård:
  "Practical IP" <= MA. 580-582
  
• Jørgen Brandt, Ivan Damgård, Peter Landrock, Torben P. Pedersen:
  Zero-Knowledge Authentication Scheme with Secret Key Exchange (Extended Abstract). 583-588
  

Last update Sat May 18 18:19:04 2013 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page