Results 41 to 50 of about 914,695 (232)
Universal hashing and authentication codes [PDF]
Designs, Codes and Cryptography, 1994 In this paper, we study the application of universal hashing to the construction of unconditionally secure authentication codes without secrecy. This idea is most useful when the number of authenticators is exponentially small compared to the number of possible source states (plaintext messages).
openaire +3 more sources
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
Enhancing Extractable Quantum Entropy in Vacuum-Based Quantum Random Number Generator
Entropy, 2018 Information-theoretically provable unique true random numbers, which cannot be correlated or controlled by an attacker, can be generated based on quantum measurement of vacuum state and universal-hashing randomness extraction.
Xiaomin Guo +5 more
doaj +1 more source
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
Hash the Universe: Differentially Private Text Extraction with Feature Hashing
, 2022 Abstract Using artificial intelligence for text extraction can often require handling privacy-sensitive text. To avoid revealing confidential information, data owners and practitioners can use differential privacy, a definition of privacy with provable guarantees.
Sam Fletcher +2 more
openaire +1 more source
Separating hash families with large universe
, 2023 Separating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of universe for a $t$-perfect hash family of length $N$ over an alphabet of size $q$. In this paper, we show that $q^{2-o(1)}
Wei, Xin, Zhang, Xiande, Ge, Gennian
openaire +2 more sources
Electronic records long term authenticity and integrity demonstration
Knjižnica, 2011 Long term preservation of electronic data requires introduction of specific technology solutions and organizational measures in order to provide stable environment for electronic record preservation.
Helena Halas, Aljoša Jerman Blažič
doaj +1 more source
AuCPace: Efficient verifier-based PAKE protocol tailored for the IIoT
Transactions on Cryptographic Hardware and Embedded Systems, 2019 Increasingly connectivity becomes integrated in products and devices that previously operated in a stand-alone setting. This observation holds for many consumer applications in the so-called "Internet of Things" (IoT) as well as for corresponding ...
Björn Haase, Benoît Labrique
doaj +1 more source
IEEE Access, 2018 When executing a program or storing data in a medical Internet of Things (mIoT) system, physical side-channels analysis, such as recent-timing, cold-reboot, and virtual-machine attacks, might obtain partial information about internal sensitive medical ...
Mingwu Zhang +3 more
doaj +1 more source
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences, 1994 The idea of a universal class of hash functions is due to Carter and Wegman. The goal is to define a collection of hash functions in such a way that a random choice of a function in the class yields a low probability that any two distinct inputs will collide.
openaire +2 more sources