Results 21 to 30 of about 1,394 (186)
Universal Hashing for Information-Theoretic Security [PDF]
Proceedings of the IEEE, 2015 Corrected an error in the proof of Lemma ...
Himanshu Tyagi, Alexander Vardy
openaire +3 more sources
A Fast Single-Key Two-Level Universal Hash Function
IACR Transactions on Symmetric Cryptology, 2017 Universal hash functions based on univariate polynomials are well known, e.g. Poly1305 and GHASH. Using Horner’s rule to evaluate such hash functionsrequire l − 1 field multiplications for hashing a message consisting of l blocks where each block is one ...
Debrup Chakraborty +2 more
doaj +1 more source
Energy-efficient pipelined bloom filters for network intrusion detection [PDF]
, 2006 Software-based detection techniques are commonly used to identify the predefined signatures in network streams. However, the software-based techniques can not keep up with the speeds that network bandwidth increases.
Kocak, Taskin +5 more
core +1 more source
COST BENEFIT ANALYSIS OF COMPROMISING LEDGER SYSTEM BASED ON BLOCKCHAIN TECHNOLOGY
BizInfo, 2018 Modern application of the blockchain technology is the center of attention of technology and economy sectors. Proper usage of blockchain is based on peer to peer (P2P) network to coordinate a worldwide, universal ledger where all transactions on the ...
Edis Mekić +2 more
doaj +1 more source
Universal classes of hash functions
Journal of Computer and System Sciences, 1979 AbstractThis paper gives an input independent average linear time algorithm for storage and retrieval on keys. The algorithm makes a random choice of hash function from a suitable class of hash functions. Given any sequence of inputs the expected time (averaging over all functions in the class) to store and retrieve elements is linear in the length of ...
Larry Carter, Mark N. Wegman
openaire +2 more sources
Hashing algebraic methods [PDF]
, 2022 Дипломна робота являється проектом, в якому описуються методи та алгоритми хешування в криптографії. Наведено приклади їх реалізації. Метою роботи є аналіз існуючих та діючих алгебраїчних методів побудови хеш функцій, які служать насамперед для ...
Томілович, Наталія Василівна
core
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 +2 more sources
Bucket hashing with a small key size' [PDF]
, 1997 In this paper we consider very fast evaluation of strongly universal hash functions, or equivalently, authentication codes. We show how it is possible to modify some known families of hash functions into a form such that the evaluation is similar to ...
Johansson, Thomas,, Lund University.
core +3 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 +2 more sources
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
, 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,
Li, Bing-Hong +6 more
core +2 more sources