Ebook: Advances in Cryptology — EUROCRYPT ’89: Workshop on the Theory and Application of Cryptographic Techniques Houthalen, Belgium, April 10–13, 1989 Proceedings

‘I’he int,ernational Association for Cryptologic Research (IACK) organizes two inter- tioilill coiifcrcnces every year, one in Europe and one in the United States. EUROCRI’PT ’89 was the seventh European conference and was held in Houthalen, Belgium on April 10-13, 1989. With close to 300 participants, it was perhaps the largest open conferencr on c:rypt,ogra.phy ever held. The field of cryptography is expanding not only because of the increased vulnerability of computer systems and networks to a11 increasing range of threats, but also because of t1ic ra.pid progress in cryptographic methods, that t,he readers can witness by reading the book. The present proceedings contain nearly all contributions which were presented including the talks at the rump session. The chapters correspond to the sessions at the conference. It wa5 the first time that a rump session was organized on a Eurocrypt conference. Sixteen impromptu talks were given, and the authors were invited to submit short abstracts of their presentations. Because of the special character of this session, the editors have taken the liberty to shorten some of these.

---

This volume contains the proceedings of the Eurocrypt '89 conference, a workshop on theory and applications of cryptographic techniques. The International Association for Cryptologic Research (IACR) organizes two conferences each year, one in Europe and one in the United States. Eurocrypt '89 was the seventh European conference. The volume includes revised versions of nearly all the contributions presented at the conference, including shortened versions of the talks given at the special rump session for recent results. Recent outbreaks of viruses, worms and computer fraud together with progress in telecommunications, computer networks and automated banking have considerably increased the interest in data security techniques, where cryptography is generaly considered to be the most important tool. In this area of data security, where high stakes are at risk, up-to-date information is crucial. This book is organized into sections on public-key cryptosystems, theory, zero-knowledge protocols, applications, signature and untraceability, cryptanalysis, sharing and authentication schemes, sequences, algorithms, old problems, and impromptu talks.

---

This volume contains the proceedings of the Eurocrypt '89 conference, a workshop on theory and applications of cryptographic techniques. The International Association for Cryptologic Research (IACR) organizes two conferences each year, one in Europe and one in the United States. Eurocrypt '89 was the seventh European conference. The volume includes revised versions of nearly all the contributions presented at the conference, including shortened versions of the talks given at the special rump session for recent results. Recent outbreaks of viruses, worms and computer fraud together with progress in telecommunications, computer networks and automated banking have considerably increased the interest in data security techniques, where cryptography is generaly considered to be the most important tool. In this area of data security, where high stakes are at risk, up-to-date information is crucial. This book is organized into sections on public-key cryptosystems, theory, zero-knowledge protocols, applications, signature and untraceability, cryptanalysis, sharing and authentication schemes, sequences, algorithms, old problems, and impromptu talks.
Content:
Front Matter....Pages I-X
The Adolescence of Public-Key Cryptography....Pages 2-2
A Secure Public-Key Authentication Scheme....Pages 3-15
How to improve signature schemes....Pages 16-22
A Generalization of El Gamal’s Public Key Cryptosystem....Pages 23-28
An Identity-Based Key-Exchange Protocol....Pages 29-37
How to Keep Authenticity Alive in a Computer Network....Pages 38-46
The Use of Fractions in Public-Key Cryptosystems....Pages 47-55
A Practical Protocol for Large Group Oriented Networks....Pages 56-61
Counting Functions Satisfying a Higher Order Strict Avalanche Criterion....Pages 63-74
A Key Distribution System Based On Any One-Way Function....Pages 75-79
Non-linearity of Exponent Permutations....Pages 80-92
Informational Divergence Bounds for Authentication Codes....Pages 93-101
2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms....Pages 102-109
A Simple Technique for Diffusing Cryptoperiods....Pages 110-120
A General Zero-Knowledge Scheme....Pages 122-133
Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility....Pages 134-149
Verifiable Disclosure of Secrets and Applications (Abstract)....Pages 150-154
Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies....Pages 155-172
An alternative to the Fiat-Shamir protocol....Pages 173-180
Sorting out zero-knowledge....Pages 181-191
Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds....Pages 192-195
Zero-Knowledge Proofs of Computational Power....Pages 196-207
A Single Chip 1024 Bits RSA Processor....Pages 208-217
Cryptel - The Practical Protection of an Existing Electronic Mail System....Pages 219-236
Technical Security: The Starting Point....Pages 237-242
Security in Open Distributed Processing....Pages 243-248
A European Call for Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation....Pages 249-266
Legal Requirements Facing New Signature Technology....Pages 267-271
Online Cash Checks....Pages 273-287
Efficient Offline Electronic Checks....Pages 288-293
Unconditional Sender and Recipient Untraceability in Spite of Active Attacks....Pages 294-301
Detection of Disrupters in the DC Protocol....Pages 302-319
Random Mapping Statistics....Pages 320-327
Factoring by electronic mail....Pages 329-354
Cryptanalysis of Short RSA Secret Exponents....Pages 355-371
How to Break the Direct RSA-Implementation of Mixes....Pages 372-372
An Information-Theoretic Treatment of Homophonic Substitution....Pages 373-381
Cryptanalysis of a Modified Rotor Machine....Pages 382-394
Cryptanalysis of Video Encryption Based on Space-Filling Curves....Pages 395-402
Impossibility and Optimality Results on Constructing Pseudorandom Permutations....Pages 403-411
On the Security of Schnorr’s Pseudo Random Generator....Pages 412-422
How easy is collision search? Application to DES....Pages 423-428
Prepositioned Shared Secret and/or Shared Control Schemes....Pages 429-434
Some Ideal Secret Sharing Schemes....Pages 436-467
Cartesian Authentication Schemes....Pages 468-475
How to Say “No”....Pages 476-490
Key Minimal Authentication Systems for Unconditional Secrecy....Pages 491-496
Parallel Generation of Recurring Sequences....Pages 497-501
Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point....Pages 503-522
On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can’t be Random....Pages 523-532
Feedforward Functions Defined by de Bruijn Sequences....Pages 533-543
Nonlinearity Criteria for Cryptographic Functions....Pages 544-548
On the Linear Complexity of Feedback Registers....Pages 549-562
Linear Complexity Profiles and Continued Fractions....Pages 563-570
A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences....Pages 571-585
On the Complexity and Efficiency of a New Key Exchange System....Pages 586-595
A New Multiple Key Cipher and an Improved Voting Scheme....Pages 597-616
Atkin’s Test: News from the Front....Pages 617-625
Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity....Pages 626-635
Deciphering Bronze Age Scripts of Crete The Case of Linear A....Pages 636-647
Faster Primality Testing....Pages 649-650
Private-Key Algebraic-Code Cryptosystems with High Information Rates....Pages 652-656
Zero-knowledge procedures for confidential access to medical records....Pages 657-661
Full Secure Key Exchange and Authentication with no Previously Shared Secrets....Pages 662-664
Varying Feedback Shift Registers....Pages 665-669
A Cryptanalysis of Stepk,m-Cascades....Pages 670-679
Efficient Identification and Signatures for Smart Cards....Pages 680-687
The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability....Pages 688-689
Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences....Pages 690-690
On the Design of Permutation P in des Type Cryptosystems....Pages 691-695
A Fast Elliptic Curve Cryptosystem....Pages 696-705
Back Matter....Pages 706-708
....Pages 709-710