CRYPTO is a conference devoted to all aspects of cryptologic research. It is held each year at the University of California at Santa Barbara. Annual meetings on this topic also take place in Europe and are regularly published in this Lecture Notes series under the name of EUROCRYPT. This volume presents the proceedings of the ninth CRYPTO meeting. The papers are organized into sections with the following themes: Why is cryptography harder than it looks?, pseudo-randomness and sequences, cryptanalysis and implementation, signature and authentication, threshold schemes and key management, key distribution and network security, fast computation, odds and ends, zero-knowledge and oblivious transfer, multiparty computation.
Author(s): David Kahn (auth.), Gilles Brassard (eds.)
Series: Lecture Notes in Computer Science 435
Edition: 1
Publisher: Springer-Verlag New York
Year: 1990
Language: English
Pages: 634
Tags: Data Encryption
Keying the German Navy’s Enigma....Pages 2-5
Making Conditionally Secure Cryptosystems Unconditionally Abuse-Free in a General Context....Pages 6-16
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs....Pages 17-27
Problems with the Normal Use of Cryptography for Providing Security on Unclassified Networks....Pages 30-34
The use of Encryption in Kerberos for Network Authentication....Pages 35-43
UNIX Password Security - Ten Years Later....Pages 44-63
Practical Problems with a Cryptographic Protection Scheme....Pages 64-73
The Smart Diskette A Universal User Token and Personal Crypto-Engine....Pages 74-79
On the Quadratic Spans of Periodic Sequences....Pages 82-89
The Shortest Feedback Shift Register That Can Generate A Given Sequence....Pages 90-99
Perfect Local Randomness in Pseudo-random Sequences....Pages 100-112
Sparse Pseudorandom Distributions....Pages 113-127
Bit Commitment Using Pseudo-Randomness....Pages 128-136
How to Predict Congruential Generators....Pages 138-153
A Chosen Text Attack on The Modified Cryptographic Checksum Algorithm of Cohen and Huang....Pages 154-163
On the Linear Consistency Test (LCT) in Cryptanalysis with Applications....Pages 164-174
Batch RSA....Pages 175-185
On the Implementation of Elliptic Curve Cryptosystems....Pages 186-192
New Paradigms for Digital Signatures and Message Authentication Based on Non-Interactive Zero Knowledge Proofs....Pages 194-211
Undeniable Signatures....Pages 212-216
A Certified Digital Signature....Pages 218-238
Efficient Identification and Signatures for Smart Cards....Pages 239-252
A signature with shared verification scheme....Pages 253-262
On-Line/Off-Line Digital Signatures....Pages 263-275
On the Classification of Ideal Secret Sharing Schemes....Pages 278-285
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimensional Linear Space....Pages 286-298
Secret Sharing Over Infinite Domains....Pages 299-306
Threshold cryptosystems....Pages 307-315
Flexible Access Control with Master Keys....Pages 316-322
Key Distribution Protocol for Digital Mobile Communication Systems....Pages 324-334
A key exchange system based on real quadratic fields Extended abstract....Pages 335-343
On Key Distribution Systems....Pages 344-355
SDNS Architecture and End-to-end Encryption....Pages 356-366
A Survey of Hardware Implementations of RSA....Pages 368-370
Modular Exponentiation Using Recursive Sums of Residues....Pages 371-386
A Fast Modular-multiplication Algorithm based on a Higher Radix....Pages 387-399
Addition Chain Heuristics....Pages 400-407
How easy is collision search. New results and applications to DES....Pages 408-413
A Design Principle for Hash Functions....Pages 416-427
One Way Hash Functions and DES....Pages 428-446
Properties of Cryptosystem PGM....Pages 447-460
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses....Pages 461-480
Disposable Zero-Knowledge Authentications and Their Applications to Untraceable Electronic Cash....Pages 481-496
Efficient Identification Schemes Using Two Prover Interactive Proofs....Pages 498-506
On the concrete complexity of zero-knowledge proofs....Pages 507-525
Zero Knowledge Proofs of Knowledge in Two Rounds....Pages 526-544
Minimum Resource Zero-Knowledge Proofs....Pages 545-546
Non-Interactive Oblivious Transfer and Applications....Pages 547-557
Multiparty Protocols Tolerating Half Faulty Processors....Pages 560-572
Controlled Gradual Disclosure Schemes for Random Bits and Their Applications....Pages 573-588
Multiparty Computation with Faulty Majority....Pages 589-590
The Spymasters Double-Agent Problem....Pages 591-602
On the Structure of Secret Key Exchange Protocols....Pages 604-605
An Efficient Identification Scheme Based on Permuted Kernels (extended abstract)....Pages 606-609
An Efficient Software Protection Scheme....Pages 610-611
Good S-Boxes Are Easy To Find....Pages 612-615
Covert Distributed Processing with Computer Viruses....Pages 616-619
Progress in Data Security Standardisation....Pages 620-623
The FEAL-8 Cryptosystem and a Call for Attack....Pages 624-627
How to Explain Zero-Knowledge Protocols to Your Children....Pages 628-631
