[HTML][HTML] HMAC: Keyed-hashing for message authentication
RFC 2104: HMAC: Keyed-Hashing for Message Authentication [RFC Home] [TEXT|PDF|HTML]
[Tracker] [IPR] [Errata] [Info page] INFORMATIONAL Updated by: 6151 Errata Exist Network …
[Tracker] [IPR] [Errata] [Info page] INFORMATIONAL Updated by: 6151 Errata Exist Network …
Key agreement protocols and their security analysis
S Blake-Wilson, D Johnson, A Menezes - IMA international conference on …, 1997 - Springer
This paper proposes new protocols for two goals: authenticated key agreement and
authenticated key agreement with key confirmation in the asymmetric (public-key) setting. A …
authenticated key agreement with key confirmation in the asymmetric (public-key) setting. A …
[PDF][PDF] Secure names for bit-strings
S Haber, WS Stornetta - Proceedings of the 4th ACM Conference on …, 1997 - dl.acm.org
Having the author or publisher of a document compute a digital signature for its bit-string
content is a reasonable use of cryptographic tools for this purpose.(See, for example,[R 95 …
content is a reasonable use of cryptographic tools for this purpose.(See, for example,[R 95 …
A new paradigm for collision-free hashing: Incrementality at reduced cost
M Bellare, D Micciancio - International Conference on the Theory and …, 1997 - Springer
We present a simple, new paradigm for the design of collision-free hash functions. Any
function emanating from this paradigm is incremental.(This means that if a message x which …
function emanating from this paradigm is incremental.(This means that if a message x which …
RFC2104: HMAC: Keyed-hashing for message authentication
This document describes HMAC, a mechanism for message authentication using
cryptographic hash functions. HMAC can be used with any iterative cryptographic hash …
cryptographic hash functions. HMAC can be used with any iterative cryptographic hash …
Collision-resistant hashing: Towards making UOWHFs practical
Recent attacks on the cryptographic hash functions MD4 and MD5 make it clear that (strong)
collision-resistance is a hard-toachieve goal. We look towards a weaker notion, the …
collision-resistance is a hard-toachieve goal. We look towards a weaker notion, the …
Secure applications of low-entropy keys
Secure applications of low-entropy keys Page 1 Secure Applications of Low-Entropy Keys John
Kelsey Bruce Schneier Chris Hall Counterpane Systems 101 E. Minnehaha Parkway …
Kelsey Bruce Schneier Chris Hall Counterpane Systems 101 E. Minnehaha Parkway …
Practice-oriented provable-security
M Bellare - International workshop on information security, 1997 - Springer
This short article is intended to complement my invited talk at this conference. 1 I would like
to try to introduce you to a certain, relatively new, sub-area of cryptography that we have …
to try to introduce you to a certain, relatively new, sub-area of cryptography that we have …
On the existence of statistically hiding bit commitment schemes and fail-stop signatures
IB Damgård, TP Pedersen, B Pfitzmann - Journal of Cryptology, 1997 - Springer
We show that the existence of a statistically hiding bit commitment scheme with
noninteractive opening and public verifiability implies the existence of fail-stop signatures …
noninteractive opening and public verifiability implies the existence of fail-stop signatures …
Fail-stop signatures
TP Pedersen, B Pfitzmann - SIAM Journal on Computing, 1997 - SIAM
Fail-stop signatures can briefly be characterized as digital signatures that allow the signer to
prove that a given forged signature is indeed a forgery. After such a proof has been …
prove that a given forged signature is indeed a forgery. After such a proof has been …