Results 81 to 90 of about 945,337 (242)
Securing End‐To‐End Encrypted File Sharing Services With the Messaging Layer Security Protocol
Concurrency and Computation: Practice and Experience, Volume 37, Issue 27-28, 25 December 2025.ABSTRACT Secure file sharing is essential in today's digital environment, yet many systems remain vulnerable: if an attacker steals client keys, they can often decrypt both past and future content. To address this challenge, we propose a novel file‐sharing architecture that strengthens post‐compromise security while remaining practical.
Roland Helmich, Lars Braubach
wiley +1 more source
Designing Physical Unclonable Functions From Optically Active Materials
Advanced Materials, Volume 37, Issue 49, December 10, 2025.Assigning unforgeable “fingerprints” to manufactured goods is a key strategy to fight global counterfeiting. Optical physical unclonable functions (PUFs) are chemically generated random patterns of optically active materials serving as unique authenticators.
Maxime Klausen +2 more
wiley +1 more source
Business Strategy and the Environment, Volume 34, Issue 8, Page 10533-10550, December 2025.ABSTRACT This study explores the practical application of blockchain technology in accounting through a single case study of TLAB SCF, an Italian financial consulting firm actively involved in national and European digital innovation initiatives. The research adopts the technology acceptance model to investigate how perceived usefulness and perceived ...
Paolo Pietro Biancone +3 more
wiley +1 more source
Software Performance of Universal Hash Functions [PDF]
, 1999 This paper compares the parameters sizes and software performance of several recent constructions for universal hash functions: bucket hashing, polynomial hashing, Toeplitz hashing, division hashing, evaluation hashing, and MMH hashing. An objective comparison between these widely varying approaches is achieved by defining constructions that offer a ...
Nevelsteen, W., Preneel, Bart
openaire +2 more sources
A depth–spatial alignment method for multi‐source point clouds on large‐scale construction sites
Computer-Aided Civil and Infrastructure Engineering, Volume 40, Issue 29, Page 5719-5746, 9 December 2025.Abstract Three‐dimensional (3D) site models form the digital foundation for modern construction management. However, creating these models from multi‐source imagery presents two key challenges: accurately georeferencing camera poses during wide‐view acquisition and precisely aligning multiple point clouds that possess non‐uniform accuracy.
Tao Zhong +5 more
wiley +1 more source
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
Universal classes of hash functions (Extended Abstract) [PDF]
, 1977 J. Lawrence Carter, Mark N. Wegman
openalex +1 more source
Square Hash: Fast Message Authentication via Optimized Universal Hash Functions [PDF]
, 1999 This paper introduces two new ideas in the construction of fast universal hash functions geared towards the task of message authentication. First, we describe a simple but novel family of universal hash functions that is more efficient than many standard constructions. We compare our hash functions to the MMH family studied by Halevi and Krawczyk [12].
Mark Etzel +2 more
openaire +1 more source
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
Separating hash families with large universe
Journal of Combinatorial Theory, Series ASeparating hash families are useful combinatorial structures which generalize several well-studied objects in cryptography and coding theory. Let $p_t(N, q)$ denote the maximum size of universe for a $t$-perfect hash family of length $N$ over an alphabet of size $q$. In this paper, we show that $q^{2-o(1)}
Xin Wei, Xiande Zhang, Gennian Ge
openaire +3 more sources