Table of Contents

• The Adolescence of Public-Key Cryptography (Abstract)Whitfield Diffie. 2 [doi]
• A Secure Public-key Authentication SchemeZvi Galil, Stuart Haber, Moti Yung. 3-15 [doi]
• How to Improve Signature SchemesGilles Brassard. 16-22 [doi]
• An Identity-Based Key-Exchange ProtocolChristoph G. Günther. 29-37 [doi]
• How to Keep Authenticity Alive in a Computer NetworkFritz Bauspieß, Hans-Joachim Knobloch. 38-46 [doi]
• The Use of Fractions in Public-Key CryptosystemsHartmut Isselhorst. 47-55 [doi]
• A Practical Protocol for Large Group Oriented NetworksYair Frankel. 56-61 [doi]
• Counting Functions Satisfying a Higher Order Strict Avalanche CriterionSheelagh Lloyd. 63-74 [doi]
• A Key Distribution System Based On Any One-Way Function (Extended Abstract)George I. Davida, Yvo Desmedt, René Peralta. 75-79 [doi]
• Non-linearity of Exponent PermutationsJosef Pieprzyk. 80-92 [doi]
• Informational Divergence Bounds for Authentication CodesAndrea Sgarro. 93-101 [doi]
• 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher AlgorithmsJean-Jacques Quisquater, Marc Girault. 102-109 [doi]
• A Simple Technique for Diffusing CryptoperiodsStig Fr. Mjølsnes. 110-120 [doi]
• A General Zero-Knowledge Scheme (Extended Abstract)Mike Burmester, Yvo Desmedt, Fred Piper, Michael Walker. 122-133 [doi]
• Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-ReducibilityTatsuaki Okamoto, Kazuo Ohta. 134-148 [doi]
• Verifiable Disclosure of Secrets and Applications (Abstract)Claude Crépeau. 150-154 [doi]
• Practical Zero-Knowledge Proofs: Giving Hints and Using DeficienciesJoan Boyar, Katalin Friedl, Carsten Lund. 155-172 [doi]
• An Alternative to the Fiat-Shamir ProtocolJacques Stern. 173-180 [doi]
• Sorting out Zero-KnowledgeGilles Brassard, Claude Crépeau. 181-191 [doi]
• Everything in NP can be Argued in ::::Perfect:::: Zero-Knowledge in a ::::Bounded:::: Number of Rounds (Extended Abstract)Gilles Brassard, Claude Crépeau, Moti Yung. 192-195 [doi]
• Zero-Knowledge Proofs of Computational Power (Extended Summary)Moti Yung. 196-207 [doi]
• More Efficient Match-Making and Satisfiability: ::::The Five Card Trick::::Bert den Boer. 208-217 [doi]
• A Single Chip 1024 Bits RSA ProcessorAndré Vandermeulebroecke, Etienne Vanzieleghem, Tony Denayer, Paul G. A. Jespers. 219-236 [doi]
• A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives EvaluationJoos Vandewalle, David Chaum, Walter Fumy, Cees J. A. Jansen, Peter Landrock, Gert Roelofsen. 267-271 [doi]
• Online Cash ChecksDavid Chaum. 288-293 [doi]
• Efficient Offline Electronic Checks (Extended Abstract)David Chaum, Bert den Boer, Eugène van Heyst, Stig Fr. Mjølsnes, Adri Steenbeek. 294-301 [doi]
• Unconditional Sender and Recipient Untraceability in Spite of Active AttacksMichael Waidner. 302-319 [doi]
• Detection of Disrupters in the DC ProtocolJurjen N. Bos, Bert den Boer. 320-327 [doi]
• Random Mapping StatisticsPhilippe Flajolet, Andrew M. Odlyzko. 329-354 [doi]
• Factoring by Electronic MailArjen K. Lenstra, Mark S. Manasse. 355-371 [doi]
• Cryptanalysis of Short RSA Secret Exponents (Abstract)Michael J. Wiener. 372 [doi]
• How to Break the Direct RSA-Implementation of MixesBirgit Pfitzmann, Andreas Pfitzmann. 373-381 [doi]
• An Information-Theoretic Treatment of Homophonic SubstitutionHakon N. Jendal, Yves J. B. Kuhn, James L. Massey. 382-394 [doi]
• Cryptanalysis of a Modified Rotor MachinePeer Wichmann. 395-402 [doi]
• Cryptanalysis of Video Encryption Based on Space-Filling CurvesMichael Bertilsson, Ernest F. Brickell, Ingemar Ingemarsson. 403-411 [doi]
• Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract)Yuliang Zheng, Tsutomu Matsumoto, Hideki Imai. 412-422 [doi]
• How Easy is Collision Search? Application to DES (Extended Summary)Jean-Jacques Quisquater, Jean-Paul Delescaille. 429-434 [doi]
• Some Ideal Secret Sharing SchemesErnest F. Brickell. 468-475 [doi]
• Cartesian Authentication SchemesMarijke De Soete, Klaus Vedder, Michael Walker. 476-490 [doi]
• How to Say No Albrecht Beutelspacher. 491-496 [doi]
• Key Minimal Authentication Systems for Unconditional SecrecyPhilippe Godlewski, Chris J. Mitchell. 497-501 [doi]
• Parallel Generation of Recurring SequencesChristoph G. Günther. 503-522 [doi]
• Keysystem Sequences with a Good Linear Complexity Profile for Every STrating PointHarald Niederreiter. 523-532 [doi]
• On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can t be RandomThomas Beth, Zong-Duo Dai. 533-543 [doi]
• Feedforward Functions Defined By de Bruijn SequencesZong-Duo Dai, Kencheng Zeng. 544-548 [doi]
• Nonlinearity Criteria for Cryptographic FunctionsWilli Meier, Othmar Staffelbach. 549-562 [doi]
• Linear Complexity Profiles and Continued FractionsMuzhong Wang. 571-585 [doi]
• On the Complexity and Efficiency of a New Key Exchange SystemJohannes Buchmann, Stephan Düllmann, Hugh C. Williams. 597-616 [doi]
• A New Multiple Key Cipher and an Improved Voting SchemeColin Boyd. 617-625 [doi]
• Atkin s Test: News From the FrontFrançois Morain. 626-635 [doi]
• Fast Generation of Secure RSA-Moduli with Almost Maximal DiversityUeli M. Maurer. 636-647 [doi]
• Faster Primality Testing (Extended Abstract)Wieb Bosma, Marc-Paul van der Hulst. 652-656 [doi]
• Private-Key Algebraic-Code Cryptosystems with High Information Rates (Extended Abstract)Tzonelih Hwang, T. R. N. Rao. 657-661 [doi]
• Zero-Knowledge Procedures for Confidential Access to Medical Records (Extended Summary)Jean-Jacques Quisquater, André Bouckaert. 662-664 [doi]
• Full Secure Key Exchange and Authentication with no Previously Shared SecretsJosep Domingo-Ferrer, Llorenç Huguet i Rotger. 665-669 [doi]
• A Cryptanalysis of Step::::::k, m::::::-CascadesDieter Gollmann, William G. Chambers. 680-687 [doi]
• Efficient Identification and Signatures for Smart Cards (Abstract)Claus-Peter Schnorr. 688-689 [doi]
• The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract)Michael Waidner, Birgit Pfitzmann. 690 [doi]
• On the Design of Permutation P in DES Type CryptosystemsLawrence Brown, Jennifer Seberry. 696-705 [doi]
• A Fast Elliptic Curve CryptosystemGordon B. Agnew, Ronald C. Mullin, Scott A. Vanstone. 706-708 [doi]