Advances in Cryptology — CRYPTO ’91: Proceedings

M. Abadi, M. Burrows, B. Lampson, G. Plotkin (auth.), Joan Feigenbaum (eds.)3540551883, 9783540551881

Presents the proceedings of the 11th in a series of workshops on cryptology sponsored by the International Association for Cryptologic Research. All theoretical and practical aspects of cryptology are represented.

---

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