Advances in Cryptology — EUROCRYPT ’95: International Conference on the Theory and Application of Cryptographic Techniques Saint-Malo, France, May 21–25, 1995 Proceedings [1 ed.]
3540594094, 9783540594093
This volume constitutes the proceedings of EUROCRYPT '95, the 1995 International Workshop on the Theory and Applica
Table of contents : Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction....Pages 1-12 Convergence in Differential Distributions....Pages 13-23 A Generalization of Linear Cryptanalysis and the Applicability of Matsui’s Piling-up Lemma....Pages 24-38 On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity....Pages 39-49 Verifiable Signature Sharing....Pages 50-63 Server(Prover/Signer)-Aided Verification of Identity Proofs and Signatures....Pages 64-78 Counting the number of points on elliptic curves over finite fields: strategies and performances....Pages 79-94 An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p ....Pages 95-105 A Block Lanczos Algorithm for Finding Dependencies over GF(2)....Pages 106-120 How to Break Another “Provably Secure” Payment System....Pages 121-132 Quantum Oblivious Mutual Identification....Pages 133-146 Securing Traceability of Ciphertexts — Towards a Secure Software Key Escrow System....Pages 147-157 Secure Multiround Authentication Protocols....Pages 158-167 Verifiable Secret Sharing as Secure Computation....Pages 168-182 Efficient Secret Sharing Without a Mutually Trusted Authority....Pages 183-193 General Short Computational Secret Sharing Schemes....Pages 194-208 Fair Blind Signatures....Pages 209-219 Ripping Coins for a Fair Exchange....Pages 220-230 Restrictive Binding of Secret-Key Certificates....Pages 231-247 Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers....Pages 248-262 Large Period Nearly deBruijn FCSR Sequences....Pages 263-273 On Nonlinear Resilient Functions....Pages 274-288 Combinatorial Bounds for Authentication Codes with Arbitration....Pages 289-300 New Hash Functions for Message Authentication....Pages 301-310 A 2 —codes from universal hash classes....Pages 311-318 A New Identification Scheme Based on the Perceptrons Problem....Pages 319-328 Fast RSA-type Schemes Based on Singular Cubic Curves y 2 + axy ≡ x 3 (mod n )....Pages 329-340 Relationships among the Computational Powers of Breaking Discrete Log Cryptosystems....Pages 341-355 Universal Hash Functions & Hard Core Bits....Pages 356-366 Recycling Random Bits in Composed Perfect Zero-Knowledge....Pages 367-381 On the Matsumoto and Imai’s Human Identification Scheme....Pages 382-392 Receipt-Free Mix-Type Voting Scheme....Pages 393-403 Are Crypto-Accelerators Really Inevitable?....Pages 404-409 Anonymous NIZK Proofs of Knowledge with Preprocessing....Pages 413-416