Publications of crypto 1991

Page	Title
1-23	A Calculus for Access Control in Distributed Systems
24-43	Deriving the Complete Knowledge of Participants in Cryptographic Protocols (Extended Abstract)
44-61	Systematic Design of Two-Party Authentication Protocols
62-73	Combinatorial Characterizations of Authentication Codes
74-85	Universal Hashing and Authentication Codes
86-100	On Correlation-Immune Functions
101-113	On the Size of Shares for Secret Sharing Schemes
114-128	On Verification in Secret Sharing
129-140	Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
141-155	Multiparty Secret Key Exchange Using a Random Deal of Cards
156-171	Differential Cryptanalysis of Snefru, Khafre, REDOC-II, LOKI and Lucifer
172-181	A Known Plaintext Attack of FEAL-4 and FEAL-6
183-193	A Switching Closure Test to Analyze Cryptosystems
194-203	An Attack on the Last Two Rounds of MD4
204-212	The Cryptoanalysis of a New Public-Key Cryptosystem Based on Modular Knapsacks
213-224	A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
225-231	Interactive Proofs with Space Bounded Provers
232-241	Functional Inversion and Communication Complexity
242-251	The Use of Interaction in Public Cryptosystems (Extended Abstract)
252-266	New Public-Key Schemes Based on Elliptic Curves over the Ring Zn
267-278	Efficient Algorithms for the Construction of Hyperelliptic Cryptosystems
279-287	CM-Curves with Good Cryptographic Properties
288-299	A New ID-Based Key Sharing System
300	Pseudo-random Generators from One-way Functions (Abstract)
301-312	New Results on Pseudorandom Permutation Generators Based on the DES Scheme
313-323	Faster Modular Multiplication by Operand Scaling
324-337	Universal Electronic Cash
338-350	How To Break and Repair A "Provably Secure" Untraceable Payment System
351-366	Practical Quantum Oblivious Transfer
367-376	Exploiting Parallelism in Hardware Implementations of the DES
377-391	Foundations of Secure Interactive Computing
392-404	Secure Computation (Abstract)
405-419	A Cryptographic Scheme for Computerized Elections
420-432	Efficient Multiparty Protocols Using Circuit Randomization
433-444	Non-Interactive Zero-Knowledge Proof of Knowledge and Chosen Ciphertext Attack
445-456	Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks
457-469	Shared Generation of Authenticators and Signatures (Extended Abstract)
470-484	Cryptographically Strong Undeniable Signatures, Unconditionally Secure for the Signer