Concept
Arbre de Merkle
Publications associées (9)
A Gapless Post-quantum Hash Proof System in the Hamming Metric
Serge Vaudenay, Bénédikt Minh Dang Tran
A hash proof system (HPS) is a form of implicit proof of membership to a language. Out of the very few existing post-quantum HPS, most are based on languages of ciphertexts of code-based or lattice-based cryptosystems and inherently suffer from a gap cause ...
2023Improving Stateless Hash-Based Signatures
present several optimizations to SPHINCS, a stateless hash-based signature scheme proposed by Bernstein et al. in (2015): PORS, a more secure variant of the HORS few-time signature scheme used in SPHINCS; secret key caching, to speed-up signing and reduce ...
SPRINGER INTERNATIONAL PUBLISHING AG2018SECTOR: Secure Tracking of Node Encounters in Multi-hop Wireless Networks
Jean-Pierre Hubaux, Levente Buttyan, Srdan Capkun
In this paper we present SECTOR, a set of mechanisms for the secure verification of the time of encounters between nodes in multi-hop wireless networks. This information can be used notably to prevent wormhole attacks (without requiring any clock synchroni ...
2003Using Random Subsets to Build Scalable Network Services
In this paper, we argue that a broad range of large-scale network services would benefit from a scalable mechanism for delivering state about a random subset of global participants. Key to this approach is ensuring that membership in the subset changes per ...
2003Scalable Data Access in Peer-to-Peer Systems Using Unbalanced Search Trees
With the appearance of Peer-to-Peer information systems the interest in scalable and decentralized data access structures is attracting increasingly interest. We propose to that end P-Grid, a scalable data access structure resulting from the distribution o ...
2002Ideal Hash Trees
Hash Trees with nearly ideal characteristics are described. These Hash Trees require no initial root hash table yet are faster and use significantly less space than chained or double hash trees. Insert, search and delete times are small and constant, indep ...
2001Fast And Space Efficient Trie Searches
Searching and traversing m-way trees using tries is a well known and broadly used technique. Three algorithms are presented, two have constant insert, search and delete cost, are faster than Hash Trees and can be searched twice as quickly cas Ternary Searc ...
2000Black box cryptanalysis of hash networks based on multipermutations
Black box cryptanalysis applies to hash algorithms consisting of many small boxes, connected by a known graph structure, so that the boxes can be evaluated forward and backwards by given oracles. We study attacks that work for any choice of the black boxes ...
1995One-Time Identification with Low Memory
In this paper, a practical cryptosystem based on an authentication tree is described. It is an extension of Ralph Merkle's results. The security of the system depends on assumptions on a one-way function . This cryptosystem allows to make interactive proof ...
Springer1993