Advances in cryptology - EUROCRYPT 92 : [10th] Workshop on the Theory and Application of Cryptographic Techniques, Balatonfüred, Hungary, May 24 28, 1992 : proceedings
A series of workshops devoted to modern cryptography began in Santa Barbara,California in 1981 and was followed in 1982 by a European counterpart in Burg Feuerstein, Germany. The series has been maintained with summer meetings in Santa Barbara and spring meetings somewhere in Europe. At the 1983 mee...
Enregistré dans:
| Institution som forfatter: | |
|---|---|
| Andre forfattere: | |
| Format: | Livre numérique |
| Sprog: | Anglais |
| Udgivet: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Serier: | Lecture notes in computer science
658 |
| Fag: | |
| Online adgang: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Kommentar: |
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 '92, Workshop on the Theory and Application of Cryptographic Techniques, Balatonfüred, Hungary, May 24-28, 1992, proceedings, R.A. Rueppel, ed, 1993, Berlin, Springer, 1 vol. (X-491 p.), Lecture notes in computer science, 0-387-56413-6 • Advances in Cryptology EUROCRYPT 92, Texte imprimé, 9783662163078 |
Indholdsfortegnelse:
- Secret Sharing
- Graph Decompositions and Secret Sharing Schemes
- Classification of Ideal Homomorphic Threshold Schemes over Finite Abelian Groups
- Hash Functions
- F.F.T. Hashing is not Collision-free
- FFT-Hash II, Efficient Cryptographic Hashing
- Hash Functions Based on Block Ciphers
- Differential Cryptanalysis Mod 232 with Applications to MD5
- Block Ciphers
- A New Method for Known Plaintext Attack of FEAL Cipher
- On the construction of highly nonlinear permutations
- The One-Round Functions of the DES Generate the Alternating Group
- Stream Ciphers
- Correlation Via Linear Sequential Circuit Approximation of Combiners with Memory
- Convergence of a Bayesian Iterative Error-Correction Procedure on a Noisy Shift Register Sequence
- Suffix trees and string complexity
- Public Key I
- Attacks on Protocols for Server-Aided RSA Computation
- Public-Key Cryptosystems with Very Small Key Lengths
- Resource Requirements for the Application of Addition Chains in Modulo Exponentiation
- Factoring
- Massively parallel elliptic curve factoring
- The Eurocrypt 92 Controversial Issue Trapdoor Primes and Moduli
- The Eurocrypt 92 Controversial Issue Trapdoor Primes and Moduli
- Public Key II
- Fast Exponentiation with Precomputation
- Batch Diffie-Hellman Key Agreement Systems and their Application to Portable Communications
- High-Speed Implementation Methods for RSA Scheme
- Pseudo-random Permutation Generators
- A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
- How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function
- A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function
- Complexity Theory and Cryptography I
- How to Break a Secure Oblivious Transfer Protocol
- Uniform Results in Polynomial-Time Security
- Cryptographic Protocols Provably Secure Against Dynamic Adversaries
- Zero-Knowledge
- Secure Bit Commitment Function against Divertibility
- Non-Interactive Circuit Based Proofs and Non-Interactive Perfect Zero-knowledge with Preprocessing
- Tools for Proving Zero Knowledge
- Digital Signatures and Electronic Cash
- How to Make Efficient Fail-stop Signatures
- Which new RSA Signatures can be Computed from RSA Signatures, Obtained in a Specific Interactive Protocol?
- Transferred Cash Grows in Size
- Complexity Theory and Cryptography II
- Local Randomness in Candidate One-Way Functions
- How Intractable Is the Discrete Logarithm for a General Finite Group?
- Factoring with an Oracle
- Applications
- Secure Audio Teleconferencing: A Practical Solution
- Selected Papers from the Rump Session
- Secure Conference Key Distribution Schemes for Conspiracy Attack
- A Note on Discrete Logarithms with Special Structure
- A Remark on a Non-interactive Public-Key Distribution System
- Security Bounds for Parallel Versions of Identification Protocols
- Information-Theoretic Bounds for Authentication Frauds
- A Generalized Correlation Attack with a Probabilistic Constrained Edit Distance
- Systolic-Arrays for Modular Exponentiation Using Montgomery Method
- On the Development of a Fast Elliptic Curve Cryptosystem
- A Montgomery-Suitable Fiat-Shamir-Like Authentication Scheme.