Results 21 to 30 of about 924,323 (216)
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
Physical Review Applied, 2023 Quantum digital signatures (QDS), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee non-repudiation, authenticity, and integrity of messages. Recently, one-time universal hashing QDS framework,
Bing-Hong Li +6 more
semanticscholar +1 more source
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels’ Statistics are Uncertain [PDF]
IEEE Transactions on Information Forensics and Security, 2020 We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models.
Rémi A. Chou
semanticscholar +1 more source
UMAC: Message Authentication Code using Universal Hashing [PDF]
Request for Comments, 2006 Ted Krovetz
openalex +2 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
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
Topological Quantum Gate Construction by Iterative Pseudogroup Hashing
, 2010 We describe the hashing technique to obtain a fast approximation of a target quantum gate in the unitary group SU(2) represented by a product of the elements of a universal basis.
Burrello, Michele +2 more
core +1 more source
Expanding the Family of Grassmannian Kernels: An Embedding Perspective
, 2014 Modeling videos and image-sets as linear subspaces has proven beneficial for many visual recognition tasks. However, it also incurs challenges arising from the fact that linear subspaces do not obey Euclidean geometry, but lie on a special type of ...
B. Kulis +10 more
core +1 more source