year |
venue |
title |
pages |
1995 | asiacrypt | Advances in Cryptology - ASIACRYPT '94, 4th International Conference on the Theory and Applications of Cryptology, Wollongong, Australia, November 28 - December 1, 1994, Proceedings | |
1995 | crypto | Secret Sharing with Public Reconstruction (Extended Abstract) | 353-366 |
1995 | crypto | How to Break Shamir's Asymmetric Basis | 136-147 |
1995 | crypto | Ways of Losing Information | |
1995 | crypto | Some Remarks on Lucas-Based Cryptosystems | 386-396 |
1995 | crypto | A Key Escrow System with Warrant Bounds | 197-207 |
1995 | crypto | Escrow Encryption Systems Visited: Attacks, Analysis and Designs | 222-235 |
1995 | crypto | Cryptoanalysis of the Immunized LL Public Key Systems | 287-296 |
1995 | crypto | Security and Performance of Server-Aided RSA Computation Protocols | 70-83 |
1995 | crypto | Quantum Cryptanalysis of Hidden Linear Functions (Extended Abstract) | 424-437 |
1995 | crypto | Collusion-Secure Fingerprinting for Digital Data (Extended Abstract) | 452-465 |
1995 | crypto | Improving the Search Algorithm for the Best Linear Expression | 157-170 |
1995 | crypto | On the Security of the Quantum Oblivious Transfer and Key Distribution Protocols | 124-135 |
1995 | crypto | An Efficient Divisible Electronic Cash Scheme | 438-451 |
1995 | crypto | Efficient Commitment Schemes with Bounded Sender and Unbounded Receiver | 84-96 |
1995 | crypto | Proactive Secret Sharing Or: How to Cope With Perpetual Leakage | 339-352 |
1995 | crypto | On the Security of the Gollmann Cascades | 148-156 |
1995 | crypto | Advances in Cryptology - CRYPTO '95, 15th Annual International Cryptology Conference, Santa Barbara, California, USA, August 27-31, 1995, Proceedings | online |
1995 | crypto | Cryptoanalysis of the Matsumoto and Imai Public Key Scheme of Eurocrypt'88 | 248-261 |
1995 | crypto | General Perfect Secret Sharing Schemes | 367-371 |
1995 | crypto | Improved Efficient Arguments (Preliminary Version) | 311-324 |
1995 | crypto | Fair Cryptosystems, Revisited: A Rigorous Approach to Key-Escrow (Extended Abstract) | 208-221 |
1995 | crypto | MDx-MAC and Building Fast MACs from Hash Functions | 1-14 |
1995 | crypto | Cryptoanalysis Based on 2-Adic Rational Approximation | 262-273 |
1995 | crypto | Secure Signature Schemes based on Interactive Protocols | 297-310 |
1995 | crypto | A Key-schedule Weakness in SAFER K-64 | 274-286 |
1995 | crypto | Bucket Hashing and its Application to Fast Message Authentication | 29-42 |
1995 | crypto | XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions | 15-28 |
1995 | crypto | Committed Oblivious Transfer and Private Multi-Party Computation | 110-123 |
1995 | crypto | Precomputing Oblivious Transfer | 97-109 |
1995 | crypto | Honest Verifier vs Dishonest Verifier in Public Cain Zero-Knowledge Proofs | 325-338 |
1995 | crypto | Fast Key Exchange with Elliptic Curve Systems | 43-56 |
1995 | crypto | Robustness Principles for Public Key Protocols | 236-247 |
1995 | crypto | On Differential and Linear Crytoanalysis of the RC5 Encryption Algorithm | 171-184 |
1995 | crypto | t-Cheater Identifiable (k, n) Threshold Secret Sharing Schemes | 410-423 |
1995 | crypto | NFS with Four Large Primes: An Explosive Experiment | 372-385 |
1995 | crypto | A Simple Method for Generating and Sharing Pseudo-Random Functions, with Applications to Clipper-like Escrow Systems | 185-196 |
1995 | crypto | Threshold DSS Signatures without a Trusted Party | 397-409 |
1995 | crypto | Fast Server-Aided RSA Signatures Secure Against Active Attacks | 57-69 |
1995 | eurocrypt | Secure Multiround Authentication Protocols | 158-167 |
1995 | eurocrypt | Verifiable Signature Sharing | 50-63 |
1995 | eurocrypt | Counting the Number of Points on Elliptic Curves over Finite Fields: Strategies and Performance | 79-94 |
1995 | eurocrypt | Attacking the Chor-Rivest Cryptosystem by Improved Lattice Reduction | 1-12 |
1995 | eurocrypt | Server (Prover/Signer)-Aided Verification of Identity Proofs and Signatures | 64-78 |
1995 | eurocrypt | General Short Computational Secret Sharing Schemes | 194-208 |
1995 | eurocrypt | Fair Blind Signatures | 209-219 |
1995 | eurocrypt | Verifiable Secret Sharing as Secure Computation | 168-182 |
1995 | eurocrypt | Are Crypto-Accelerators Really Inevitable? 20Bit Zero-Knowledge in Less than a Second on Simple 8-bit Microcontrollers | 404-409 |
1995 | eurocrypt | Arithmetic coprocessors: The state of the art | |
1995 | eurocrypt | Universal Hash Functions & Hard Core Bits | 356-366 |
1995 | eurocrypt | Arithmetic coprocessors and security mechanisms | |
1995 | eurocrypt | Area of applications of the arithmetic coprocessors | |
1995 | eurocrypt | On the Matsumoto and Imai's Human Identification Scheme | 382-392 |
1995 | eurocrypt | An Implementation of the General Number Field Sieve to Compute Discrete Logarithms mod p | 95-105 |
1995 | eurocrypt | Restrictive Blinding of Secret-Key Certificates | 231-247 |
1995 | eurocrypt | On Nonlinear Resilient Functions (Extended Abstract) | 274-288 |
1995 | eurocrypt | Towards Fast Correlation Attacks on Irregularly Clocked Shift Registers | 248-262 |
1995 | eurocrypt | Convergence in Differential Distributions | 13-23 |
1995 | eurocrypt | On the Efficiency of Group Signatures Providing Information-Theoretic Anonymity | 39-49 |
1995 | eurocrypt | A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-Up Lemma | 24-38 |
1995 | eurocrypt | How to Break Another Provably Secure Payment System | 121-132 |
1995 | eurocrypt | A New Identification Scheme Based on the Perceptrons Problem | 319-328 |
1995 | eurocrypt | Quantum Oblivious Mutual Identification | 133-146 |
1995 | eurocrypt | Advances in Cryptology - EUROCRYPT '95, International Conference on the Theory and Application of Cryptographic Techniques, Saint-Malo, France, May 21-25, 1995, Proceeding | online |
1995 | eurocrypt | Recycling Random Bits in Composed Perfect Zero-Knowledge | 367-381 |
1995 | eurocrypt | Large Periods Nearly de Bruijn FCSR Sequences | 263-273 |
1995 | eurocrypt | Anonymous NIZK Proofs of Knowledge with Preprocessing | 413-416 |
1995 | eurocrypt | Efficient Secret Sharing Without a Mutually Trusted Authority (Extended Abstract) | 183-193 |
1995 | eurocrypt | Fast RSA-type Schemes Based on Singular Cubic Curves y²+axy=m³(mod n) | 329-340 |
1995 | eurocrypt | Ripping Coins For a Fair Exchange | 220-230 |
1995 | eurocrypt | New Hash Functions For Message Authentication | 301-310 |
1995 | eurocrypt | Securing Traceability of Ciphertexts - Towards a Secure Software Key Escrow System (Extended Abstract) | 147-157 |
1995 | eurocrypt | Combinatorial Bounds for Authentication Codes with Arbitration | 289-300 |
1995 | eurocrypt | A² Codes from Universal Hash Classes | 311-318 |
1995 | eurocrypt | Receipt-Free Mix-Type Voting Scheme - A Practical Solution to the Implementation of a Voting Booth | 393-403 |
1995 | eurocrypt | Relationships Among the Computational Powers of Breaking Discrete Log Cryptosystems | 341-355 |
1995 | eurocrypt | A Block Lanczos Algorithm for Finding Dependencies Over GF(2) | 106-120 |
1995 | fse | Fast Software Encryption: Second International Workshop. Leuven, Belgium, 14-16 December 1994, Proceedings | online |
1995 | jofc | Short RSA Keys and Their Generation | 101-114 |
1995 | jofc | The Cryptanalysis of a Public-Key Implementation of Finite Group Mappings | 157-166 |
1995 | jofc | Graph Decompositions and Secret Sharing Schemes | 39-64 |
1995 | jofc | Practical and Provably Secure Release of a Secret and Exchange of Signatures | 201-222 |
1995 | jofc | Fast Generation of Prime Numbers and Secure Public-Key Cryptographic Parameters | 123-155 |
1995 | jofc | Provable Security Against a Differential Attack | 27-37 |
1995 | jofc | On the Distribution of Characteristics in Bijective Mappings | 67-86 |
1995 | jofc | Further Enumerating Boolean Functions of Cryptographic Significance | 115-122 |
1995 | jofc | Necessary and Sufficient Condtions for Collision-Free Hashing | 87-100 |
1995 | jofc | Pairs and Triplets of DES S-Boxes | 1-25 |
1995 | jofc | Information-Theoretic Bounds for Authentication Codes and Block Designs | 177-188 |
1995 | jofc | On Key Storage in Secure Networks | 189-200 |
1995 | jofc | An Infinite Class of Counterexamples to a Conjecture Concerning Nonlinear Resilient Functions | 167-173 |