Protocol Design and Analysis -- A Calculus for Access Control in Distributed Systems -- Deriving the Complete Knowledge of Participants in Cryptographic Protocols -- Systematic Design of Two-Party Authentication Protocols -- Combinatorics and Authentication -- Combinatorial characterizations of authentication codes -- Universal hashing and authentication codes -- On Correlation-immune functions -- Secret Sharing and Information Theory -- On the Size of Shares for Secret Sharing Schemes -- On Verification in Secret Sharing -- Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing -- Multiparty Secret Key Exchange Using a Random Deal of Cards -- Cryptanalysis -- Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer -- A Known Plaintext Attack of FEAL-4 and FEAL-6 -- A switching closure test to analyze cryptosystems -- An Attack on the Last Two Rounds of MD4 -- The Cryptanalysis of a New Public-Key Cryptosystem based on Modular Knapsacks -- Complexity Theory -- A One-Round, Two-Prover, Zero-Knowledge Protocol for NP -- Interactive Proofs with Space Bounded Provers -- Functional Inversion and Communication Complexity -- The Use of Interaction in Public Cryptosystems. -- Cryptographic Schemes Based on Number Theory -- New Public-Key Schemes Based on Elliptic Curves over the Ring Zn -- Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems -- CM-Curves with Good Cryptographic Properties -- A New ID-Based Key Sharing System -- Pseudorandomness -- Pseudo-random Generators from One-way Functions -- New Results on Pseudorandom Permutation Generators Based on the Des Scheme -- Applications and Implementations -- Faster Modular Multiplication by Operand Scaling -- Universal Electronic Cash -- How to Break and Repair a "Provably Secure" Untraceable Payment System -- Practical Quantum Oblivious Transfer -- Exploiting Parallelism in Hardware Implementation of the DES -- Secure Computation Protocols -- Foundations of Secure Interactive Computing -- Secure Computation -- A Cryptographic Scheme for Computerized General Elections -- Efficient Multiparty Protocols Using Circuit Randomization -- Public-Key Cryptosystems and Signatures -- Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack -- Towards Practical Public Key Systems Secure Against Chosen Ciphertext attacks -- Shared generation of authenticators and signatures -- Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer.