International Association for Cryptologic Research

Publications by Conference

Advances in Cryptology - EUROCRYPT '89, Workshop on the Theory and Application of of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, Proceedings

Page	Title
2	The Adolescence of Public-Key Cryptography (Abstract)
3-15	A Secure Public-key Authentication Scheme
16-22	How to Improve Signature Schemes
23-28	A Generalization of El Gamal's Public Key Cryptosystem
29-37	An Identity-Based Key-Exchange Protocol
38-46	How to Keep Authenticity Alive in a Computer Network
47-55	The Use of Fractions in Public-Key Cryptosystems
56-61	A Practical Protocol for Large Group Oriented Networks
63-74	Counting Functions Satisfying a Higher Order Strict Avalanche Criterion
75-79	A Key Distribution System Based On Any One-Way Function (Extended Abstract)
80-92	Non-linearity of Exponent Permutations
93-101	Informational Divergence Bounds for Authentication Codes
102-109	2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms
110-120	A Simple Technique for Diffusing Cryptoperiods
122-133	A General Zero-Knowledge Scheme (Extended Abstract)
134-148	Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
150-154	Verifiable Disclosure of Secrets and Applications (Abstract)
155-172	Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
173-180	An Alternative to the Fiat-Shamir Protocol
181-191	Sorting out Zero-Knowledge
192-195	Everything in NP can be Argued in Perfect Zero-Knowledge in a Bounded Number of Rounds (Extended Abstract)
196-207	Zero-Knowledge Proofs of Computational Power (Extended Summary)
208-217	More Efficient Match-Making and Satisfiability: The Five Card Trick
219-236	A Single Chip 1024 Bits RSA Processor
237-242	Cryptel - The Practical Protection of an Existing Electronic Mail System
243-248	Technical Security: The Starting Point
249-266	Security in Open Distributed Processing
267-271	A European Call For Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation
273-287	Legal Requirements Facing New Signature Technology
288-293	Online Cash Checks
294-301	Efficient Offline Electronic Checks (Extended Abstract)
302-319	Unconditional Sender and Recipient Untraceability in Spite of Active Attacks
320-327	Detection of Disrupters in the DC Protocol
329-354	Random Mapping Statistics
355-371	Factoring by Electronic Mail
372	Cryptanalysis of Short RSA Secret Exponents (Abstract)
373-381	How to Break the Direct RSA-Implementation of Mixes
382-394	An Information-Theoretic Treatment of Homophonic Substitution
395-402	Cryptanalysis of a Modified Rotor Machine
403-411	Cryptanalysis of Video Encryption Based on Space-Filling Curves
412-422	Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract)
423-428	On the Security of Schnorr's Pseudo Random Generator
429-434	How Easy is Collision Search? Application to DES (Extended Summary)
436-467	Prepositioned Shared Secret and/or Shared Control Schemes
468-475	Some Ideal Secret Sharing Schemes
476-490	Cartesian Authentication Schemes
491-496	How to Say ``No''
497-501	Key Minimal Authentication Systems for Unconditional Secrecy
503-522	Parallel Generation of Recurring Sequences
523-532	Keysystem Sequences with a Good Linear Complexity Profile for Every STrating Point
533-543	On the Complexity of Pseudo-Random Sequences - Or: If You Can Describe a Sequence It Can't be Random
544-548	Feedforward Functions Defined By de Bruijn Sequences
549-562	Nonlinearity Criteria for Cryptographic Functions
563-570	On the Linear Complexity of Feedback Registers (Extended Abstract)
571-585	Linear Complexity Profiles and Continued Fractions
586-595	A Fats Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences
597-616	On the Complexity and Efficiency of a New Key Exchange System
617-625	A New Multiple Key Cipher and an Improved Voting Scheme
626-635	Atkin's Test: News From the Front
636-647	Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
649-650	Deciphering Bronze Age Scripts of Crete - The Case of Linear A
652-656	Faster Primality Testing (Extended Abstract)
657-661	Private-Key Algebraic-Code Cryptosystems with High Information Rates (Extended Abstract)
662-664	Zero-Knowledge Procedures for Confidential Access to Medical Records (Extended Summary)
665-669	Full Secure Key Exchange and Authentication with no Previously Shared Secrets
670-679	Varying Feedback Shift Registers
680-687	A Cryptanalysis of Step_{k, m}-Cascades
688-689	Efficient Identification and Signatures for Smart Cards (Abstract)
690	The Dining Cryptographers in the Disco - Underconditional Sender and Recipient Untraceability with Computationally Secure Serviceability (Abstract)
691-695	Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences
696-705	On the Design of Permutation P in DES Type Cryptosystems
706-708	A Fast Elliptic Curve Cryptosystem