Results 1 - 10 of 5,010

A Scalable Content-Addressable Network

by Sylvia Ratnasamy , Paul Francis, Mark Handley, Richard Karp, Scott Shenker - IN PROC. ACM SIGCOMM 2001 , 2001
"... Hash tables – which map “keys ” onto “values” – are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distributed infra ..."
Abstract - Cited by 3371 (32 self) - Add to MetaCart
infrastructure that provides hash table-like functionality on Internet-like scales. The CAN is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation.

Keying hash functions for message authentication

by Mihir Bellare, Ran Canetti, Hugo Krawczyk , 1996
"... The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new cons ..."
Abstract - Cited by 611 (39 self) - Add to MetaCart
The use of cryptographic hash functions like MD5 or SHA for message authentication has become a standard approach inmanyInternet applications and protocols. Though very easy to implement, these mechanisms are usually based on ad hoc techniques that lack a sound security analysis. We present new

unknown title

by Ley Richard Karp
"... be equally valuable to large distributed systems. In this paper, we intro-duce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-likescales. The CAN is scalable, fault-tolerant and completely self-organizing, an ..."
Abstract - Add to MetaCart
be equally valuable to large distributed systems. In this paper, we intro-duce the concept of a Content-Addressable Network (CAN) as a distributed infrastructure that provides hash table-like functionality on Internet-likescales. The CAN is scalable, fault-tolerant and completely self

A Scalable Content-Addressable Network

by Ley Richard Karp, Scott Shenker - Proceedings of the ACM SIGCOMM Conference 2001 , 2001
"... Hash tables { which map\keys " onto \values " { are an essential building block in modern software systems. We believe a similar functionality would be equally valuable to large distributed systems. In this paper, we introduce the concept of a Content-Addressable Network (CAN) as a distri ..."
Abstract - Cited by 18 (0 self) - Add to MetaCart
distributed infrastructure that provides hash table-like functionality onInternet-like scales. The CAN design is scalable, fault-tolerant and completely self-organizing, and we demonstrate its scalability, robustness and low-latency properties through simulation. 1.

HMAC: Keyed-Hashing for Message Authentication

by H. Krawczyk, M. Bellare, R. Canetti , 1997
"... This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any iterative ..."
Abstract - Cited by 452 (4 self) - Add to MetaCart
This memo provides information for the Internet community. This memo does not specify an Internet standard of any kind. Distribution of this memo is unlimited. This document describes HMAC, a mechanism for message authentication using cryptographic hash functions. HMAC can be used with any

Consistent hashing and random trees: Distributed caching protocols for relieving hot spots on the World Wide Web

by David Karger, Eric Lehman, Tom Leighton, Matthew Levine, Daniel Lewin, Rina Panigrahy - IN PROC. 29TH ACM SYMPOSIUM ON THEORY OF COMPUTING (STOC , 1997
"... We describe a family of caching protocols for distrib-uted networks that can be used to decrease or eliminate the occurrence of hot spots in the network. Our protocols are particularly designed for use with very large networks such as the Internet, where delays caused by hot spots can be severe, and ..."
Abstract - Cited by 699 (10 self) - Add to MetaCart
of existing resources, and scale gracefully as the network grows. Our caching protocols are based on a special kind of hashing that we call consistent hashing. Roughly speaking, a consistent hash function is one which changes minimally as the range of the function changes. Through the development of good

Efficient implementation of a BDD package

by Karl S. Brace, Richard L. Rudell, Randal E. Bryant - In Proceedings of the 27th ACM/IEEE conference on Design autamation , 1991
"... Efficient manipulation of Boolean functions is an important component of many computer-aided design tasks. This paper describes a package for manipulating Boolean functions based on the reduced, ordered, binary decision diagram (ROBDD) representation. The package is based on an efficient implementat ..."
Abstract - Cited by 504 (9 self) - Add to MetaCart
implementation of the if-then-else (ITE) operator. A hash table is used to maintain a strong carwnical form in the ROBDD, and memory use is improved by merging the hash table and the ROBDD into a hybrid data structure. A memory funcfion for the recursive ITE algorithm is implemented using a hash-based cache

Greedy Randomized Adaptive Search Procedures

by Mauricio G. C. Resende , Celso C. Ribeiro , 2002
"... GRASP is a multi-start metaheuristic for combinatorial problems, in which each iteration consists basically of two phases: construction and local search. The construction phase builds a feasible solution, whose neighborhood is investigated until a local minimum is found during the local search phas ..."
Abstract - Cited by 647 (82 self) - Add to MetaCart
solution construction mechanisms and techniques to speed up the search are also described: Reactive GRASP, cost perturbations, bias functions, memory and learning, local search on partially constructed solutions, hashing, and filtering. We also discuss in detail implementation strategies of memory

SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Networks

by Yih-Chun Hu, David B. Johnson, Adrian Perrig , 2003
"... An ad hoc network is a collection of wireless computers (nodes), communicating among themselves over possibly multihop paths, without the help of any infrastructure such as base stations or access points. Although many previous ad hoc network routing protocols have been based in part on distance vec ..."
Abstract - Cited by 534 (8 self) - Add to MetaCart
. In order to support use with nodes of limited CPU processing capability, and to guard against Denial-of-Service attacks in which an attacker attempts to cause other nodes to consume excess network bandwidth or processing time, we use efficient one-way hash functions and do not use asymmetric cryptographic

A logic of authentication

by Michael Burrows, Martín Abadi, Roger Needham - ACM TRANSACTIONS ON COMPUTER SYSTEMS , 1990
"... Questions of belief are essential in analyzing protocols for the authentication of principals in distributed computing systems. In this paper we motivate, set out, and exemplify a logic specifically designed for this analysis; we show how various protocols differ subtly with respect to the required ..."
Abstract - Cited by 1332 (22 self) - Add to MetaCart
for the use of hash functions in signatures. The final sections contain a formal semantics of the logic and some conclusions.
Results 1 - 10 of 5,010