Results 81 to 90 of about 18,375 (213)
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.
Mansour, Yishay +2 more
openaire +1 more source
The Myths of Blockchain Governance
Corporate Governance: An International Review, Volume 34, Issue 1, Page 154-162, January 2026.ABSTRACT Research Question/Issue Blockchain technology promises to revolutionize governance through strong commitments, trustlessness, and transparency. This paper examines how these promises have failed to materialize in practice. Research Findings/Insights Drawing on case evidence from major blockchains, including Bitcoin and Ethereum, I argue that ...
Daniel Ferreira
wiley +1 more source
Combinatorial techniques for universal hashing
Journal of Computer and System Sciences, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Fundamental &Clinical Pharmacology, Volume 40, Issue 1, January 2026.ABSTRACT Background DEEPSARC, one of the first projects running on the Health Data Hub, aimed to identify real‐life treatment regimens that could improve overall survival. The project is based on matching the national database of the sarcoma reference network with the SNDS.
Erwan Drezen +12 more
wiley +1 more source
Dual Universality of Hash Functions and Its Applications to Quantum Cryptography [PDF]
, 2013 T. Tsurumaru, M. Hayashi
openalex +2 more sources
Improved Densification of One Permutation Hashing [PDF]
, 2014 The existing work on densification of one permutation hashing reduces the query processing cost of the $(K,L)$-parameterized Locality Sensitive Hashing (LSH) algorithm with minwise hashing, from $O(dKL)$ to merely $O(d + KL)$, where $d$ is the number of ...
Li, Ping, Shrivastava, Anshumali
core
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;
openaire +1 more source
Universal classes of hash functions (Extended Abstract) [PDF]
, 1977 J. Lawrence Carter, Mark N. Wegman
openalex +1 more source
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
, 2023 Bing-Hong Li +6 more
openalex +1 more source