Results 11 to 20 of about 924,323 (216)

Construction of universal one-way hash functions: Tree hashing revisited

Discrete Applied Mathematics, 2007
AbstractWe present a binary tree based parallel algorithm for extending the domain of a universal one-way hash function (UOWHF). For t⩾2, our algorithm extends the domain from the set of all n-bit strings to the set of all ((2t-1)(n-m)+m)-bit strings, where m is the length of the message digest. The associated increase in key length is 2m bits for t=2;
Palash Sarkar
openalex   +3 more sources

Inaccessible Entropy II: IE Functions and Universal One-Way Hashing [PDF]

Theory of Computing, 2021
This paper uses a variant of the notion of inaccessible entropy (Haitner, Reingold, Vadhan and Wee, STOC 2009), to give an alternative construction and proof for the fundamental result, first proved by Rompel (STOC 1990), that Universal One-Way Hash ...
Iftach Haitner, Thomas Holenstein, Omer Reingold, Salil Vadhan, Hoeteck Wee   +4 more
openalex   +3 more sources

Once and for All: Universal Transferable Adversarial Perturbation against Deep Hashing-Based Facial Image Retrieval

AAAI Conference on Artificial Intelligence
Deep Hashing (DH)-based image retrieval has been widely applied to face-matching systems due to its accuracy and efficiency. However, this convenience comes with an increased risk of privacy leakage.
Long Tang, Dengpan Ye, Yunna Lv, Chuanxi Chen, Yunming Zhang   +4 more
openalex   +3 more sources

The universality of iterated hashing over variable-length strings

Discrete Applied Mathematics, 2011
Iterated hash functions process strings recursively, one character at a time. At each iteration, they compute a new hash value from the preceding hash value and the next character. We prove that iterated hashing can be pairwise independent, but never 3-wise independent. We show that it can be almost universal over strings much longer than the number of
Daniel Lemire
openalex   +5 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 ...
J.Lawrence Carter, Mark N. Wegman
openalex   +4 more sources

Hashing practice: analysis of hashing and universal hashing

ACM SIGMOD Record, 1988
Much of the literature on hashing deals with overflow handling (collision resolution) techniques and its analysis. What does all the analytical results mean in practice and how can they be achieved with practical files? This paper considers the problem of achieving analytical performance of hashing techniques in practice with reference to successful ...
M. Ramakrishna
openalex   +3 more sources

Hash Property and Fixed-Rate Universal Coding Theorems [PDF]

IEEE Transactions on Information Theory, 2010
submitted to IEEE Transactions on Information Theory, Mar. 2008.
Jun Muramatsu, Shigeki Miyake
openalex   +5 more sources

Universal classes of hash functions (Extended Abstract) [PDF]

Proceedings of the ninth annual ACM symposium on Theory of computing - STOC '77, 1977
This 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 the ...
J. Lawrence Carter, Mark N. Wegman
openalex   +3 more sources

Invertible Universal Hashing and the TET Encryption Mode [PDF]

Annual International Cryptology Conference, 2007
This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2n and associated data of arbitrary length.
S. Halevi
semanticscholar   +3 more sources

An Ordered Universal Accumulator Based on a Hash Chain

Applied Sciences
Cryptographic accumulators are now fundamental for secure applications across blockchain, IoT, and big data, powering anonymous credentials, streamlining key management, and enabling efficient data filtering. However, existing accumulator methods, like RSA, bilinear pairing, and Merkle trees, are hampered by storage bloat, computational burdens, and ...
Wenbao Jiang, Jinquan Li, Yangnan Guo, Haibao Zhang   +3 more
openalex   +3 more sources