Results 71 to 80 of about 18,375 (213)
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
Hybrid Classical–Quantum Text Search Based on Hashing
MathematicsThe paper considers the problem of finding a given substring in a text. It is known that the complexity of a classical search query in an unordered database is linear in the length of the text and a given substring.
Farid Ablayev +2 more
doaj +1 more source
Corporate Social Responsibility and Environmental Management, Volume 33, Issue 1, Page 217-235, January 2026.ABSTRACT Despite the universal acknowledgment of financial profit expectations as an investment driver, environmental concern has been suggested as a factor influencing investors' decisions to purchase cryptocurrency. In this sense, this study investigates the impact of environmental information on investment allocation decisions to purchase different ...
Moritz Wendl +2 more
wiley +1 more source
Explainable AI With Imbalanced Learning Strategies for Blockchain Transaction Fraud Detection
Engineering Reports, Volume 8, Issue 1, January 2026.Research methodology pipeline for blockchain fraud detection. ABSTRACT Blockchain networks now support billions of dollars in daily transactions, making reliable and transparent fraud detection essential for maintaining user trust and financial stability.
Ahmed Abbas Jasim Al‐Hchaimi +2 more
wiley +1 more source
Psychology &Marketing, Volume 43, Issue 1, Page 175-193, January 2026.ABSTRACT Virtual reality (VR) is a promising new technology that has gained attention from industry and academia, focusing on immersing consumers in simulated services and experiences and, more recently, on recognizing the emerging trend of video watching using VR headsets.
Meng‐Hua Hsieh +2 more
wiley +1 more source
Simple proof of confidentiality for private quantum channels in noisy environments
, 2019 Complete security proofs for quantum communication protocols can be notoriously involved, which convolutes their verification, and obfuscates the key physical insights the security finally relies on.
Briegel, H. J. +4 more
core +1 more source
Beyond Supply and Demand: The Moral Economy of Price Formation in Slab City
Economic Anthropology, Volume 13, Issue 1, January 2026.ABSTRACT This article investigates the unique economic practices of Slab City, California, an off‐grid community that rejects mainstream US values. Despite operating within the broader US economic system, Slab City residents have developed alternative forms of exchange, using cigarettes and cannabis alongside US dollars.
Bailey C. Hauswurz
wiley +1 more source
6 Gbps real-time optical quantum random number generator based on vacuum fluctuation
, 2019 We demonstrate a 6 Gbps real-time optical quantum random number generator by measuring vacuum fluctuation. To address the common problem that speed gap exists between fast randomness generation and slow randomness extraction in most high-speed real-time ...
Guo, Hong +4 more
core +1 more source
(Not Surprising) Attacks on Recent Pairing‐Free Attribute‐Based Encryption Schemes
IET Information Security, Volume 2026, Issue 1, 2026.The fact that designing secure and efficient identity or attribute‐based encryption (ABE) schemes requires the use of specific algebraic tools like bilinear pairings or lattices is well known in the cryptographic community. However, some journals whose main topics are not cryptographic still publish papers proposing, for instance, ABE schemes in ...
Javier Herranz, Thomas Haines
wiley +1 more source
On the Theory of Spatial and Temporal Locality [PDF]
, 2005 This paper studies the theory of caching and temporal and spatial locality. We show the following results: (1) hashing can be used to guarantee that caches with limited associativity behave as well as fully associative cache; (2) temporal locality cannot
Snir, Marc, Yu, Jing
core