year |
venue |
title |
pages |
1996 | asiacrypt | Hash Functions Based on Block Ciphers and Quaternary Codes | 77-90 |
1996 | asiacrypt | Advances in Cryptology - ASIACRYPT '96, International Conference on the Theory and Applications of Cryptology and Information Security, Kyongju, Korea, November 3-7, 1996, Proceedings | online |
1996 | asiacrypt | Limiting the Visible Space Visual Secret Sharing Schemes and Their Application to Human Identification | 185-195 |
1996 | asiacrypt | On Applying Linear Cryptanalysis to IDEA | 105-115 |
1996 | asiacrypt | Key Sharing Based on the Wire-Tap Channel Type II Concept with Noisy Main Channel | 210-217 |
1996 | asiacrypt | A World Wide Number Field Sieve Factoring Record: On to 512 Bits | 382-394 |
1996 | asiacrypt | Electronic Money and Key Management from Global and Regional Points of View | 173-184 |
1996 | asiacrypt | A Fast Software Implementation for Arithmetic Operations in GF(2n) | 65-76 |
1996 | asiacrypt | Generalization of Higher Order SAC to Vector Output Boolean Functions | 218-231 |
1996 | asiacrypt | How to Date Blind Signatures | 244-251 |
1996 | asiacrypt | Observations on Non-repudiation | 133-144 |
1996 | asiacrypt | Minding your p's and q`s | 26-35 |
1996 | asiacrypt | Conditional Correlation Attack on Nonlinear Filter Generators | 360-367 |
1996 | asiacrypt | Generalized Feistel Networks | 91-104 |
1996 | asiacrypt | Generating Standard DSA Signatures Without Long Inversion | 57-64 |
1996 | asiacrypt | The Cryptographic Security of the Syndrome Decoding Problem for Rank Distance Codes | 368-381 |
1996 | asiacrypt | Mis-representation of Identities in E-cash Schemes and how to Prevent it | 276-285 |
1996 | asiacrypt | Cost-Effective Payment Schemes with Privacy Regulation | 266-275 |
1996 | asiacrypt | How to Utilize the Transformability of Digital Signatures for Solving the Oracle Problem | 322-333 |
1996 | asiacrypt | Cryptographic Protocols Based on Real-Quadratic A-fields | 15-25 |
1996 | asiacrypt | Towards Characterizing When Information-Theoretic Secret Key Agreement Is Possible | 196-209 |
1996 | asiacrypt | On the Correlation Immune Functions and Their Nonlinearity | 232-243 |
1996 | asiacrypt | Cryptography and the Internet: Lessons and Challenges | 50-56 |
1996 | asiacrypt | On the Efficiency of One-Time Digital Signatures | 145-158 |
1996 | asiacrypt | Provably Secure Blind Signature Schemes | 252-265 |
1996 | asiacrypt | Some Remarks on a Receipt-Free and Universally Verifiable Mix-Type Voting Scheme | 125-132 |
1996 | asiacrypt | On the Risk of Disruption in Several Multiparty Signature Schemes | 334-345 |
1996 | asiacrypt | A Message Recovery Signature Scheme Equivalent to DSA over Elliptic Curves | 1-14 |
1996 | asiacrypt | A Multi-Recastable Ticket Scheme for Electronic Elections | 116-124 |
1996 | asiacrypt | "Indirect Discourse Proof": Achieving Efficient Fair Off-Line E-cash | 286-300 |
1996 | asiacrypt | A Hidden Cryptographic Assunmption in No-Transferable Indentification Schemes | 159-172 |
1996 | asiacrypt | Correlation Attacks on Cascades of Clock Controlled Shift Registers | 346-359 |
1996 | asiacrypt | Authenticated Multi-Party Key Agreement | 36-49 |
1996 | asiacrypt | Convertible Group Signatures | 311-321 |
1996 | asiacrypt | The Validation of Cryptographic Algorithms | 301-310 |
1996 | crypto | Export Controls: Past, Present, and Future | |
1996 | crypto | (title unknown) | |
1996 | crypto | Relation of Theory to Practice in Cryptography | |
1996 | crypto | Cryptographic applications in electronic commerce | |
1996 | crypto | Cryptology, Technology, and Politics | |
1996 | crypto | Hidden Collisions on DSS | 83-88 |
1996 | crypto | Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution | 387-400 |
1996 | crypto | Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations | 372-386 |
1996 | crypto | Robust and Efficient Sharing of RSA Functions | 157-172 |
1996 | crypto | All Bits ax+b mod p are Hard (Extended Abstract) | 114-128 |
1996 | crypto | Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract) | 283-297 |
1996 | crypto | The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone? | 89-103 |
1996 | crypto | Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes | 129-142 |
1996 | crypto | Linear Complexity of Periodic Sequences: A General Theory | 358-371 |
1996 | crypto | Fast Hashing on the Pentium | 298-312 |
1996 | crypto | Diffie-Hellman Oracles | 268-282 |
1996 | crypto | Quantum Key Distribution and String Oblivious Transfer in Noisy Channels | 343-357 |
1996 | crypto | Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing | 201-215 |
1996 | crypto | Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings | 31-44 |
1996 | crypto | Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude | 229-236 |
1996 | crypto | Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings | online |
1996 | crypto | Asymmetric Cryptography with a Hidden Monomial | 45-60 |
1996 | crypto | Quantum Cryptography over Underground Optical Fibers | 329-342 |
1996 | crypto | Key-Schedule Cryptoanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES | 237-251 |
1996 | crypto | Keying Hash Functions for Message Authentication | 1-15 |
1996 | crypto | How to Protect DES Against Exhaustive Key Search | 252-267 |
1996 | crypto | Proving Without Knowing: On Oblivious, Agnostic and Blindolded Provers | 186-200 |
1996 | crypto | Improved Differential Attacks on RC5 | 216-228 |
1996 | crypto | New Generation of Secure and Practical RSA-Based Signatures | 173-185 |
1996 | crypto | Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems | 104-113 |
1996 | crypto | Security of $2^t$-Root Identification and Signatures | 143-156 |
1996 | crypto | Universal Hashing and Multiple Authentication | 16-30 |
1996 | crypto | On Fast and Provably Secure Message Authentication Based on Universal Hashing | 313-328 |
1996 | crypto | Anonymous Communication and Anonymous Cash | 61-73 |
1996 | crypto | New Results on Visual Cryptography | 401-415 |
1996 | crypto | Weakness in Some Threshold Cryptosystems | 74-82 |
1996 | eprint | Deniable Encryption | online |
1996 | eprint | On Monotone Function Closure of Statistical Zero-Knowledge | online |
1996 | eprint | Linear Zero-Knowledge - A note on Efficient Zero-Knowledge Proofs and Arguments | online |
1996 | eprint | Private Information Storage | online |
1996 | eprint | Upper bound on the communication complexity of private information retrieval | online |
1996 | eprint | Visual Cryptography II: Improving the Contrast Via the Cover Base | online |
1996 | eprint | Collision-Free Hashing from Lattice Problems | online |
1996 | eprint | Oblivious Transfers and Intersecting Codes | online |
1996 | eprint | On the Construction of Pseudo-Random Permutations: Luby-Rackoff Revisited | online |
1996 | eprint | Proactive RSA | online |
1996 | eprint | On the Contrast in Visual Cryptography Schemes | online |
1996 | eprint | The Graph Clustering Problem has a Perfect Zero-Knowledge Proof | online |
1996 | eprint | Verifiable Partial Key Escrow | online |
1996 | eprint | Public-Key Cryptosystems from Lattice Reduction Problems | online |
1996 | eurocrypt | Equivocable Oblivious Transfer | 119-130 |
1996 | eurocrypt | Robust Threshold DSS Signatures | 354-371 |
1996 | eurocrypt | Publicly Verifiable Secret Sharing | 190-199 |
1996 | eurocrypt | Efficient Multiplicative Sharing Schemes | 107-118 |
1996 | eurocrypt | The Security of the Gabidulin Public Key Cryptosystem | 212-223 |
1996 | eurocrypt | Generating EIGamal Signatures Without Knowing the Secret Key | 10-18 |
1996 | eurocrypt | Multi party secure protocols: past and present | |
1996 | eurocrypt | An Efficient Pseudo-Random Generator Provably as Secure as Syndrome Decoding | 245-255 |
1996 | eurocrypt | Auto-Correlations and New Bounds on the Nonlinearity of Boolean Functions | 294-306 |
1996 | eurocrypt | Fast Low Order Approximation of Cryptographic Functions | 268-282 |
1996 | eurocrypt | Optimum Secret Sharing Scheme Secure against Cheating | 200-211 |
1996 | eurocrypt | A Public Key Cryptosystem Based on Elliptic Curves over Z/nZ Equivalent to Factoring | 49-59 |
1996 | eurocrypt | Homomorphisms of Secret Sharing Schemes: A Tool for Verifiable Signature Sharing | 96-106 |
1996 | eurocrypt | On Diffie-Hellman Key Agreement with Short Exponents | 332-343 |
1996 | eurocrypt | Security Proofs for Signature Schemes | 387-398 |
1996 | eurocrypt | Finding a Small Root of a Univariate Modular Equation | 155-165 |
1996 | eurocrypt | Finding a Small Root of a Bivariate Integer Equation; Factoring with High Bits Known | 178-189 |
1996 | eurocrypt | Low-Exponent RSA with Related Messages | 1-9 |
1996 | eurocrypt | Hidden Fields Equations (HFE) and Isomorphisms of Polynomials (IP): Two New Families of Asymmetric Algorithms | 33-48 |
1996 | eurocrypt | Asymmetric Fingerprinting (Extended Abstract) | 84-95 |
1996 | eurocrypt | Construction of t-Resilient Functions over a Finite Alphabet | 283-293 |
1996 | eurocrypt | Multi-Autority Secret-Ballot Elections with Linear Work | 72-83 |
1996 | eurocrypt | Public Key Encryption and Signature Schemes Based on Polynomials over Zn | 60-71 |
1996 | eurocrypt | New Modular Multiplication Algorithms for Fast Modular Exponentiation | 166-177 |
1996 | eurocrypt | Advances in Cryptology - EUROCRYPT '96, International Conference on the Theory and Application of Cryptographic Techniques, Saragossa, Spain, May 12-16, 1996, Proceeding | online |
1996 | eurocrypt | On the Security of Two MAC Algorithms | 19-32 |
1996 | eurocrypt | On the Existence of Secure Feedback Registers (Extended Abstract) | 256-267 |
1996 | eurocrypt | The Exact Security of Digital Signatures - HOw to Sign with RSA and Rabin | 399-416 |
1996 | eurocrypt | On the Difficulty of Software Key Escrow | 237-244 |
1996 | eurocrypt | Non-Linear Approximations in Linear Cryptoanalysis | 224-236 |
1996 | eurocrypt | New Convertible Undeniable Signature Schemes | 372-386 |
1996 | eurocrypt | On the Security of a Practical Identification Scheme | 344-353 |
1996 | eurocrypt | Foiling Birthday Attacks in Length-Doubling Transformations - Benes: A Non-Reversible Alternative to Feistel | 307-320 |
1996 | eurocrypt | Session Key Distribution Using Smart Cards | 321-331 |
1996 | eurocrypt | Short Discrete Proofs | 131-142 |
1996 | eurocrypt | Designated Verifier Proofs and Their Applications | 143-154 |
1996 | fse | Truncated Differentials of SAFER | 15-26 |
1996 | fse | Attacks on the HKM/HFX Cryptosystem | 1-14 |
1996 | fse | Faster Luby-Rackoff Ciphers | 189-203 |
1996 | fse | New Structure of Block Ciphers with Provable Security against Differential and Linear Cryptanalysis | 205-218 |
1996 | fse | Fast Accumulated Hashing | 83-87 |
1996 | fse | Correlation Attacks on Stream Ciphers: Computing Low-Weight Parity Checks Based on Error-Correcting Codes | 159-172 |
1996 | fse | The Cipher SHARK | 99-111 |
1996 | fse | On the Weak Keys of Blowfish | 27-32 |
1996 | fse | Fast Software Encryption, Third International Workshop, Cambridge, UK, February 21-23, 1996, Proceedings | online |
1996 | fse | Unbalanced Feistel Networks and Block Cipher Design | 121-144 |
1996 | fse | A Comparison of Fast Correlation Attacks | 145-157 |
1996 | fse | TIGER: A Fast New Hash Function | 89-97 |
1996 | fse | Two Practical and Provably Secure Block Ciphers: BEARS and LION | 113-120 |
1996 | fse | Cryptanalysis of MD4 | 53-69 |
1996 | fse | RIPEMD-160: A Strengthened Version of RIPEMD | 71-82 |
1996 | fse | On the Security of Nonlinear Filter Generators | 173-188 |
1996 | fse | A Note on the Hash Function of Tillich and Zémor | 51-52 |
1996 | fse | High-Bandwidth Encryption with Low-Bandwidth Smartcards | 33-40 |
1996 | fse | ISAAC | 41-49 |
1996 | jofc | Certifying Permutations: Noninteractive Zero-Knowledge Based on Any Trapdoor Permutation | 149-166 |
1996 | jofc | A Secure Protocol for the Oblivious Transfer (Extended Abstract) | 191-195 |
1996 | jofc | Differential Cryptanalysis of Lucifer | 21-34 |
1996 | jofc | Bounds on Secret Key Exchange Using a Random Deal of Cards | 71-99 |
1996 | jofc | Joint Encryption and Message-Efficient Secure Computation | 217-232 |
1996 | jofc | How to Construct Constant-Round Zero-Knowledge Proof Systems for NP | 167-190 |
1996 | jofc | Correlation Properties of a General Binary Combiner with Memory | 111-126 |
1996 | jofc | Pseudorandom Generators and the Frequency of Simplicity | 251-261 |
1996 | jofc | Substitution-Permutation Networks Resistant to Differential and Linear Cryptanalysis | 1-19 |
1996 | jofc | Efficient Cryptographic Schemes Provably as Secure as Subset Sum | 199-216 |
1996 | jofc | A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity | 101-109 |
1996 | jofc | Guest Editor's Introduction | 127-128 |
1996 | jofc | Ideal Secret Sharing Schemes with Multiple Secrets | 233-250 |
1996 | jofc | The Power of Preprocessing in Zero-Knowledge Proofs of Knowledge | 129-148 |
1996 | jofc | On-Line/Off-Line Digital Signatures | 35-67 |