Last update:
Sat Jul 29 16:37:40 MDT 2017
Whitfield Diffie The Adolescence of Public-Key
Cryptography (Invited) . . . . . . . . . 2
Zvi Galil and
Stuart Haber and
Moti Yung A Secure Public-Key Authentication
Scheme . . . . . . . . . . . . . . . . . 3
Gilles Brassard How to Improve Signature Schemes . . . . 16
W. J. Jaburek A Generalization of El Gamal's Public
Key Cryptosystem . . . . . . . . . . . . 23
Christoph G. Günther An Identity-Based Key-Exchange Protocol 29
Fritz Bauspieß and
Hans-Joachim Knobloch How to Keep Authenticity Alive in a
Computer Network . . . . . . . . . . . . 38
Hartmut Isselhorst The Use of Fractions in Public-Key
Cryptosystems . . . . . . . . . . . . . 47
Yair Frankel A Practical Protocol for Large Group
Oriented Networks . . . . . . . . . . . 56
Sheelagh Lloyd Counting Functions Satisfying a Higher
Order Strict Avalanche Criterion . . . . 63
George I. Davida and
Yvo Desmedt and
René Peralta A Key Distribution System Based on Any
One-Way Function (Extended Abstract) . . 75
Józef P. Pieprzyk Non-linearity of Exponent Permutations 80
Andrea Sgarro Informational Divergence Bounds for
Authentication Codes . . . . . . . . . . 93
Jean-Jacques Quisquater and
Marc Girault $ 2 n $-Bit Hash-Functions Using $n$-Bit
Symmetric Block Cipher Algorithms . . . 102
Stig F. Mjòlsnes A Simple Technique for Diffusing
Cryptoperiods . . . . . . . . . . . . . 110
Mike V. D. Burmester and
Yvo Desmedt and
Fred Piper and
Michael Walker A General Zero-Knowledge Scheme . . . . 122
Tatsuaki Okamoto and
Kazuo Ohta Divertible Zero Knowledge Interactive
Proofs and Commutative Random
Self-Reducibility . . . . . . . . . . . 134
Claude Crépeau Verifiable Disclose for Secrets and
Applications (Abstract) . . . . . . . . 150
Joan Boyar and
Katalin Friedl and
Carsten Lund Practical Zero-Knowledge Proofs: Giving
Hints and Using Deficiencies . . . . . . 155
Jacques Stern An Alternative to the Fiat--Shamir
Protocol . . . . . . . . . . . . . . . . 173
Gilles Brassard and
Claude Crépeau Sorting Out Zero-Knowledge . . . . . . . 181
Gilles Brassard and
Claude Crépeau and
Moti Yung Everything in NP Can Be Argued in \em
Perfect Zero-Knowledge in a \em Bounded
Number of Rounds (Extended Abstract) . . 192
Moti Yung Zero-Knowledge Proofs of Computational
Power (Extended Summary) . . . . . . . . 196
Bert den Boer More Efficient Match-Making and
Satisfiability: \em The Five Card Trick 208
André Vandemeulebroecke and
Etienne Vanzieleghem and
Tony Denayer and
Paul G. A. Jespers A Single Chip 1024 Bits RSA Processor 219
Hedwig Cnudde Cryptel --- The Practical Protection of
an Existing Electronic Mail System . . . 237
Jan Van Auseloos Technical Security: The Starting Point 243
Charles Siuda Security in Open Distributed Processing 249
Joos Vandewalle and
David Chaum and
Walter Fumy and
Cees J. A. Jansen and
Peter Landrock and
G. Roelofsen A European Call for Cryptographic
Algorithms: RIPE: Race Integrity
Primitives Evaluation . . . . . . . . . 267
Mireille Antoine and
Jean-François Brakeland and
Marc Eloy and
Yves Poullet Legal Requirements Facing New Signature
Technology (Invited) . . . . . . . . . . 273
David Chaum Online Cash Checks . . . . . . . . . . . 288
David Chaum and
Bert den Boer and
Eug\`ene van Heyst and
Stig F. Mjòlsnes and
Adri Steenbeek Efficient Offline Electronic Checks
(Extended Abstract) . . . . . . . . . . 294
Michael Waidner Unconditional Sender and Recipient
Untraceability in spite of Active
Attacks . . . . . . . . . . . . . . . . 302
Jurjen N. E. Bos and
Bert den Boer Detection of Disrupters in the DC
Protocol . . . . . . . . . . . . . . . . 320
Philippe Flajolet and
Andrew M. Odlyzko Random Mapping Statistics (Invited) . . 329--354
Arjen K. Lenstra and
Mark S. Manasse Factoring by Electronic Mail . . . . . . 355
Michael J. Wiener Cryptanalysis of Short RSA Secret
Exponents (Abstract) . . . . . . . . . . 372
Birgit Pfitzmann and
Andreas Pfitzmann How to Break the Direct
RSA-Implementation of MIXes . . . . . . 373
Hakon N. Jendal and
Yves J. B. Kuhn and
James L. Massey An Information-Theoretic Treatment of
Homophonic Substitution . . . . . . . . 382
Peer Wichmann Cryptanalysis of a Modified Rotor
Machine . . . . . . . . . . . . . . . . 395
Michael Bertilsson and
Ernest F. Brickell and
Ingemar Ingemarsson Cryptanalysis of Video Encryption Based
on Space-Filling Curves . . . . . . . . 403
Yuliang Zheng and
Tsutomu Matsumoto and
Hideki Imai Impossibility and Optimally Results on
Constructing Pseudorandom Permutations
(Extended Abstract) . . . . . . . . . . 412
Rainer A. Rueppel On the Security of Schnorr's Pseudo
Random Generator . . . . . . . . . . . . 423
Jean-Jacques Quisquater and
Jean-Paul Delescaille How Easy is Collision Search?
Application to DES (Extended Summary) 429
Gustavus J. Simmons Prepositioned Shared Secret and/or
Shared Control Schemes (Invited) . . . . 436
Ernest F. Brickell Some Ideal Secret Sharing Schemes . . . 468
Marijke De Soete and
Klaus Vedder and
Michael Walker Cartesian Authentication Schemes . . . . 476
Albrecht Beutelspacher How to Say ``No'' . . . . . . . . . . . 491
Philippe Godlewski and
Chris Mitchell Key Minimal Authentication Systems for
Unconditional Secrecy . . . . . . . . . 497
Christoph G. Günther Parallel Generation of Recurring
Sequences . . . . . . . . . . . . . . . 503
Harald Niederreiter Keystream Sequences with a Good Linear
Complexity Profile for Every Starting
Point . . . . . . . . . . . . . . . . . 523
Thomas Beth and
Zong-Duo Dai On the Complexity of Pseudo-random
Sequences --- or: If You Can Describe a
Sequence It Can't Be Random . . . . . . 533
Zong-Duo Dai and
Kencheng Zeng Feedforward Functions Defined by de
Brujin Sequences . . . . . . . . . . . . 544
Willi Meier and
Othmar Staffelbach Nonlinearity Criteria for Cryptographic
Functions . . . . . . . . . . . . . . . 549
Agnes Hui Chan and
Mark Goresky and
Andrew Klapper On the Linear Complexity of Feedback
Registers (Extended Abstract) . . . . . 563
Muzhong Wang Linear Complexity Profiles and Continued
Fractions . . . . . . . . . . . . . . . 571
Réjane Forré A Fast Correlation Attack on Nonlinearly
Feed-Forward Filtered Shift-Register
Sequences . . . . . . . . . . . . . . . 586
Johannes A. Buchmann and
Stephen Düllmann and
Hugh C. Williams On the Complexity and Efficiency of a
New Key Exchange System . . . . . . . . 597
Colin Boyd A New Multiple Key Cipher and an
Improved Voting Scheme . . . . . . . . . 617
François Morain Atkin's Test: News from the Front . . . 626
Ueli M. Maurer Fast Generation of Secure RSA-Moduli
with Almost Maximal Diversity . . . . . 636
Yves Duhoux Deciphering Bronze Age Scripts of Crete
--- The Case of Linear A (Invited) . . . 649--650
Wieb Bosma and
Marc Paul van der Hulst Faster Primality Testing (Extended
Abstract) . . . . . . . . . . . . . . . 652
Tzonelih Hwang and
T. R. N. Rao Private-Key Algebraic-Code Cryptosystems
with High Information Rates . . . . . . 657
Jean-Jacques Quisquater and
André Bouckaert Zero-Knowledge Procedures for
Confidential Access to Medical Records
(Extended Summary) . . . . . . . . . . . 662
Josep Domingo i Ferrer and
Llorenç Huguet i Rotger Full Secure Key Exchange and
Authentication with No Previously Shared
Secrets . . . . . . . . . . . . . . . . 665
Yves Roggeman Varying Feedback Shift Registers . . . . 670
Dieter Gollmann and
William G. Chambers A Cryptanalysis of $ \mbox {Step}_{k, m}
$-Cascades . . . . . . . . . . . . . . . 680
Claus P. Schnorr Efficient Identification and Signatures
for Smart Cards (Abstract) . . . . . . . 688
Michael Waidner and
Birgit Pfitzmann The Dining Cryptographers in the Disco:
Unconditional Sender and Recipient
Untraceability with Computationally
Secure Serviceability (Abstract) . . . . 690
Glyn Carter Some Conditions on the Linear Complexity
Profiles of Certain Binary Sequences . . 691
Lawrence Brown and
Jennifer Seberry On the Design of Permutation $ {P} $ in
DES Type Cryptosystems . . . . . . . . . 696
Gordon B. Agnew and
R. C. Mullin and
Scott A. Vanstone A Fast Elliptic Curve Cryptosystem . . . 706
Anonymous Author Index . . . . . . . . . . . . . . 709
David Kahn Keying the German Navy's Enigma
(Invited) . . . . . . . . . . . . . . . 2
Yvo Desmedt Making Conditionally Secure
Cryptosystems Unconditionally Abuse-Free
in a General Context (Extended Abstract) 6
Ivan Bjerre Damgård On the Existence of Bit Commitment
Schemes and Zero-Knowledge Proofs . . . 17
Russell L. Brand Problems with the Normal Use of
Cryptography for Providing Security on
Unclassified Networks (Invited) . . . . 30
John T. Kohl The Use of Encryption in Kerberos for
Network Authentication (Invited) . . . . 35
David C. Feldmeier and
Philip R. Karn UNIX Password Security --- Ten Years
Later (Invited) . . . . . . . . . . . . 44
Jonathan M. Smith Practical Problems with a Cryptographic
Protection Scheme (Invited) . . . . . . 64
Paul Barrett and
Raymund Eisele The Smart Diskette --- A Universal User
Token and Personal Crypto-Engine
(Invited) . . . . . . . . . . . . . . . 74
Agnes Hui Chan and
Richard A. Games On the Quadratic Spans of Periodic
Sequences . . . . . . . . . . . . . . . 82
Cees J. A. Jansen and
Dick E. Boekee The Shortest Feedback Shift Register
that Can Generate a Given Sequence . . . 90
Ueli M. Maurer and
James L. Massey Perfect Local Randomness in
Pseudo-random Sequences . . . . . . . . 100
Oded Goldreich and
Hugo Krawczyk Sparse Pseudorandom Distributions
(Extended Abstract) . . . . . . . . . . 113
Moni Naor Bit Commitment Using Pseudo-randomness
(Extended Abstract) . . . . . . . . . . 128
Hugo Krawczyk How to Predict Congruential Generators 138--153
Bart Preneel and
Antoon Bosselaers and
René Govaerts and
Joos Vandewalle A Chosen Text Attack on the Modified
Cryptographic Checksum Algorithm of
Cohen and Huang . . . . . . . . . . . . 154
Kencheng Zeng and
C. H. Yang and
T. R. N. Rao On the Linear Consistency Test (LCT) in
Cryptanalysis with Applications . . . . 164
Amos Fiat Batch RSA . . . . . . . . . . . . . . . 175
Andreas Bender and
Guy Castagnoli On the Implementation of Elliptic Curve
Cryptosystems . . . . . . . . . . . . . 186
Mihir Bellare and
Shafi Goldwasser New Paradigms for Digital Signatures and
Message Authentication Based on
Non-interactive Zero Knowledge Proofs 194
David Chaum and
Hans van Antwerpen Undeniable Signatures . . . . . . . . . 212
Ralph C. Merkle A Certified Digital Signature (Subtitle:
That Antique Paper from 1979) . . . . . 218
Claus P. Schnorr Efficient Identification and Signatures
for Smart Cards . . . . . . . . . . . . 239
Marijke De Soete and
Jean-Jacques Quisquater and
Klaus Vedder A Signature with Shared Verification
Scheme . . . . . . . . . . . . . . . . . 253
Shimon Even and
Oded Goldreich and
Silvio Micali On-Line/Off-Line Digital Signatures . . 263
Ernest F. Brickell and
Daniel M. Davenport On the Classification of Ideal Secret
Sharing Schemes (Extended Abstract) . . 278
Chi-Sung Laih and
Lein Harn and
Jau-Yien Lee and
Tzonelih Hwang Dynamic Threshold Scheme Based on the
Definition of Cross-Product in an
$N$-Dimensional Linear Space . . . . . . 286
Benny Chor and
Eyal Kushilevitz Secret Sharing over Infinite Domains
(Extended Abstract) . . . . . . . . . . 299
Yvo Desmedt and
Yair Frankel Threshold Cryptosystems . . . . . . . . 307
Gerald C. Chick and
Stafford E. Tavares Flexible Access Control with Master Keys 316
Makoto Tatebayashi and
Natsume Matsuzaki and
David B. Newman, Jr. Key Distribution Protocol for Digital
Mobile Communication Systems . . . . . . 324
Johannes A. Buchmann and
Hugh C. Williams A Key Exchange System Based on Real
Quadratic Fields (Extended Abstract) . . 335
Yacov Yacobi and
Zahava Shmuely On Key Distribution Systems . . . . . . 344
Ruth Nelson and
John Heimann SDNS Architecture and End-to-End
Encryption . . . . . . . . . . . . . . . 356
Ernest F. Brickell A Survey of Hardware Implementations of
RSA (Invited), (Abstract) . . . . . . . 368
Paul A. Findlay and
Brian A. Johnson Modular Exponentiation Using Recursive
Sums of Residues . . . . . . . . . . . . 371
Hikaru Morita A Fast Modular-Multiplication Algorithm
Based on a Higher Radix . . . . . . . . 387
Jurjen N. E. Bos and
Matthijs J. Coster Addition Chain Heuristics . . . . . . . 400
Jean-Jacques Quisquater and
Jean-Paul Delescaille How Easy Is Collision Search. New
Results and Applications to DES
(Abstract and Results) . . . . . . . . . 408
Ivan Bjerre Damgård A Design Principle for Hash Functions 416
Ralph C. Merkle One Way Hash Functions and DES . . . . . 428
Spyros S. Magliveras and
Nasir D. Memon Properties of Cryptosystem PGM . . . . . 447
Yuliang Zheng and
Tsutomu Matsumoto and
Hideki Imai On the Construction of Block Ciphers
Provably Secure and Not Relying on Any
Unproved Hypotheses (Extended Abstract) 461
Tatsuaki Okamoto and
Kazuo Ohta Disposable Zero-Knowledge
Authentications and Their Applications
to Untraceable Electronic Cash . . . . . 481
Michael Ben-Or and
Shafi Goldwasser and
Joe Kilian and
Avi Wigderson Efficient Identification Schemes Using
Two Prover Interactive Proofs . . . . . 498
Joan Boyar and
René Peralta On the Concrete Complexity of
Zero-Knowledge Proofs . . . . . . . . . 507
Uriel Feige and
Adi Shamir Zero Knowledge Proofs of Knowledge in
Two Rounds . . . . . . . . . . . . . . . 526
Joe Kilian and
Silvio Micali and
Rafail Ostrovsky Minimum Resource Zero-Knowledge Proofs
(Extended Abstract) . . . . . . . . . . 545
Mihir Bellare and
Silvio Micali Non-interactive Oblivious Transfer and
Applications . . . . . . . . . . . . . . 547
Donald Beaver Multiparty Protocols Tolerating Half
Faulty Processors . . . . . . . . . . . 560
Richard Cleve Controlled Gradual Disclosure Schemes
for Random Bits and Their Applications 573
Donald Beaver and
Shafi Goldwasser Multiparty Computation with Faulty
Majority . . . . . . . . . . . . . . . . 589
David Chaum The Spymasters Double-Agent Problem:
Multiparty Computations Secure
Unconditionally from Minorities and
Cryptographically from Majorities . . . 591
Mihir Bellare and
Lenore Cowen and
Shafi Goldwasser On the Structure of Secret Key Exchange
Protocols . . . . . . . . . . . . . . . 604
Adi Shamir An Efficient Identification Scheme Based
on Permuted Kernels (Extended Abstract) 606
Rafail Ostrovsky An Efficient Software Protection Scheme
(Abstract) . . . . . . . . . . . . . . . 610
Carlisle M. Adams and
Stafford E. Tavares Good S-Boxes Are Easy to Find . . . . . 612
Steve R. White Convert Distributed Processing with
Computer Viruses . . . . . . . . . . . . 616
Wyn L. Price Progress in Data Security
Standardisation . . . . . . . . . . . . 620
Shoji Miyaguchi The FEAL- 8 Cryptosystem and a Call for
Attack . . . . . . . . . . . . . . . . . 624
Jean-Jacques Quisquater and
Louis C. Guillou and
Thomas A. Berson How to Explain Zero-Knowledge Protocols
to Your Children . . . . . . . . . . . . 628
Anonymous Author Index . . . . . . . . . . . . . . 633