Results 21 to 30 of about 17,753 (215)
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Tyagi, Himanshu, Vardy, Alexander
openaire +4 more sources
Designing small universal k-mer hitting sets for improved analysis of high-throughput sequencing. [PDF]
PLoS Computational Biology, 2017 With the rapidly increasing volume of deep sequencing data, more efficient algorithms and data structures are needed. Minimizers are a central recent paradigm that has improved various sequence analysis tasks, including hashing for faster read overlap ...
Yaron Orenstein +4 more
doaj +1 more source
Hash Property and Fixed-Rate Universal Coding Theorems [PDF]
IEEE Transactions on Information Theory, 2010 submitted to IEEE Transactions on Information Theory, Mar. 2008.
Jun Muramatsu, Shigeki Miyake
openalex +5 more sources
Universal classes of hash functions (Extended Abstract) [PDF]
Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977 This paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of the ...
J. Lawrence Carter, Mark N. Wegman
openalex +3 more sources
Universal hashing and authentication codes [PDF]
Designs, Codes and Cryptography, 1994 In this paper (for a preliminary version see [Lect. Notes Comput. Sci. 576, 74-85 (1992; Zbl 0789.68050)]) the author studies the applications of universal hashing to the construction of unconditionally secure authentication codes without secrecy. He generalizes the construction given by \textit{M. N. Wegman} and \textit{J. L. Carter} [J. Comput. Syst.
openaire +4 more sources
Recursive n-gram hashing is pairwise independent, at best [PDF]
, 2010 Many applications use sequences of n consecutive symbols (n-grams). Hashing these n-grams can be a performance bottleneck. For more speed, recursive hash families compute hash values by updating previous values.
Carter +12 more
core +2 more sources
Lightweight MACs from Universal Hash Functions [PDF]
, 2020 Lightweight cryptography is a topic of growing importance, with the goal to secure the communication of low-end devices that are not powerful enough to use conventional cryptography. There have been many recent proposals of lightweight block ciphers, but comparatively few results on lightweight Message Authentication Codes (MACs). Therefore, this paper
Duval, Sébastien, Leurent, Gaëtan
openaire +3 more sources
COST BENEFIT ANALYSIS OF COMPROMISING LEDGER SYSTEM BASED ON BLOCKCHAIN TECHNOLOGY
BizInfo, 2018 Modern application of the blockchain technology is the center of attention of technology and economy sectors. Proper usage of blockchain is based on peer to peer (P2P) network to coordinate a worldwide, universal ledger where all transactions on the ...
Edis Mekić +2 more
doaj +1 more source
On Risks of Using Cuckoo Hashing with Simple Universal Hash Classes [PDF]
Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms, 2009 Cuckoo hashing, introduced by Pagh and Rodler [10], is a dynamic dictionary data structure for storing a set S of n keys from a universe U, with constant lookup time and amortized expected constant insertion time. For the analysis, space (2+e)n and Ω(log n)-wise independence of the hash functions is sufficient. In experiments mentioned in [10], several
Martin Dietzfelbinger, Ulf Schellbach
openaire +1 more source
Unconditional security from noisy quantum storage [PDF]
, 2011 We consider the implementation of two-party cryptographic primitives based on the sole assumption that no large-scale reliable quantum storage is available to the cheating party. We construct novel protocols for oblivious transfer and bit commitment, and
Koenig, Robert +2 more
core +1 more source