Results 31 to 40 of about 924,323 (216)

A Case-Based Reasoning Method for Locating Evidence During Digital Forensic Device Triage [PDF]

open access: yes, 2014
The role of triage in digital forensics is disputed, with some practitioners questioning its reliability for identifying evidential data. Although successfully implemented in the field of medicine, triage has not established itself to the same degree in ...
Horsman, Graeme   +2 more
core   +1 more source

Postprocessing for quantum random number generators: entropy evaluation and randomness extraction

open access: yes, 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

Combinatorial techniques for universal hashing

open access: yesJournal of Computer and System Sciences, 1994
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +3 more sources

On an almost-universal hash function family with applications to authentication and secrecy codes [PDF]

open access: yes, 2017
Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH$^*$, which was shown to be $\Delta$-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family.
Bibak, Khodakhast   +3 more
core   +1 more source

Leftover Hashing Against Quantum Side Information

open access: yes, 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

Balanced Allocations and Double Hashing [PDF]

open access: yes, 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

Hash the Universe: Differentially Private Text Extraction with Feature Hashing

open access: yes, 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

Illuminating Advances in Materials: Optical Physical Unclonable Functions for Security Applications

open access: yesAdvanced Optical Materials, EarlyView.
This review highlights Optical Physical Unclonable Functions (OPUFs) as secure, light‐driven authentication tools. It surveys material platforms including optical fibers, low‐dimensional materials, luminophores, plasmonic nanoparticles and rare earth OPUFs systems.
Syeda Ramsha Ali   +4 more
wiley   +1 more source

Simple Tabulation, Fast Expanders, Double Tabulation, and High Independence

open access: yes, 2013
Simple tabulation dates back to Zobrist in 1970. Keys are viewed as c characters from some alphabet A. We initialize c tables h_0, ..., h_{c-1} mapping characters to random hash values.
Thorup, Mikkel
core   +1 more source

Harnessing Blockchain for Sustainable Business Strategy: A Case Study on Enhancing Accounting Practices

open access: yesBusiness Strategy and the Environment, EarlyView.
ABSTRACT This study explores the practical application of blockchain technology in accounting through a single case study of TLAB SCF, an Italian financial consulting firm actively involved in national and European digital innovation initiatives. The research adopts the technology acceptance model to investigate how perceived usefulness and perceived ...
Paolo Pietro Biancone   +3 more
wiley   +1 more source

Home - About - Disclaimer - Privacy