| Description |
1 online resource : v.: digital |
| Series |
Lecture Notes in Computer Science, 0302-9743 ; 921 |
|
Lecture notes in computer science ; 921. 0302-9743
|
| Contents |
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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references and index |
| Subject |
Computer science.
|
|
Computer Communication Networks
|
|
Data encryption (Computer science)
|
|
Coding theory.
|
|
Combinatorial analysis.
|
|
Number theory.
|
|
Management information systems.
|
|
Electronic Data Processing
|
|
Management Information Systems
|
|
Coding theory
|
|
Combinatorial analysis
|
|
Computer science
|
|
Data encryption (Computer science)
|
|
Management information systems
|
|
Number theory
|
| Form |
Electronic book
|
| Author |
Guillou, Louis C., 1947-
|
|
Quisquater, J.-J. (Jean-Jacques), 1945-
|
|
International Association for Cryptologic Research.
|
|
Centre commun d'études de télévision et télécommications.
|
| ISBN |
9783540492641 |
|
354049264X |
|
