year |
venue |
title |
pages |
1997 | crypto | A Multiplicative Attack Using LLL Algorithm on RSA Signatures with Redundancy | 221-234 |
1997 | crypto | On the Security of the KMOV Public Key Cryptosystem | 235-248 |
1997 | crypto | Efficient Group Signature Schemes for Large Groups (Extended Abstract) | 410-424 |
1997 | crypto | Proactive RSA | 440-454 |
1997 | crypto | Towards Realizing Random Oracles: Hash Functions That Hide All Partial Information | 455-469 |
1997 | crypto | Cryptoanalysis of the Cellular Encryption Algorithm | 526-537 |
1997 | crypto | Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations | 16-30 |
1997 | crypto | Deniable Encryption | 90-104 |
1997 | crypto | A Key Recovery Attack on Discrete Log-based Schemes Using a Prime Order Subgroupp | 249-263 |
1997 | crypto | Visual Authentication and Identification | 322-336 |
1997 | crypto | Efficient Generation of Shared RSA Keys (Extended Abstract) | 425-439 |
1997 | crypto | RSA-Based Undeniable Signatures | 132-149 |
1997 | crypto | How to Sign Digital Streams | 180-197 |
1997 | crypto | The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems | 264-276 |
1997 | crypto | Merkle-Hellman Revisited: A Cryptoanalysis of the Qu-Vanstone Cryptosystem Based on Group Factorizations | 198-212 |
1997 | crypto | The Complexity of Computing Hard Core Predicates | 1-15 |
1997 | crypto | Digital Signcryption or How to Achieve Cost(Signature & Encryption) << Cost(Signature) + Cost(Encryption) | 165-179 |
1997 | crypto | On the Foundations of Modern Cryptography | 46-74 |
1997 | crypto | Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem | 105-111 |
1997 | crypto | Public-Key Cryptosystems from Lattice Reduction Problems | 112-131 |
1997 | crypto | Edit Distance Correlation Attack on the Alternating Step Generator | 499-512 |
1997 | crypto | Quantum Information Processing: The Good, the Bad and the Ugly | 337-341 |
1997 | crypto | Privacy Amplification Secure Against Active Adversaries | 307-321 |
1997 | crypto | Efficient Algorithms for Elliptic Curve Cryptosystems | 342-356 |
1997 | crypto | Differential Fault Analysis of Secret Key Cryptosystems | 513-525 |
1997 | crypto | Advances in Cryptology - CRYPTO '97, 17th Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 1997, Proceedings | online |
1997 | crypto | A One Way Function Based on Ideal Arithmetic in Number Fields | 385-394 |
1997 | crypto | Unconditional Security Against Memory-Bounded Adversaries | 292-306 |
1997 | crypto | "Pseudo-Random" Number Generation Within Cryptographic Algorithms: The DDS Case | 277-291 |
1997 | crypto | Fast and Secure Hashing Based on Codes | 485-498 |
1997 | crypto | Keeping the SZK-Verifier Honest Unconditionally | 31-45 |
1997 | crypto | Security of Blind Digital Signatures (Extended Abstract) | 150-164 |
1997 | crypto | Collision-Resistant Hashing: Towards Making UOWHFs Practical | 470-484 |
1997 | crypto | An Improved Algorithm for Arithmetic on a Family of Elliptic Curves | 357-371 |
1997 | crypto | Plug and Play Encryption | 75-89 |
1997 | crypto | Efficient Anonymous Multicast and Reception (Extended Abstract) | 395-409 |
1997 | crypto | Failure of the McEliece Public-Key Cryptosystem Under Message-Resend and Related-Message Attack | 213-220 |
1997 | crypto | Fast RSA-Type Cryptosystems Using N-Adic Expansion | 372-384 |
1997 | eprint | A New Paradigm for Collision-free Hashing: Incrementality at Reduced Cost | online |
1997 | eprint | Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function | online |
1997 | eprint | Efficient Cryptographic Protocols Based on Noisy Channels | online |
1997 | eprint | A note on negligible functions | online |
1997 | eprint | A Probabilistic Error-Correcting Scheme | online |
1997 | eprint | Protecting Data Privacy in Private Information Retrieval Schemes | online |
1997 | eprint | Towards realizing random oracles: Hash functions that hide all partial information | online |
1997 | eprint | Factoring via Strong Lattice Reduction Algorithms | online |
1997 | eprint | Collision-Resistant Hashing: Towards Making UOWHFs Practical | online |
1997 | eprint | CBC MAC for Real-Time Data Sources | online |
1997 | eprint | Identity Escrow | online |
1997 | eprint | Self-Delegation with Controlled Propagation - or - What If You Lose Your Laptop | online |
1997 | eprint | Visual Authentication and Identification | online |
1997 | eprint | Generalized Diffie-Hellman Modulo a Composite is not Weaker than Factoring | online |
1997 | eprint | Optimistic fair Exchange of Digital Signatures | online |
1997 | eurocrypt | Finding Good Random Elliptic Curves for Cryptosystems Defined over F2n | 379-392 |
1997 | eurocrypt | A New Public-Key Cryptosystem | 27-36 |
1997 | eurocrypt | Round-Optimal Zero-Knowledge Arguments Based on any One-Way Function | 280-305 |
1997 | eurocrypt | A New Paradigm for Collision-Free Hashing: Incrementality at Reduced Cost | 163-192 |
1997 | eurocrypt | SHA: A Design for Parallel Architectures? | 348-362 |
1997 | eurocrypt | Binding ElGamal: A Fraud-Detectable Alternative to Key-Escrow Proposals | 119-133 |
1997 | eurocrypt | Smart Card Security - How can you be so sure? | |
1997 | eurocrypt | Algebraic-Geometric Realisations of the Discrete Logarithm Problem | |
1997 | eurocrypt | Selective Forgery of RSA Signatures Using Redundancy | 495-507 |
1997 | eurocrypt | Incremental Cryptography and Memory Checkers | 293-408 |
1997 | eurocrypt | Stronger Security Proofs for RSA and Rabin Bits | 267-279 |
1997 | eurocrypt | Rapid Demonstration of Linear Relations Connected by Boolean Operators | 318-333 |
1997 | eurocrypt | Kleptography: Using Cryptography Against Cryptography | 62-74 |
1997 | eurocrypt | Information-Theoretically Secure Secret-Key Agreement by NOT Authenticated Public Discussion | 209-225 |
1997 | eurocrypt | Linear Statistical Weakness of Alleged RC4 Keystream Generator | 226-238 |
1997 | eurocrypt | Cryptanalysis of Alleged A5 Stream Cipher | 239-255 |
1997 | eurocrypt | Oblivious Transfers and Privacy Amplification | 334-347 |
1997 | eurocrypt | Combinatorial Properties of Basic Encryption Operations (Extended Abstract) | 14-26 |
1997 | eurocrypt | Bucket Hashing with a Small Key Size | 149-162 |
1997 | eurocrypt | Fast Arithmetic Architectures for Public-Key Algorithms over Galois Fields GF((2n)m) | 363-378 |
1997 | eurocrypt | Smooth Entropy and Rényi Entropy | 193-208 |
1997 | eurocrypt | Lattice Attacks on NTRU | 52-61 |
1997 | eurocrypt | Efficient and Generalized Group Signatures | 465-479 |
1997 | eurocrypt | Fast and Secure Immunization Against Adaptive Man-in-the-Middle Impersonation | 75-87 |
1997 | eurocrypt | Anonymous Fingerprinting | 88-102 |
1997 | eurocrypt | A Secure and Optimally Efficient Multi-Authority Election Scheme | 103-118 |
1997 | eurocrypt | Efficient Cryptographic Protocols Based on Noisy Channels | 306-317 |
1997 | eurocrypt | On the Importance of Checking Cryptographic Protocols for Faults (Extended Abstract) | 37-51 |
1997 | eurocrypt | More Correlation-Immune and Resilient Functions over Galois Fields and Galois Rings | 422-433 |
1997 | eurocrypt | Two Attacks on Reduced IDEA | 1-13 |
1997 | eurocrypt | Advances in Cryptology - EUROCRYPT '97, International Conference on the Theory and Application of Cryptographic Techniques, Konstanz, Germany, May 11-15, 1997, Proceeding | online |
1997 | eurocrypt | Lower Bounds for Discrete Logarithms and Related Problems | 256-266 |
1997 | eurocrypt | Distributed "Magic Ink" Signatures | 450-464 |
1997 | eurocrypt | The GCHQ Protocol and Its Problems | 134-148 |
1997 | eurocrypt | Almost k-wise Independent Sample Spaces and Their Cryptologic Applications | 409-421 |
1997 | eurocrypt | Design of SAC/PC(l) of Order k Boolean Functions and Three Other Cryptographic Criteria | 434-449 |
1997 | eurocrypt | Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees | 480-494 |
1997 | fse | The Interpolation Attack on Block Ciphers | 28-40 |
1997 | fse | The Design of the ICE Encryption Algorithm | 69-82 |
1997 | fse | On the Security of Remotely Keyed Encryption | 219-229 |
1997 | fse | XMX: A Firmware-Oriented Block Cipher Based on Modular Multiplications | 166-171 |
1997 | fse | New Block Encryption Algorithm MISTY | 54-68 |
1997 | fse | Partitioning Cryptanalysis | 13-27 |
1997 | fse | A Family of Trapdoor Ciphers | 139-148 |
1997 | fse | Fast Software Encryption, 4th International Workshop, FSE '97, Haifa, Israel, January 20-22, 1997, Proceedings | online |
1997 | fse | All-or-Nothing Encryption and the Package Transform | 210-218 |
1997 | fse | Improving Linear Cryptanalysis of LOKI91 by Probabilistic Counting Method | 114-133 |
1997 | fse | Fast Message Authentication Using Efficient Polynomial Evaluation | 190-204 |
1997 | fse | Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor | 242-259 |
1997 | fse | Sliding Encryption: A Cryptographic Tool for Mobile Agents | 230-241 |
1997 | fse | Reinventing the Travois: Encryption/MAC in 30 ROM Bytes | 205-209 |
1997 | fse | Chameleon - A New Kind of Stream Cipher | 107-113 |
1997 | fse | The Block Cipher Square | 149-165 |
1997 | fse | Advanced Encryption Standard | 83-87 |
1997 | fse | Best Differential Characteristic Search of FEAL | 41-53 |
1997 | fse | On Nonlinear Filter Generators | 103-106 |
1997 | fse | TWOPRIME: A Fast Stream Ciphering Algorithm | 88-102 |
1997 | fse | Cryptanalysis of Ladder-DES | 134-138 |
1997 | fse | A Fast New DES Implementation in Software | 260-272 |
1997 | fse | Optimizing a Fast Stream Cipher for VLIW, SIMD, and Superscalar Processors | 273-287 |
1997 | fse | MMH: Software Message Authentication in the Gbit/Second Rates | 172-189 |
1997 | fse | x2 Cryptanalysis of the SEAL Encryption Algorithm | 1-12 |
1997 | jofc | A Construction of a Cipher from a Single Pseudorandom Permutation | 151-162 |
1997 | jofc | Batch RSA | 75-88 |
1997 | jofc | An Improvement of Davies' Attack on DES | 195-206 |
1997 | jofc | Linking Information Reconciliation and Privacy Amplification | 97-110 |
1997 | jofc | Small Solutions to Polynomial Equations, and Low Exponent RSA Vulnerabilities | 233-260 |
1997 | jofc | On the Existence of Statistically Hiding Bit Commitment Schemes and Fail-Stop Signatures | 163-194 |
1997 | jofc | The Security of the Birational Permutation Signature Schemes | 207-221 |
1997 | jofc | A Language-Dependent Cryptographic Primitive | 37-50 |
1997 | jofc | Mutually Trusted Authority-Free Secret Sharing Schemes | 261-289 |
1997 | jofc | The Size of a Share Must Be Large | 223-231 |
1997 | jofc | A Chosen Message Attack on Demytko's Elliptic Curve Cryptosystem | 71-72 |
1997 | jofc | Feedback Shift Registers, 2-Adic Span, and Combiners with Memory | 111-147 |
1997 | jofc | Batch Diffie-Hellman Key Agreement Systems | 89-96 |
1997 | jofc | On Schnorr's Preprocessing for Digital Signature Schemes | 1-16 |
1997 | jofc | RIPEMD with Two-Round Compress Function is Not Collision-Free | 51-70 |
1997 | jofc | Locally Random Reductions: Improvements and Applications | 17-36 |