Opening session -- Keying the German Navy’s Enigma -- Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context -- On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs -- Why is cryptography harder than it looks? -- Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks -- The use of Encryption in Kerberos for Network Authentication -- UNIX Password Security - Ten Years Later -- Practical Problems with a Cryptographic Protection Scheme -- The Smart Diskette A Universal User Token and Personal Crypto-Engine -- Pseudo-randomness and Sequences -- On the Quadratic Spans of Periodic Sequences -- The Shortest Feedback Shift Register That Can Generate A Given Sequence -- Perfect Local Randomness in Pseudo-random Sequences -- Sparse Pseudorandom Distributions -- Bit Commitment Using Pseudo-Randomness -- Cryptanalysis and Implementation -- How to Predict Congruential Generators -- A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang -- On the Linear Consistency Test (LCT) in Cryptanalysis with Applications -- Batch RSA -- On the Implementation of Elliptic Curve Cryptosystems -- Signature and Authentication I -- New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs -- Undeniable Signatures -- Signature and Authentication II -- A Certified Digital Signature -- Efficient Identification and Signatures for Smart Cards -- A signature with shared verification scheme -- On-Line/Off-Line Digital Signatures -- Threshold schemes and Key management -- On the Classification of Ideal Secret Sharing Schemes -- Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space -- Secret Sharing Over Infinite Domains -- Threshold cryptosystems -- Flexible Access Control with Master Keys -- Key distribution and Network security -- Key Distribution Protocol for Digital Mobile Communication Systems -- A key exchange system based on real quadratic fields Extended abstract -- On Key Distribution Systems -- SDNS Architecture and End-to-end Encryption -- Fast computation -- A Survey of Hardware Implementations of RSA -- Modular Exponentiation Using Recursive Sums of Residues -- A Fast Modular-multiplication Algorithm based on a Higher Radix -- Addition Chain Heuristics -- How easy is collision search. New results and applications to DES -- Odds and ends -- A Design Principle for Hash Functions -- One Way Hash Functions and DES -- Properties of Cryptosystem PGM -- On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses -- Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash -- Zero-knowledge and Oblivious transfer -- Efficient Identification Schemes Using Two Prover Interactive Proofs -- On the concrete complexity of zero-knowledge proofs -- Zero Knowledge Proofs of Knowledge in Two Rounds -- Minimum Resource Zero-Knowledge Proofs -- Non-Interactive Oblivious Transfer and Applications -- Multiparty computation -- Multiparty Protocols Tolerating Half Faulty Processors -- Controlled Gradual Disclosure Schemes for Random Bits and Their Applications -- Multiparty Computation with Faulty Majority -- The Spymasters Double-Agent Problem -- Impromptu talks -- On the Structure of Secret Key Exchange Protocols -- An Efficient Identification Scheme Based on Permuted Kernels (extended abstract) -- An Efficient Software Protection Scheme -- Good S-Boxes Are Easy To Find -- Covert Distributed Processing with Computer Viruses -- Progress in Data Security Standardisation -- The FEAL-8 Cryptosystem and a Call for Attack -- How to Explain Zero-Knowledge Protocols to Your Children.

CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.