Advances in cryptology - EUROCRYPT 95 : [13th] International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21 25, 1995 : proceedings
Tallennettuna:
| Yhteisötekijä: | |
|---|---|
| Muut tekijät: | , |
| Aineistotyyppi: | Livre numérique |
| Kieli: | Anglais |
| Julkaistu: |
Berlin [etc.] :
Springer
[20..].
Cham : Springer Nature |
| Sarja: | Lecture notes in computer science
921 |
| Aiheet: | |
| Linkit: | Accès sur la plateforme de l'éditeur Accès sur la plateforme Istex Accès Université d'Orléans Accès INSA CVL |
| Huomautus: |
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 '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, proceedings, Louis C. Guillou, Jean-Jacques Quisquater, eds, Berlin, Springer, 1995, 1 vol. (xiv, 416 p.), Lecture notes in computer science, 3-540-59409-4 • Advances in Cryptology EUROCRYPT 95, Texte imprimé, 9783662194980 |
Sisällysluettelo:
- Cryptanalysis
- Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction
- Convergence in Differential Distributions
- A Generalization of Linear Cryptanalysis and the Applicability of Matsui s Piling-up Lemma
- Signatures
- On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity
- Verifiable Signature Sharing
- Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures
- Number Theory
- Counting the number of points on elliptic curves over finite fields: strategies and performances
- An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p
- A Block Lanczos Algorithm for Finding Dependencies over GF(2)
- Protocol Aspects
- How to Break Another Provably Secure Payment System
- Quantum Oblivious Mutual Identification
- Securing Traceability of Ciphertexts Towards a Secure Software Key Escrow System
- Secure Multiround Authentication Protocols
- Secret Sharing
- Verifiable Secret Sharing as Secure Computation
- Efficient Secret Sharing Without a Mutually Trusted Authority
- General Short Computational Secret Sharing Schemes
- Electronic Cash
- Fair Blind Signatures
- Ripping Coins for a Fair Exchange
- Restrictive Binding of Secret-Key Certificates
- Shift Registers and Boolean Functions
- Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers
- Large Period Nearly deBruijn FCSR Sequences
- On Nonlinear Resilient Functions
- Authentication Codes
- Combinatorial Bounds for Authentication Codes with Arbitration
- New Hash Functions for Message Authentication
- A 2 codes from universal hash classes
- New Schemes
- A New Identification Scheme Based on the Perceptrons Problem
- Fast RSA-type Schemes Based on Singular Cubic Curves y 2 + axy ? x 3 (mod n).-Complexity Aspects
- Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems
- Universal Hash Functions & Hard Core Bits
- Recycling Random Bits in Composed Perfect Zero-Knowledge
- Implementation Aspects
- On the Matsumoto and Imai s Human Identification Scheme
- Receipt-Free Mix-Type Voting Scheme
- Are Crypto-Accelerators Really Inevitable?
- Rump Session
- Anonymous NIZK Proofs of Knowledge with Preprocessing.