Advances in Cryptology -- EUROCRYPT '95 : International Conference on the Theory and Application of Cryptographic Techniques Saint-Malo, France, May 21-25, 1995 Proceedings / edited by Louis C. Guillou, Jean-Jacques Quisquater.
Material type:
TextSeries: Lecture notes in computer science ; 921.Publication details: Berlin, Heidelberg : Springer-Verlag Berlin Heidelberg, 1995.Description: 1 online resource : v.: digitalContent type: - text
- computer
- online resource
- 9783540492641
- 354049264X
- Computer science
- Computer Communication Networks
- Data encryption (Computer science)
- Coding theory
- Combinatorial analysis
- Number theory
- Management information systems
- Computers -- Access control
- Electronic Data Processing
- Management Information Systems
- Informatique
- Chiffrement (Informatique)
- Analyse combinatoire
- Théorie des nombres
- Systèmes d'information de gestion
- Coding theory
- Combinatorial analysis
- Computer science
- Data encryption (Computer science)
- Management information systems
- Number theory
- Geheimschrift
- Cryptographie -- Congrès
- Ordinateurs -- Accès -- Contrôle -- Congrès
- cryptology
- EUROCRYPT
- cryptographic techniques
- IACR
- 005.82 23
- QA76.9.A25
- 54.62
- digitized 2024. HathiTrust Digital Library committed to preserve
- Sponsored by the International Association for Cryptologic Research.
| Item type | Current library | Collection | Call number | Status | Date due | Barcode | Item holds | |
|---|---|---|---|---|---|---|---|---|
eBook
|
e-Library | eBook LNCS | Available |
Includes bibliographical references and index.
This volume constitutes the proceedings of EUROCRYPT '95, the 1995 International Workshop on the Theory and Application of Cryptographic Techniques, held in Saint-Malo, France in May 1995 under the sponsorship of the International Association for Cryptologic Research (IACR). The volume contains revised versions of the 33 papers selected from a total of 113 submissions. All current aspects of cryptologic research and advanced applications are addressed; there are sections on cryptanalysis, signatures, computational number theory, cryptographic protocols, secret sharing, electronic cash, shift registers and Boolean functions, authentication codes, new schemes, complexity aspects, and implementation aspects.
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.
Use copy Restrictions unspecified star MiAaHDL
Sponsored by the International Association for Cryptologic Research.
Electronic reproduction. [Place of publication not identified]: HathiTrust Digital Library. 2024. MiAaHDL
Master and use copy. Digital master created according to Benchmark for Faithful Digital Reproductions of Monographs and Serials, Version 1. Digital Library Federation, December 2002. MiAaHDL
http://purl.oclc.org/DLF/benchrepro0212
digitized 2024. HathiTrust Digital Library committed to preserve pda MiAaHDL