Publications associées à Fonction de hachage

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Multi-Stream Hashing on the PlayStation 3

Joppe Willem Bos, Dag Arne Osvik, Nathalie Casati

With process technology providing more and more transistors per chip, still following Moore's \law", processor designers have used a number of techniques to make those transistors useful. Lately they have started placing multiple processor cores on each ch ...

Springer2008

LSH At Large - Distributed KNN Search in High Dimensions

Karl Aberer, Sebastian Michel, Parisa Haghani

We consider K-Nearest Neighbor search for high dimensional data in large-scale structured Peer-to-Peer networks. We present an efficient mapping scheme based on p-stable Locality Sensitive Hashing to assign hash buckets to peers in a Chord-style overlay ne ...

2008

Hybrid DHT Design for Mobile Environments

Simon Schubert, Zoran Despotovic

In this paper we present a hybrid design concept for Distributed Hash Tables (DHTs), in order to increase the performance of DHTs in scenarios with mobile participants. By defining two classes of nodes (static and temporary) and assigning critical overlay ...

Springer-Verlag2008

Hash-and-Sign with Weak Hashing Made Secure

Serge Vaudenay, Sylvain Pasini

Digital signatures are often proven to be secure in the random oracle model while hash functions deviate more and more from this idealization. Liskov proposed to model a weak hash function by a random oracle together with another oracle allowing to break s ...

Springer2007

On Routing in Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm, Sarunas Girdzijauskas

There have been many proposals for constructing routing tables for Distributed Hash Tables (DHT). They can be classified into two groups: A) those that assume that the peers are uniformly randomly distributed in the identifier space, and B) those that allo ...

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

Jean-Yves Le Boudec, Karl Aberer, Dejan Kostic, Fabius Klemm

Advanced applications for Distributed Hash Tables (DHTs), such as Peer-to-Peer Information Retrieval, require a DHT to quickly and efficiently process a large number (in the order of millions) of requests. In this paper we study mechanisms to optimize the ...

2007

An Optimal Non-Interactive Message Authentication Protocol

Serge Vaudenay, Sylvain Pasini

Vaudenay recently proposed a message authentication protocol which is interactive and based on short authenticated strings (SAS). We study here SAS-based non-interactive message authentication protocols (NIMAP). We start by the analysis of two popular non- ...

Springer2006

Fonction de hachage

Graph Chatbot

Chattez avec Graph Search

Multi-Stream Hashing on the PlayStation 3

3D: A Three-Dimensional Block Cipher

A high-performance distributed hash table for peer-to-peer information retrieval

LSH At Large - Distributed KNN Search in High Dimensions

Hybrid DHT Design for Mobile Environments

Hash-and-Sign with Weak Hashing Made Secure

On Routing in Distributed Hash Tables

UniStore: Querying a DHT-based Universal Storage

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

An Optimal Non-Interactive Message Authentication Protocol

On Routing in Distributed Hash Tables

Multi-Stream Hashing on the PlayStation 3

3D: A Three-Dimensional Block Cipher

Hash-and-Sign with Weak Hashing Made Secure

UniStore: Querying a DHT-based Universal Storage

A high-performance distributed hash table for peer-to-peer information retrieval

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

LSH At Large - Distributed KNN Search in High Dimensions

Hybrid DHT Design for Mobile Environments

An Optimal Non-Interactive Message Authentication Protocol