Results 71 to 80 of about 44,375 (171)

Attacks on quantum key distribution protocols that employ non-ITS authentication

open access: yes, 2015
We demonstrate how adversaries with unbounded computing resources can break Quantum Key Distribution (QKD) protocols which employ a particular message authentication code suggested previously.
A Abidin   +25 more
core   +1 more source

Universal Hash Functions & Hard Core Bits [PDF]

open access: yes, 1995
In this paper we consider the bit-security of two types of universal hash functions: linear functions on GF[2n] and linear functions on the integers modulo a prime. We show individual security for all bits in the first case and for the O(log n) least significant bits in the second case.
openaire   +1 more source

Heat and Cold Waves in Brazil: An ERA5‐Based Analysis of Trends and Seasonality (1980–2024)

open access: yesInternational Journal of Climatology, Volume 46, Issue 6, May 2026.
This study uses ERA5 reanalysis data to assess changes in extreme heat and cold events across Brazil from 1980 to 2024. Results reveal a sharp increase in heatwave frequency and a general decline in coldwave occurrences, though regional variations are substantial.
Alindomar Lacerda Silva, Scott Sheridan
wiley   +1 more source

Quantifying Structural Complexity, Effort, and Performance: An Early Experiment Using Network Design Tasks

open access: yesSystems Engineering, Volume 29, Issue 3, Page 387-405, May 2026.
ABSTRACT Structural Complexity is perceived as driving cost in system development, yet managing it effectively requires empirical understanding. This study investigates human decision‐making using a toy transportation‐style network design task, focusing on how Structural Complexity, Effort, and Performance interact. Seventy‐four participants (primarily
Alfonso Lanza   +3 more
wiley   +1 more source

On Symmetric and Asymmetric LSHs for Inner Product Search [PDF]

open access: yes, 2015
We consider the problem of designing locality sensitive hashes (LSH) for inner product similarity, and of the power of asymmetric hashes in this context.
Neyshabur, Behnam, Srebro, Nathan
core  

Symmetric blind information reconciliation and hash-function-based verification for quantum key distribution

open access: yes, 2018
We consider an information reconciliation protocol for quantum key distribution (QKD). In order to correct down the error rate, we suggest a method, which is based on symmetric blind information reconciliation for the low-density parity-check (LDPC ...
Fedorov, A. K.   +2 more
core   +1 more source

Data Clustering Method for Fault‐Tolerant Privacy Protection of Smart Grid Based on BGN Homomorphic Encryption Algorithm

open access: yesEngineering Reports, Volume 8, Issue 4, April 2026.
Smart meter (SM): Collect the data of users' electricity consumption periodically, and preprocess the noise reduction by using the Robust Local Weighted Regression algorithm, then encrypt the private data in it by Boneh‐Goh‐Nissim homomorphic encryption, and submit the encrypted private data to the fog node.
Jiangtao Guo   +5 more
wiley   +1 more source

On the Theory of Spatial and Temporal Locality [PDF]

open access: yes, 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  

Key-Recovery Attacks on Universal Hash Function Based MAC Algorithms [PDF]

open access: yes, 2008
This paper discusses key recovery and universal forgery attacks on several MAC algorithms based on universal hash functions. The attacks use a substantial number of verification queries but eventually allow for universal forgeries instead of existential or multiple forgeries.
Handschuh, Helena, Preneel, Bart
openaire   +2 more sources

A Composition Theorem for Universal One-Way Hash Functions [PDF]

open access: yes, 2000
In this paper we present a new scheme for constructing universal one-way hash functions that hash arbitrarily long messages out of universal one-way hash functions that hash fixed-length messages. The new construction is extremely simple and is also very efficient, yielding shorter keys than previously proposed composition constructions.
openaire   +2 more sources

Home - About - Disclaimer - Privacy