Results 1 to 10 of about 1,085 (134)
Variationally universal hashing [PDF]
Information Processing Letters, 2006 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ted Krovetz, Phillip Rogaway
exaly +3 more sources
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
The computational complexity of universal hashing
Proceedings of the twenty-second annual ACM symposium on Theory of computing - STOC '90, 1990 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Yishay Mansour +2 more
openaire +2 more sources
Universal Hashing and Multiple Authentication [PDF]
, 1996 In this paper, we study unconditionally secure codes that provide authentication without secrecy. Our point of view is the universal hashing approach pioneered by Wegman and Carter in 1981. We first compare several recent universal-hashing based constructions for authentication codes.
Mustafa Atici, Douglas R. Stinson
openaire +1 more source
Strongly Universal String Hashing is Fast [PDF]
The Computer Journal, 2013 We present fast strongly universal string hashing families: they can process data at a rate of 0.2 CPU cycle per byte. Maybe surprisingly, we find that these families---though they require a large buffer of random numbers---are often faster than popular hash functions with weaker theoretical guarantees.
Lemire, Daniel, Kaser, Owen
openaire +4 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
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
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
CSR And Bank Performance: Does Institutional Ownership Matter in the Context of an Emerging Market?
Corporate Social Responsibility and Environmental Management, EarlyView.ABSTRACT The question of whether institutional ownership (IO) strengthens the effect of corporate social responsibility (CSR) on financial performance (FP) remains underexplored in literature. This study examines the moderating role of IO in the CSR–FP relationship within an emerging market context, drawing on the stakeholder, agency, and stewardship ...
Kwabena Agyarko Gyekye +1 more
wiley +1 more source
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 +2 more sources