Cryptographers' World
 

CRYPTO 1996


[Sort by page number] [Sort by citations count]

 
Neal Koblitz, editor, Advances in Cryptology - CRYPTO '96, 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18-22, 1996, Proceedings. Springer, 1996. ISBN 3-540-61512-1.
[Papers]

Find this book on amazon.com , amazon.co.uk, amazon.ca, amazon.de, amazon.fr, Google Books or Wikipedia.



Mihir Bellare,  Ran Canetti,  Hugo Krawczyk,  Keying Hash Functions for Message Authentication, pp. 1 - 15, CRYPTO 1996.

[Electronic Edition][Cited 913 times Red StarRed StarRed StarRed Star]

Mustafa Atici,  Douglas R. Stinson,  Universal Hashing and Multiple Authentication, pp. 16 - 30, CRYPTO 1996.

[Electronic Edition][Cited 26 times ]

Tor Helleseth,  Thomas Johansson,  Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings, pp. 31 - 44, CRYPTO 1996.

[Electronic Edition][Cited 38 times ]

Jacques Patarin,  Asymmetric Cryptography with a Hidden Monomial, pp. 45 - 60, CRYPTO 1996.

[Electronic Edition][Cited 45 times ]

Daniel R. Simon,  Anonymous Communication and Anonymous Cash, pp. 61 - 73, CRYPTO 1996.

[Electronic Edition][Cited 68 times Red Star]

Susan K. Langford,  Weakness in Some Threshold Cryptosystems, pp. 74 - 82, CRYPTO 1996.

[Electronic Edition][Cited 36 times ]

Serge Vaudenay,  Hidden Collisions on DSS, pp. 83 - 88, CRYPTO 1996.

[Electronic Edition][Cited 52 times Red Star]

Adam Young,  Moti Yung,  The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?, pp. 89 - 103, CRYPTO 1996.

[Electronic Edition][Cited 75 times Red Star]

Paul C. Kocher,  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, pp. 104 - 113, CRYPTO 1996.

[Electronic Edition][Cited 1524 times Red StarRed StarRed StarRed StarRed Star]

Mats Näslund,  All Bits ax+b mod p are Hard (Extended Abstract), pp. 114 - 128, CRYPTO 1996.

[Electronic Edition][Cited 18 times ]

Dan Boneh,  Ramarathnam Venkatesan,  Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes, pp. 129 - 142, CRYPTO 1996.

[Electronic Edition][Cited 154 times Red StarRed Star]

Claus-Peter Schnorr,  Security of 2^t-Root Identification and Signatures, pp. 143 - 156, CRYPTO 1996.

[Electronic Edition][Cited 4 times ]

Rosario Gennaro,  Stanislaw Jarecki,  Hugo Krawczyk,  Tal Rabin,  Robust and Efficient Sharing of RSA Functions, pp. 157 - 172, CRYPTO 1996.

[Electronic Edition][Cited 229 times Red StarRed Star]

Ronald Cramer,  Ivan Damgard,  New Generation of Secure and Practical RSA-Based Signatures, pp. 173 - 185, CRYPTO 1996.

[Electronic Edition][Cited 65 times Red Star]

Markus Jakobsson,  Moti Yung,  Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers, pp. 186 - 200, CRYPTO 1996.

[Electronic Edition][Cited 30 times ]

Shai Halevi,  Silvio Micali,  Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing, pp. 201 - 215, CRYPTO 1996.

[Electronic Edition][Cited 95 times Red Star]

Lars R. Knudsen,  Willi Meier,  Improved Differential Attacks on RC5, pp. 216 - 228, CRYPTO 1996.

[Electronic Edition][Cited 60 times Red Star]

Paul C. van Oorschot,  Michael J. Wiener,  Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude, pp. 229 - 236, CRYPTO 1996.

[Electronic Edition][Cited 23 times ]

John Kelsey,  Bruce Schneier,  David Wagner,  Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES, pp. 237 - 251, CRYPTO 1996.

[Electronic Edition][Cited 176 times Red StarRed Star]

Joe Kilian,  Phillip Rogaway,  How to Protect DES Against Exhaustive Key Search, pp. 252 - 267, CRYPTO 1996.

[Electronic Edition][Cited 165 times Red StarRed Star]

Ueli M. Maurer,  Stefan Wolf,  Diffie-Hellman Oracles, pp. 268 - 282, CRYPTO 1996.

[Electronic Edition][Cited 67 times Red Star]

Dan Boneh,  Richard J. Lipton,  Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract), pp. 283 - 297, CRYPTO 1996.

[Electronic Edition][Cited 140 times Red StarRed Star]

Antoon Bosselaers,  René Govaerts,  Joos Vandewalle,  Fast Hashing on the Pentium, pp. 298 - 312, CRYPTO 1996.

[Electronic Edition][Cited 84 times Red Star]

Victor Shoup,  On Fast and Provably Secure Message Authentication Based on Universal Hashing, pp. 313 - 328, CRYPTO 1996.

[Electronic Edition][Cited 110 times Red StarRed Star]

R. J. Hughes,  G. G. Luther,  G. L. Morgan,  C. G. Peterson,  C. M. Simmons,  Quantum Cryptography over Underground Optical Fibers, pp. 329 - 342, CRYPTO 1996.

[Electronic Edition][Cited 47 times ]

Dominic Mayers,  Quantum Key Distribution and String Oblivious Transfer in Noisy Channels, pp. 343 - 357, CRYPTO 1996.

[Electronic Edition][Cited 84 times Red Star]

James L. Massey,  Shirlei Serconek,  Linear Complexity of Periodic Sequences: A General Theory, pp. 358 - 371, CRYPTO 1996.

[Electronic Edition][Cited 41 times ]

Paul Camion,  Anne Canteaut,  Generalization of Siegenthaler Inequality and Schnorr-Vaudenay Multipermutations, pp. 372 - 386, CRYPTO 1996.

[Electronic Edition][Cited 22 times ]

Carlo Blundo,  Luiz A. Frota Mattos,  Douglas R. Stinson,  Trade-offs Between Communication and Storage in Unconditionally Secure Schemes for Broadcast Encryption and Interactive Key Distribution, pp. 387 - 400, CRYPTO 1996.

[Electronic Edition][Cited 81 times Red Star]

Stefan Droste,  New Results on Visual Cryptography, pp. 401 - 415, CRYPTO 1996.

[Electronic Edition][Cited 133 times Red StarRed Star]



Database status:
3755 authors,
5428 conference papers from 177 conference proceedings,
559 journal papers from 8 journals
Highly Cited...