Publications related to Hash functions

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

Anne-Marie Kermarrec, Vincent Gramoli

We present the design, correctness, and analysis of SONDe, a simple fully decentralized object deployment algorithm for highly requested systems. Given an object (service or data), SONDe provides a node with a constant upper bound (h) on the number of logi ...

2008

A multiple birthday attack on NTRU

In this paper we view the possibilities to lance a multiple (iterative) birthday attack on NTRU. Recently Wagner's algorithm for the generalized birthday problem (Wagner, 2002) allowed to speed-up several combinatorial attacks. However, in the case of NTRU ...

Insticc-Inst Syst Technologies Information Control & Communication, Avenida D Manuel L, 27A 2 Esquerdo, Setubal, 2910-595, Portugal2008

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

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

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

Artificial Immune System For Collaborative Spam Filtering

Jean-Yves Le Boudec, Slavisa Sarafijanovic

Artificial immune systems (AIS) use the concepts and algorithms inspired by the theory of how the human immune system works. This document presents the design and initial evaluation of a new artificial immune system for collaborative spam filtering. Collab ...

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

Hash functions

Graph Chatbot

Chat with Graph Search

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

SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

3D: A Three-Dimensional Block Cipher

A multiple birthday attack on NTRU

On Routing in Distributed Hash Tables

Hash-and-Sign with Weak Hashing Made Secure

UniStore: Querying a DHT-based Universal Storage

Artificial Immune System For Collaborative Spam Filtering

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

An Optimal Non-Interactive Message Authentication Protocol

A multiple birthday attack on NTRU

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

SONDe, a Self-Organizing Object Deployment Algorithm in Large-Scale Dynamic Systems

3D: A Three-Dimensional Block Cipher

On Routing in Distributed Hash Tables

Hash-and-Sign with Weak Hashing Made Secure

UniStore: Querying a DHT-based Universal Storage

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

Artificial Immune System For Collaborative Spam Filtering

An Optimal Non-Interactive Message Authentication Protocol