Publications of asiacrypt 1991

Page	Title
1-21	The Transition from Mechanisms to Electronic Computers, 1940 to 1950
22-35	Cryptanalysis of LOKI
36-50	Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI
51-58	A Method to Estimate the Number of Ciphertext Pairs for Differential Cryptanalysis
59-72	Construction of DES-like S-boxes Based on Boolean Functions Satisfyieng the SAC
73-81	The Data Base of Selected Permutations (Extended Abstract)
82-96	A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton
97-110	How to Construct A Family of Strong One Way Permutations
111-123	On Claw Free Families
124-138	Sibling Intractable Function Families and Their Applications (Extended Abstract)
139-148	A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme
149-158	A Generalized Secret Sharing Scheme With Cheater Detection
159-166	Generalized Threshold Cryptosystems
170-178	Feistel Type Authentication Codes
179-193	Research Activities on Cryptology in Korea
194-209	On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations
210-224	A Construction of a Cioher From a Single Pseudorandom Permutation
225-236	Optima Perfect Randomizers
237-246	A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract)
247-252	Results of Switching-Closure-Test on FEAL (Extended Abstract)
253-264	IC-Cards and Telecommunication Services
265-276	Cryptanalysis of Several Conference Key Distribution Schemes
277-287	Revealing Information with Partial Period Correlations (Extended Abstract)
288-298	Extended Majority Voting and Private-Key Algebraic-Code Encryptions
299-311	A Secure Analog Speech Scrambler Using the Discrete Cosine Transform
312-320	On Oblivious Transfer Protocol and Its Application for the Exchange of Secrets
321-330	4 Move Perfect ZKIP of Knowledge with No Assumption
331-345	On the Complexity of Constant Round ZKIP of Possession of Knowledge
346-351	On the Power of Two-Local Random Reductions
352-359	A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems
360-367	An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth Numbers
368-381	An Extensin of Zero-Knowledge Proofs and Its Applications
382-396	Any Language in IP Has a Divertable ZKIP
397-411	A Multi-Purpose Proof System - for Identity and Membership Proofs
412-426	Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract)
427-439	Cryptography and Machine Learning
440-449	Speeding up Prime Number Generation
450-459	Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence
460-469	On Ordinary Elliptic Curve Cryptosystems
470-476	Cryptanalysis of Another Knapsack Cryptosystem
477-480	Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91
481-484	On NIST's Proposed Digital Signature Standard
485-488	A Known-Plaintext Attack of FEAL-4 Based on the System of Linear Equations on Difference
489-492	Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption)
493-494	Privacy, Cryptographic Pseudonyms, and The State of Health
495-498	Limitations of the Even-Mansour Construction