TY  - BOOK
AU  - Davies,Donald W.
ED  - SpringerLink (Online service)
TI  - Advances in Cryptology — EUROCRYPT ’91: Workshop on the Theory and Application of Cryptographic Techniques Brighton, UK, April 8–11, 1991 Proceedings 
T2  - Lecture Notes in Computer Science,
SN  - 9783540464167
AV  - QA76.9.A25 
U1  - 005.82 23
PY  - 1991///
CY  - Berlin, Heidelberg
PB  - Springer Berlin Heidelberg
KW  - Computer science
KW  - Operating systems (Computers)
KW  - Data encryption (Computer science)
KW  - Coding theory
KW  - Database management
KW  - Combinatorics
KW  - Computer Science
KW  - Data Encryption
KW  - Coding and Information Theory
KW  - Database Management
KW  - Operating Systems
N1  - Cryptanalysis I -- Differential Cryptanalysis of Feal and N-Hash -- Markov Ciphers and Differential Cryptanalysis -- The Knapsack Hash Function proposed at Crypto’89 can be broken -- Cryptanalysis II -- An Improved Low-Density Subset Sum Algorithm -- Cryptanalysis of McEliece’s Public-Key Cryptosystem -- On the Security of the Schnorr Scheme using Preprocessing -- Zero Knowledge and Oblivious Transfer -- Broadcast Interactive Proofs -- Direct Zero Knowledge Proofs of Computational Power in Five Rounds -- On the Reversibility of Oblivious Transfer -- Sequences I -- Ziv-Lempel Complexity for Periodic Sequences and its Cryptographic Application -- A Secret Key Cryptosystem by Iterating a Chaotic Map -- Boolean Functions Satisfying Higher Order Propagation Criteria -- Sequences II -- The Maximum Order Complexity of Sequence Ensembles -- The Number of Output Sequences of a Binary Sequence Generator -- Linear Complexity of Periodically Repeated Random Sequences -- Sequences III -- On A Fast Correlation Attack on Certain Stream Ciphers -- Analysis of Pseudo Random Sequences Generated by Cellular Automata -- On Binary Sequences from Recursions “modulo 2e” Made Non-Linear by the Bit-By-Bit “XOR” Function -- Signatures -- Weaknesses of Undeniable Signature Schemes -- Distributed Provers with Applications to Undeniable Signatures -- Interactive Bi-Proof Systems and Undeniable Signature Schemes -- Group Signatures -- Theory I -- Enhancing Secrecy by Data Compression: Theoretical and Practical Aspects -- Factoring Integers and Computing Discrete Logarithms via Diophantine Approximation -- Some Considerations concerning the Selection of RSA Moduli -- On the Use of Interconnection Networks in Cryptography -- Theory II -- Non Supersingular Elliptic Curves for Public Key Cryptosystems -- Building Cyclic Elliptic Curves Modulo Large Primes -- On the Complexity of Hyperelliptic Discrete Logarithm Problem -- S-Box Criteria -- An Expanded Set of S-box Design Criteria Based on Information Theory and its Relation to Differential-Like Attacks -- Enumerating Nondegenerate Permutations -- Perfect nonlinear S-boxes -- Applications I -- A Formal Approach to Security Architectures -- Discrete Logarithm Based Protocols -- Human Identification Through Insecure Channel -- The Automated Cryptanalysis of Analog Speech Scramblers -- Applications II -- A Construction for One Way Hash Functions and Pseudorandom Bit Generators -- ESIGN: An Efficient Digital Signature Implementation for Smart Cards -- New Approaches to the Design of Self-Synchronizing Stream Ciphers -- Randomized Authentication Systems -- Public Key Cryptography -- Ideals over a Non-Commutative Ring and their Application in Cryptology -- Self-certified public keys -- Non-interactive Public-Key Cryptography -- Short Papers presented at the “Rump Session” -- Hash Functions And Graphs With Large Girths -- Dickson Pseudoprimes and Primality Testing -- Equivalent Goppa Codes and Trapdoors to McEliece’s Public Key Cryptosystem -- A Threshold Cryptosystem without a Trusted Party -- A Comparison of Cryptanalytic Principles Based on Iterative Error-Correction -- Cryptanalysis of the Chaotic-Map Cryptosystem Suggested at EUROCRYPT’91 -- How To Broadcast A Secret -- Probabilistic Analysis of Elementary Randomizers -- Race Integrity Primitives Evaluation (RIPE): A status report -- The Information Leakage through a Randomly Generated Function -- Some Weaknesses of “Weaknesses of Undeniable Signatures”
N2  - A series of open workshops devoted to modem cryptology began in Santa Barbara, California in 1981 and was followed in 1982 by a European counterpart in Burg Feurstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 meeting in Santa Barbara the International Association for Cryptologic Research was launched and it now sponsors all the meetings of the series. Following the tradition of the series, papers were invited in the form of extended abstracts and were reviewed by the programme committee, which selected those to be presented. After the meeting, full papers were produced, in some cases with impro- ments and corrections. These papers form the main part of the present volume. They are placed in the same order that they took at the meeting and under the same headings, for ease of reference by those who attended. The classification under these headings was a little arbitary, needing to fit the timing of the day‘s activities, but it makes a workable method of arrangement. Also following tradition, a “rump session’’ was held during one evening, under the effective chairmanship of John Gordon. These were short presentations and those present found them to have some real interest, therefore we have taken the unusual step of including short papers contributed by the rump session speakers at the end of this volume, with a necessarily simplified review process
UR  - http://dx.doi.org/10.1007/3-540-46416-6
ER  -