Open AccessProceedings Article
The MD5 Message-Digest Algorithm
Ronald L. Rivest
- Vol. 1321, pp 1-21
Reads0
Chats0
TLDR
This document describes the MD5 message-digest algorithm, which takes as input a message of arbitrary length and produces as output a 128-bit "fingerprint" or "message digest" of the input.Abstract:
This document describes the MD5 message-digest algorithm. The
algorithm takes as input a message of arbitrary length and produces as
output a 128-bit "fingerprint" or "message digest" of the input. This
memo provides information for the Internet community. It does not
specify an Internet standard.read more
Citations
More filters
Book ChapterDOI
Efficient scalable fair cash with off-line extortion prevention
TL;DR: This paper proposes a new efficient fair cash system which offers scalable security with respect to its efficiency and prevents extortion attacks, like blackmailing or the use of blindfolding protocols under off-line payments and with the involvement of the trustee only at registration of the users.
Journal ArticleDOI
Research: Secure and minimal protocols for authenticated key distribution
Philippe Janson,Gene Tsudik +1 more
TL;DR: A novel method for authenticated key distribution in the distributed systems environment is described, and a braiding technique for key distribution is introduced, which is shown to be resistant to a wide range of interleaving attacks.
Journal ArticleDOI
E-prints and the Open Archives Initiative.
TL;DR: A brief survey of OAI e-print repositories, and of services using metadata harvested from e‐print repositories using the OAI protocol for metadata harvesting (OAI‐PMH), and several situations where metadata harvesting may be used to further improve the utility of e‐ print archives as a component of the scholarly communication infrastructure are presented.
Book ChapterDOI
Securing the Destination-Sequenced Distance Vector Routing Protocol (S-DSDV)
TL;DR: This work proposes a secure routing protocol based on DSDV, namely S-DSDV, in which a well-behaved node can successfully detect a malicious routing update with any sequence number fraud and any distance fraud provided no two nodes are in collusion.
Anonymous routing in structured peer-to-peer overlays
Nikita Borissov,Eric Brewer +1 more
TL;DR: A novel methodology for studying the anonymity of peer-to-peer systems, based on an information-theoretic anonymity metric and simulation, is developed and a new design for peer- to-peer anonymous systems based on structured overlays is proposed, which provides anonymity competitive with Freenet in the average case, while ensuring that worst-case anonymity remains at an acceptable level.