Publications of crypto 1992

Page	Title
1-14	Provably Unforgeable Signatures
15-30	New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
31-53	Provably Secure and Practical Identification Schemes and Corresponding Signature Schemes
54-65	An Efficient Digital Signature Scheme Based on an Elliptic Curve Over the Ring Zn
66-75	Designing and Detecting Trapdoors for Discrete Log Cryptosystems
76-88	Response to Comments of the NIST Proposed Digital Signature Standard
89-105	Wallet Databases with Observers
106-112	Making Electronic Refunds Safer
113-138	Fair Public-Key Cryptosystems
139-147	Pricing via Processing or Combatting Junk Mail
148-167	On the Information Rate of Secret Sharing Schemes (Extended Abstract)
168-182	New General Lower Bounds on the Information Rate of Secret Sharing Schemes
183-195	Universally Ideal Secret Sharing Schemes (Preliminary Version)
196-214	Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
215-227	Low Communication 2-Prover Zero-Knowledge Proofs for NP
228-245	Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
246-259	On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)
260-279	On the Design of SP Networks From an Information Theoretic Point of View
280-291	Partially-Bent Functions
292-304	Practical Approaches to Attaining Security Against Adaptively Chosen Ciphertext Attacks (Extended Abstract)
305-311	On the Security of the Permuted Kernel Identification Scheme
312-323	Massively Parallel Computation of Discrete Logarithms
324-332	A Quadratic Sieve on the n-Dimensional Cube
333-344	Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
345-357	Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
358-370	On Generation of Probable Primes By Incremental Search
371-389	Kid Krypto
390-420	On Defining Proofs of Knowledge
421-432	Pubic Randomness in Cryptography
433-441	Necessary and Sufficient Conditions For Collision-Free Hashing
442-460	Certifying Cryptographic Tools: The Case of Trapdoor Permutations
461-470	Protocols for Secret Key Agreement by Public Discussion Based on Common Information
471-486	Perfectly-Secure Key Distribution for Dynamic Conferences
487-496	Differential Cryptanalysis of the Full 16-Round DES
497-511	Iterative Characteristics of DES and s²-DES
512-520	DES is not a Group
521-539	A High-Speed DES Implementation for Network Applications
540-548	Threshold Schemes with Disenrollment
549-557	Non-Existence of Homomorphic General Sharing Schemes for Some Key Spaces (Extended Abstract)
558-565	An l-Span Generalized Secret Sharing Scheme
566-574	Provable Security Against Differential Cryptanalysis
575-586	Content-Addressable Search Engines and DES-like Systems
587-593	FFT-Hash-II is not yet Collision-free