Results 71 to 80 of about 1,394 (186)

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, Sarvar Patel, Zulfikar Ramzan   +2 more
openaire   +1 more source

Unconditional authentication with universal hashing on the maximal curves [PDF]

, 2013
Представлено решение задачи построения безусловной аутентификации с универсальным хешированием по максимальным кривым в композиционной схеме с ортогональными и слабо смещенными массивам.Представлено рішення задачі побудови безумовної автентифікації з ...
Г.З. Халимов, G.Z. Khalimov, Г.З. Халімов   +2 more
core  

Geographic Patterns in I2P Peer Selection: An Empirical Network Topology Analysis

Internet Technology Letters, Volume 9, Issue 4, July/August 2026.
ABSTRACT The Invisible Internet Project (I2P) routes data via encrypted, decentralized tunnels. Peer selection can significantly affect security and performance. This empirical study examines whether geographic location systematically influences I2P's routing topology.
Siddique Abubakr Muntaka, Jess Kropczynski, Jacques Bou Abdo, Murat Ozer   +3 more
wiley   +1 more source

A Trade-Off Between Collision Probability and Key Size in Universal Hashing Using Polynomials [PDF]

, 2009
Let $\rF$ be a finite field and suppose that a single element of $\rF$ is used as an authenticator (or tag). Further, suppose that any message consists of at most $L$ elements of $\rF$.
Palash Sarkar
core  

A practical guide to the implementation of AI in orthopaedic research‐Part 4: Prerequisites for a successful orthopedics AI‐driven project in terms of interdisciplinary collaboration, data management, ethical approval and technology

Journal of Experimental Orthopaedics, Volume 13, Issue 3, July 2026.
Abstract Translating artificial intelligence (AI) research in orthopedics from proof‐of‐concept studies into production‐grade clinical systems requires the systematic satisfaction of four prerequisite domains: interdisciplinary team architecture, technical data management, ethical and regulatory governance and production‐grade technology and deployment
Umile Giuseppe Longo, Mario Merone, Emiliano Schena, Benedetta Bandini, Guido Nicodemi, Bálint Zsidai, Ann‐Sophie Hilkert, Eric Hamrin Senorski, Alberto Grassi, Christophe Ley, Elmar Herbst, Michael T. Hirschmann, Sebastian Kopf, Romain Seil, Thomas Tischer, Robert Feldt, Kristian Samuelsson, Felix C. Oettl   +17 more
wiley   +1 more source

Semi-Supervised Deep Hashing with a Bipartite Graph [PDF]

, 2017
Recently, deep learning has been successfully applied to the problem of hashing, yielding remarkable performance compared to traditional methods with hand-crafted features.
Lijun Zhang, Wu-Jun Li, Xinyu Yan
core   +1 more source

Constrained sampling and counting: Universal hashing meets SAT solving [PDF]

, 2016
Constrained sampling and counting are two fundamental problems in artificial intelligence with a diverse range of applications, spanning probabilistic reasoning and planning to constrained-random verification.
Meel, KS, Malik, Sharad, Fremont, DJ, Fried, D, Seshia, SA, Vardi, MY, Chakraborty, S, Ivrii, A   +7 more
core  

PBSFL: Privacy-Preserving and Byzantine-Resilient for Summoning Federated Learning

Journal of King Saud University: Computer and Information Sciences
With the expansion of large-scale model applications, a typical division-of-labor federated learning (FL) training paradigm has emerged. This scenario is defined as Summoned Federated Learning (SFL), in which a single task initiator mobilizes cloud ...
Bowei Chen, Yan Ke, Wei Zhang, Jia Liu
doaj   +1 more source

Separating hash families with large universe

Journal of Combinatorial Theory, Series A
Separating 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

Universal Hashing for Ultra-Low-Power Cryptographic Hardware Applications [PDF]

, 2004
Message Authentication Codes (MACs) are valuable tools for ensuring the integrity of messages. MACs may be built around a keyed hash function. Our main motivation was to prove that universal hash functions can be employed as underlying primitives of MACs
Yuksel, Kaan
core