Search from the table of contents of 2.5 million books
Advanced Search (Beta)
Home > Advances in Cryptology — CRYPTO ’96: 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings > Keying Hash Functions for Message Authentication
Advances in Cryptology — CRYPTO ’96: 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings |
Neal Koblitz
Springer Berlin Heidelberg
Advances in Cryptology — CRYPTO ’96: 16th Annual International Cryptology Conference, Santa Barbara, California, USA, August 18–22, 1996, Proceedings
Keying Hash Functions for Message Authentication
Authors

Mihir Bellare; Ran Canetti; Hugo Krawczyk

ARI Id

1664257246610_951024

Access

Not Available Free

Pages

1-15

DOI

10.1007/3-540-68697-5_1

Chapter URL

https://rd.springer.com/chapter/10.1007/3-540-68697-5_1

Table of Contents of Book
Showing 1 to 20 of 32 entries
Chapters/HeadingsAuthor(s)PagesInfo
Front Matter
I-XII
Keying Hash Functions for Message Authentication
Mihir Bellare; Ran Canetti; Hugo Krawczyk
1-15
Universal Hashing and Multiple Authentication
M. Atici; D. R. Stinson
16-30
Universal Hash Functions from Exponential Sums over Finite Fields and Galois Rings
Tor Helleseth; Thomas Johansson
31-44
Asymmetric Cryptography with a Hidden Monomial
Jacques Patarin
45-60
Anonymous Communication and Anonymous Cash
Daniel R. Simon
61-73
Weaknesses in Some Threshold Cryptosystems
Susan K. Langford
74-82
Hidden Collisions on DSS
Serge Vaudenay
83-88
The Dark Side of “Black-Box” Cryptography or: Should We Trust Capstone?
Adam Young; Moti Yung
89-103
Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems
Paul C. Kocher
104-113
All Bits in ax + b mod p are Hard
Mats Näslund
114-128
Hardness of Computing the Most Significant Bits of Secret Keys in Diffie-Hellman and Related Schemes
Dan Boneh; Ramarathnam Venkatesan
129-142
Security of 2t-Root Identification and Signatures
C. P. Schnorr
143-156
Robust and Efficient Sharing of RSA Functions
Rosario Gennaro; Stanisław Jarecki; Hugo Krawczyk; Tal Rabin
157-172
New Generation of Secure and Practical RSA-Based Signatures
Ronald Cramer; Ivan Damgård
173-185
Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers
Markus Jakobsson; Moti Yung
186-200
Practical and Provably-Secure Commitment Schemes from Collision-Free Hashing
Shai Halevi; Silvio Micali
201-215
Improved Differential Attacks on RC5
Lars R. Knudsen; Willi Meier
216-228
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
Paul C. van Oorschot; Michael J. Wiener
229-236
Key-Schedule Cryptanalysis of IDEA, G-DES, GOST, SAFER, and Triple-DES
John Kelsey; Bruce Schneier; David Wagner
237-251
Chapters/HeadingsAuthor(s)PagesInfo
Showing 1 to 20 of 32 entries
Similar Books
Similar Chapters
Similar Thesis

Similar News

Similar Articles
Similar Article Headings