Advances in cryptology - EUROCRYPT 89 : [7th] 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...
Uloženo v:
| Korporativní autor: | |
|---|---|
| Další autoři: | , |
| Médium: | Livre numérique |
| Jazyk: | Anglais |
| Vydáno: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Edice: | Lecture notes in computer science
434 |
| Témata: | |
| On-line přístup: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Poznámka: |
Archives Springer e-books (Licence nationale) Archives Springer e-books (Licence nationale) |
| Autres localisations: | Voir dans le Sudoc |
| Edition sous un autre format: | • Advances in cryptology, EUROCRYPT '89, Workshop on the Theory and Application of Cryptographic Techniques, Houthalen, Belgium, April 10-13, 1989, proceedings, J.-J. Quisquater, J. Vandewalle, eds, 1990, Berlin, Springer, 1 vol. (X-710 p.), Lecture notes in computer science, 3-540-53433-4 • Advances in Cryptology EUROCRYPT '89, Texte imprimé, 9783662182161 |
Obsah:
- Public-key cryptosystems
- The Adolescence of Public-Key Cryptography
- A Secure Public-Key Authentication Scheme
- How to improve signature schemes
- A Generalization of El Gamal s Public Key Cryptosystem
- An Identity-Based Key-Exchange Protocol
- How to Keep Authenticity Alive in a Computer Network
- The Use of Fractions in Public-Key Cryptosystems
- A Practical Protocol for Large Group Oriented Networks
- Theory
- Counting Functions Satisfying a Higher Order Strict Avalanche Criterion
- A Key Distribution System Based On Any One-Way Function
- Non-linearity of Exponent Permutations
- Informational Divergence Bounds for Authentication Codes
- 2n-Bit Hash-Functions Using n-Bit Symmetric Block Cipher Algorithms
- A Simple Technique for Diffusing Cryptoperiods
- Zero-knowledge protocols
- A General Zero-Knowledge Scheme
- Divertible Zero Knowledge Interactive Proofs and Commutative Random Self-Reducibility
- Verifiable Disclosure of Secrets and Applications (Abstract)
- Practical Zero-Knowledge Proofs: Giving Hints and Using Deficiencies
- An alternative to the Fiat-Shamir protocol
- Sorting out zero-knowledge
- Everything in NP can be argued in perfect zero-knowledge in a bounded number of rounds
- Zero-Knowledge Proofs of Computational Power
- More Efficient Match-Making and Satisfiability The Five Card Trick
- Applications
- A Single Chip 1024 Bits RSA Processor
- Cryptel - The Practical Protection of an Existing Electronic Mail System
- Technical Security: The Starting Point
- Security in Open Distributed Processing
- A European Call for Cryptographic Algorithms: Ripe; Race Integrity Primitives Evaluation
- Signature and untraceability
- Legal Requirements Facing New Signature Technology
- Online Cash Checks
- Efficient Offline Electronic Checks
- Unconditional Sender and Recipient Untraceability in Spite of Active Attacks
- Detection of Disrupters in the DC Protocol
- Cryptanalysis
- Random Mapping Statistics
- Factoring by electronic mail
- Cryptanalysis of Short RSA Secret Exponents
- How to Break the Direct RSA-Implementation of Mixes
- An Information-Theoretic Treatment of Homophonic Substitution
- Cryptanalysis of a Modified Rotor Machine
- Cryptanalysis of Video Encryption Based on Space-Filling Curves
- Impossibility and Optimality Results on Constructing Pseudorandom Permutations
- On the Security of Schnorr s Pseudo Random Generator
- How easy is collision search? Application to DES
- Sharing and authentication schemes
- Prepositioned Shared Secret and/or Shared Control Schemes
- Some Ideal Secret Sharing Schemes
- Cartesian Authentication Schemes
- How to Say No
- Key Minimal Authentication Systems for Unconditional Secrecy
- Sequences
- Parallel Generation of Recurring Sequences
- Keystream Sequences with a Good Linear Complexity Profile for Every Starting Point
- On the Complexity of Pseudo-Random Sequences - or: If You Can Describe a Sequence It Can t be Random
- Feedforward Functions Defined by de Bruijn Sequences
- Nonlinearity Criteria for Cryptographic Functions
- On the Linear Complexity of Feedback Registers
- Linear Complexity Profiles and Continued Fractions
- A Fast Correlation Attack on Nonlinearly Feedforward Filtered Shift-Register Sequences
- Algorithms
- On the Complexity and Efficiency of a New Key Exchange System
- A New Multiple Key Cipher and an Improved Voting Scheme
- Atkin s Test: News from the Front
- Fast Generation of Secure RSA-Moduli with Almost Maximal Diversity
- Old problems
- Deciphering Bronze Age Scripts of Crete The Case of Linear A
- Rump Session (impromptu talks)
- Faster Primality Testing
- Private-Key Algebraic-Code Cryptosystems with High Information Rates
- Zero-knowledge procedures for confidential access to medical records
- Full Secure Key Exchange and Authentication with no Previously Shared Secrets
- Varying Feedback Shift Registers
- A Cryptanalysis of Stepk,m-Cascades
- Efficient Identification and Signatures for Smart Cards
- The Dining Cryptographers in the Disco: Unconditional Sender and Recipient Untraceability with Computationally Secure Serviceability
- Some Conditions on the Linear Complexity Profiles of Certain Binary Sequences
- On the Design of Permutation P in des Type Cryptosystems
- A Fast Elliptic Curve Cryptosystem.