ASIACRYPT 1991: Fujiyoshida, Japan

Invited Lecture I

• Donald W. Davies:
  The Transition from Mechanisms to Electronic Computers, 1940 to 1950. 1-21
  

Differential Cryptanalysis and DES-Like Cryptosystems

• Lars R. Knudsen:
  Cryptanalysis of LOKI. 22-35
  
• Lawrence Brown, Matthew Kwan, Josef Pieprzyk, Jennifer Seberry:
  Improving Resistance to Differential Cryptanalysis and the Redesign of LOKI. 36-50
  
• Hiroshi Miyano:
  A Method to Estimate the Number of Ciphertext Pairs for Differential Cryptanalysis. 51-58
  
• Kwangjo Kim:
  Construction of DES-like S-boxes Based on Boolean Functions Satisfyieng the SAC. 59-72
  
• Jun-Hui Yang, Zong-Duo Dai, Kencheng Zeng:
  The Data Base of Selected Permutations (Extended Abstract). 73-81
  

Hashing and Signature Schemes

• Joan Daemen, René Govaerts, Joos Vandewalle:
  A Framework for the Design of One-Way Hash Functions Including Cryptanalysis of Damgård's One-Way Function Based on a Cellular Automaton. 82-96
  
• Babak Sadeghiyan, Yuliang Zheng, Josef Pieprzyk:
  How to Construct A Family of Strong One Way Permutations. 97-110
  
• Wakaha Ogata, Kaoru Kurosawa:
  On Claw Free Families. 111-123
  
• Yuliang Zheng, Thomas Hardjono, Josef Pieprzyk:
  Sibling Intractable Function Families and Their Applications (Extended Abstract). 124-138
  
• Kazuo Ohta, Tatsuaki Okamoto:
  A Digital Multisignature Scheme Based on the Fiat-Shamir Scheme. 139-148
  

Secret Sharing, Threshold, an Authentication Codes

• Hung-Yu Lin, Lein Harn:
  A Generalized Secret Sharing Scheme With Cheater Detection. 149-158
  
• Chi-Sung Laih, Lein Harn:
  Generalized Threshold Cryptosystems. 159-166
  
• Reihaneh Safavi-Naini:
  Feistel Type Authentication Codes. 170-178
  

Invited Lecture II

• Man Y. Rhee:
  Research Activities on Cryptology in Korea. 179-193
  

Block Ciphers - Foundations and Analysis

• Babak Sadeghiyan, Josef Pieprzyk:
  On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations. 194-209
  
• Shimon Even, Yishay Mansour:
  A Construction of a Cioher From a Single Pseudorandom Permutation. 210-224
  
• Josef Pieprzyk, Babak Sadeghiyan:
  Optima Perfect Randomizers. 225-236
  
• Matthew Kwan, Josef Pieprzyk:
  A General Purpose Technique for Locating Key Scheduling Weakness in DES-like Cryptosystems (Extended Abstract). 237-246
  
• Hikaru Morita, Kazuo Ohta, Shoji Miyaguchi:
  Results of Switching-Closure-Test on FEAL (Extended Abstract). 247-252
  

Invited Lecture III

• Jun-ichi Mizusawa:
  IC-Cards and Telecommunication Services. 253-264
  

Cryptanalysis and New Ciphers

• Atsushi Shimbo, Shin-ichi Kawamura:
  Cryptanalysis of Several Conference Key Distribution Schemes. 265-276
  
• Andrew Klapper, Mark Goresky:
  Revealing Information with Partial Period Correlations (Extended Abstract). 277-287
  
• Joost Meijers, Johan van Tilburg:
  Extended Majority Voting and Private-Key Algebraic-Code Encryptions. 288-298
  
• Bruce Goldburg, Ed Dawson, S. Sridharan:
  A Secure Analog Speech Scrambler Using the Discrete Cosine Transform. 299-311
  

Proof Systems and Interactive Protocols I

• Lein Harn, Hung-Yu Lin:
  On Oblivious Transfer Protocol and Its Application for the Exchange of Secrets. 312-320
  
• Takeshi Saito, Kaoru Kurosawa, Kouichi Sakurai:
  4 Move Perfect ZKIP of Knowledge with No Assumption. 321-330
  
• Toshiya Itoh, Kouichi Sakurai:
  On the Complexity of Constant Round ZKIP of Possession of Knowledge. 331-345
  
• Lance Fortnow, Mario Szegedy:
  On the Power of Two-Local Random Reductions. 346-351
  
• Joan Feigenbaum, Rafail Ostrovsky:
  A Note On One-Prover, Instance-Hiding Zero-Knowledge Proof Systems. 352-359
  

Proof Systems and Interactive Protocols II

• Yvo Desmedt, Mike Burmester:
  An Efficient Zero-Knowledge Scheme for the Discrete Logarithm Based on Smooth Numbers. 360-367
  
• Tatsuaki Okamoto:
  An Extensin of Zero-Knowledge Proofs and Its Applications. 368-381
  
• Toshiya Itoh, Kouichi Sakurai, Hiroki Shizuya:
  Any Language in IP Has a Divertable ZKIP. 382-396
  
• Chaosheng Shu, Tsutomu Matsumoto, Hideki Imai:
  A Multi-Purpose Proof System - for Identity and Membership Proofs. 397-411
  
• Marie-Jeanne Toussaint:
  Formal Verification of Probabilistic Properties in Cryptographic Protocols (Extended Abstract). 412-426
  

Invited Lecture IV

• Ronald L. Rivest:
  Cryptography and Machine Learning. 427-439
  

Public-Key Ciphers - Foundations and Analysis

• Jørgen Brandt, Ivan Damgård, Peter Landrock:
  Speeding up Prime Number Generation. 440-449
  
• Chi-Sung Laih, Sung-Ming Yen, Lein Harn:
  Two Efficient Server-Aided Secret Computation Protocols Based on the Addition Sequence. 450-459
  
• Atsuko Miyaji:
  On Ordinary Elliptic Curve Cryptosystems. 460-469
  
• Antoine Joux, Jacques Stern:
  Cryptanalysis of Another Knapsack Cryptosystem. 470-476
  

Impromptu Talks

• Joan Daemen, Antoon Bosselaers, René Govaerts, Joos Vandewalle:
  Collisions for Schnorr's Hash Function FFT-Hash Presented at Crypto '91. 477-480
  
• Ronald L. Rivest:
  On NIST's Proposed Digital Signature Standard. 481-484
  
• Toshinobu Kaneko:
  A Known-Plaintext Attack of FEAL-4 Based on the System of Linear Equations on Difference. 485-488
  
• Matthew Kwan:
  Simultaneous Attacks in Differential Cryptanalysis (Getting More Pairs Per Encryption). 489-492
  
• Stig Fr. Mjølsnes:
  Privacy, Cryptographic Pseudonyms, and The State of Health. 493-494
  
• Joan Daemen:
  Limitations of the Even-Mansour Construction. 495-498