Results 141 to 150 of about 76,072 (189)
Some of the next articles are maybe not open access.
A Transparent Zero-Knowledge Dual Membership Set Commitment based on Perfect Hash Function
International Symposium on Computing and Networking - Across Practical Development and Theoretical ResearchVerifying a secret element’s (non-)membership status to a private set is challenging yet valuable for access control and verifiable computing applications.
Keyang Liu, Tsuyoshi Takagi
semanticscholar +1 more source
On the Size of Separating Systems and Families of Perfect Hash Functions
, 1984 Michael L. Fredman, János Komlós
openalex +2 more sources
The Quantum Resistant Cryptographic Algorithm Based on OTP Cipher and Hash Function
2024 IEEE International Conference on Consumer Electronics-Asia (ICCE-Asia)The article proposes a new quantum-resistant cryptographic algorithm constructed based on the OTP (One-Time Pad) cipher and a hash function. By inheriting the property of “perfect secrecy” from the OTP cipher, the proposed algorithm can resist various ...
L. H. Dung +3 more
semanticscholar +1 more source
Direct Perfect Hashing Functions for External Files
Journal of Database Management, 1991A file organization scheme based on composite perfect hashing, which guarantees single access retrieval from external files has been proposed recently. The ideal retrieval performance is achieved by using an auxiliary internal table and direct perfect hashing.
M.V. Ramakrishna, Yuchi Bannai
openaire +1 more source
Communications of the ACM, 1981
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +2 more sources
A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets. A proof of existence for minimal perfect hash functions of a special type (reciprocal type) is given.
openaire +2 more sources
Modern Minimal Perfect Hashing: A Survey
arXiv.orgGiven a set $S$ of $n$ keys, a perfect hash function for $S$ maps the keys in $S$ to the first $m \geq n$ integers without collisions. It may return an arbitrary result for any key not in $S$ and is called minimal if $m = n$.
Hans-Peter Lehmann +6 more
semanticscholar +1 more source
PtrHash: Minimal Perfect Hashing at RAM Throughput
The SeaGiven a set $K$ of $n$ keys, a minimal perfect hash function (MPHF) is a collision-free bijective map $\mathsf{H_{mphf}}$ from $K$ to $\{0, \dots, n-1\}$. This work presents a (minimal) perfect hash function that first prioritizes query throughput, while
R. G. Koerkamp
semanticscholar +1 more source
An Interactive System for Finding Perfect Hash Functions
IEEE Software, 1985The interactive implementation of this hash function algorithm presents several examples of large lexicon design, illustrating how the minimality criterion and execution efficiency can vary when various problem parameters are adjusted.
N. Cercone, J. Boates, M. Krause
openaire +1 more source
MorphisHash: Improving Space Efficiency of ShockHash for Minimal Perfect Hashing
Embedded Systems and ApplicationsA minimal perfect hash function (MPHF) maps a set of n keys to unique positions {1, ..., n}. Representing an MPHF requires at least 1.44 bits per key. ShockHash is a technique to construct an MPHF and requires just slightly more space.
Stefan Hermann
semanticscholar +1 more source
PHOBIC: Perfect Hashing with Optimized Bucket Sizes and Interleaved Coding
Embedded Systems and ApplicationsA minimal perfect hash function (MPHF) maps a set of n keys to {1, ..., n} without collisions. Such functions find widespread application e.g. in bioinformatics and databases.
Stefan Hermann +4 more
semanticscholar +1 more source