Results 41 to 50 of about 18,375 (213)
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
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
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
Postprocessing for quantum random number generators: entropy evaluation and randomness extraction
, 2013 Quantum random-number generators (QRNGs) can offer a means to generate information-theoretically provable random numbers, in principle. In practice, unfortunately, the quantum randomness is inevitably mixed with classical randomness due to classical ...
B. Chor +18 more
core +1 more source
Balanced Allocations and Double Hashing [PDF]
, 2014 Double hashing has recently found more common usage in schemes that use multiple hash functions. In double hashing, for an item $x$, one generates two hash values $f(x)$ and $g(x)$, and then uses combinations $(f(x) +k g(x)) \bmod n$ for $k=0,1,2,...$ to
Alon N. +7 more
core +1 more source
Iterative Universal Hash Function Generator for Minhashing [PDF]
, 2014 Minhashing is a technique used to estimate the Jaccard Index between two sets by exploiting the probability of collision in a random permutation. In order to speed up the computation, a random permutation can be approximated by using an universal hash function such as the $h_{a,b}$ function proposed by Carter and Wegman.
Fabrício Olivetti de França
openalex +3 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
Leftover Hashing Against Quantum Side Information
, 2010 The Leftover Hash Lemma states that the output of a two-universal hash function applied to an input with sufficiently high entropy is almost uniformly random.
Renner, Renato +3 more
core +1 more source
Securing Generative Artificial Intelligence with Parallel Magnetic Tunnel Junction True Randomness
Advanced Intelligent Systems, EarlyView.True random numbers can protect generative artificial intelligence (GAI) models from attacks. A highly parallel, spin‐transfer torque magnetic tunnel junction‐based system is demonstrated that generates high‐quality, energy‐efficient random numbers.
Youwei Bao, Shuhan Yang, Hyunsoo Yang
wiley +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