Results 171 to 180 of about 914,695 (232)
Some of the next articles are maybe not open access.
Quantum hashing via ∈-universal hashing constructions and classical fingerprinting
Lobachevskii Journal of Mathematics, 2015© 2015, Pleiades Publishing, Ltd. In the paper, we define the concept of the quantum hash generator and offer design, which allows to build a large amount of different quantum hash functions. The construction is based on composition of classical ∈-universal hash family and a given family of functions-quantum hash generator.
Ablayev F., Ablayev M.
openaire +5 more sources
FUZZY UNIVERSAL HASHING AND APPROXIMATE AUTHENTICATION
Discrete Mathematics, Algorithms and Applications, 2011Traditional data authentication systems are sensitive to single bit changes and so are unsuitable for message spaces that are naturally "fuzzy" where "similar" messages are considered "the same" or indistinguishable. In this paper, we study unconditionally secure approximate authentication.
Safavi-Naini, Rei, Tonien, Joseph
openaire +4 more sources
Energy Scalable Universal Hashing
IEEE Transactions on Computers, 2005Message authentication codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a universal hash function (NH) which was explored in the construction of UMAC. In this paper, we use a variation on NH called WH. WH reaches optimally in the sense that it is universal with half the hash length of NH and it achieves ...
K. Yuksel, Berk Sunar, Jens-Peter Kaps
openaire +3 more sources
Quantum Hashing via ε-Universal Hashing Constructions and Freivalds’ Fingerprinting Schemas
Workshop on Descriptional Complexity of Formal Systems, 2014We define the concept of a quantum hash generator and offer a design, which allows one to build a large number of different quantum hash functions. The construction is based on composition of a classical ε-universal hash family and a given family of functions - quantum hash generators.
Marat Ablayev, Farid Ablayev
openaire +5 more sources
Reducing DRAM Refresh Rate Using Retention Time Aware Universal Hashing Redundancy Repair
ACM Trans. Design Autom. Electr. Syst., 2019As the device capacity of Dynamic Random Access Memory (DRAM) increases, refresh operation becomes a significant contributory factor toward total power consumption and memory throughput of the device.
Kyu Hyun Choi +3 more
semanticscholar +1 more source
Introduction to Coding Theory, 2018
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in
Juergen Bierbrauer
semanticscholar +1 more source
Using universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain mathematical property (see definition below). This guarantees a low number of collisions in
Juergen Bierbrauer
semanticscholar +1 more source
Universal hash functions for an infinite universe and hash trees
Information Processing Letters, 2009In this note we describe the adaptation of the universal hashing idea to an infinite universe, and to prefix hash trees. These are a structure underlying all extendible hash methods, which have up to now only been studied under the uniform hashing assumption.
openaire +2 more sources
Exploring Targeted Universal Adversarial Attack for Deep Hashing
IEEE International Conference on Acoustics, Speech, and Signal ProcessingAlthough image-dependent adversarial attacks have been studied, the more challenging image-agnostic adversarial attack for deep hashing remains an unexplored territory. In this paper, we take the first attempt on the more efficient and malicious targeted
Fei Zhu +5 more
semanticscholar +1 more source