Advances in Cryptology - ASIACRYPT '91 International Conference on the Theory and Application of Cryptology, Fujiyoshida, Japan, November 11-14, 1991. Proceedings
This volume contains the proceedings of ASIACRYPT '91, the first international conference on the theory and application of cryptology to be held in the Asian area. It was held at Fujiyoshida, near Mount Fuji in Japan, in November 1991. The conference was modeled after the very successful CRYTO...
| Other Authors: | , , |
|---|---|
| Format: | eBook |
| Language: | English |
| Published: |
Berlin, Heidelberg
Springer Berlin Heidelberg
1993, 1993
|
| Edition: | 1st ed. 1993 |
| Series: | Lecture Notes in Computer Science
|
| Subjects: | |
| Online Access: | |
| Collection: | Springer Book Archives -2004 - Collection details see MPG.ReNa |
Table of Contents:
- On necessary and sufficient conditions for the construction of super pseudorandom permutations
- A construction of a cipher from a single pseudorandom permutation
- Optimal perfect randomizers
- A general purpose technique for locating key scheduling weaknesses in DES-like cryptosystems
- Results of switching-closure-test on FEAL
- IC-cards and telecommunication services
- Cryptanalysis of several conference key distribution schemes
- Revealing information with partial period correlations (extended abstract)
- Extended majority voting and private-key algebraic-code encryptions
- A secure analog speech scrambler using the discrete cosine transform
- An oblivious transfer protocol and its application for the exchange of secrets
- 4 Move perfect ZKIP of knowledge with no assumption
- On the complexity of constant round ZKIP of possession of knowledge
- On the power of two-localrandom reductions
- A note on one-prover, instance-hiding zero-knowledge proof systems
- An efficient zero-knowledge scheme for the discrete logarithm based on smooth numbers
- An extension of zero-knowledge proofs and its applications
- Any language in IP has a divertible ZKIP
- A multi-purpose proof system — for identity and membership proofs
- Formal verification of probabilistic properties in cryptographic protocols
- Cryptography and machine learning
- Speeding up prime number generation
- Two efficient server-aided secret computation protocols based on the addition sequence
- On ordinary elliptic curve cryptosystems
- Cryptanalysis of another knapsack cryptosystem
- Collisions for Schnorr's hash function FFT-Hash presented at Crypto '91
- On NIST's proposed digital signature standard
- A known-plaintext attack of FEAL-4 based on the system of linear equations on difference
- Simultaneous attacks in differential cryptanalysis (getting more pairs per encryption)
- Privacy, cryptographic pseudonyms, and the state of health
- The transition from mechanisms to electronic computers, 1940 to 1950
- Cryptanalysis of LOKI
- Improving resistance to differential cryptanalysis and the redesign of LOKI
- A method to estimate the number of ciphertext pairs for differential cryptanalysis
- Construction of DES-like S-boxes based on Boolean functions satisfying the SAC
- The data base of selected permutations
- A framework for the design of one-way hash functions including cryptanalysis of Damgård's one-way function based on a cellular automaton
- How to construct a family of strong one way permutations
- On claw free families
- Sibling intractable function families and their applications
- A digital multisignature scheme based on the Fiat-Shamir scheme
- A generalized secret sharing scheme with cheater detection
- Generalized threshold cryptosystems
- Feistel type authentication codes
- Research activities on cryptology in korea
- Limitations of the Even-Mansour construction