Results 21 to 30 of about 914,695 (232)
Explicit Orthogonal Arrays and Universal Hashing with Arbitrary Parameters [PDF]
Symposium on the Theory of ComputingOrthogonal arrays are a type of combinatorial design that emerged in the 1940s in the design of statistical experiments. In 1947, Rao proved a lower bound on the size of any orthogonal array, and raised the problem of constructing arrays of minimum size.
Nicholas J. A. Harvey, Arvin Sahami
openalex +3 more sources
Comprehensive Performance Study of Hashing Functions [PDF]
Computer Science Journal of Moldova, 2023 Most literature on hashing functions speaks in terms of hashing functions being either ‘good’ or ‘bad’. In this paper, we demonstrate how a hashing function that gives good results for one key set, performs badly for another.
G. M. Sridevi +2 more
doaj +1 more source
One-Time Universal Hashing Quantum Digital Signatures without Perfect Keys [PDF]
Physical Review Applied, 2023 Quantum digital signatures (QDS), generating correlated bit strings among three remote parties for signatures through quantum law, can guarantee non-repudiation, authenticity, and integrity of messages. Recently, one-time universal hashing QDS framework,
Bing-Hong Li +6 more
semanticscholar +1 more source
Invertible Universal Hashing and the TET Encryption Mode [PDF]
Annual International Cryptology Conference, 2007 This work describes a mode of operation, TET, that turns a regular block cipher into a length-preserving enciphering scheme for messages of (almost) arbitrary length. When using an n-bit block cipher, the resulting scheme can handle input of any bit-length between n and 2n and associated data of arbitrary length.
S. Halevi
openaire +3 more sources
AAAI Conference on Artificial IntelligenceDeep Hashing (DH)-based image retrieval has been widely applied to face-matching systems due to its accuracy and efficiency. However, this convenience comes with an increased risk of privacy leakage.
Long Tang +4 more
openalex +3 more sources
Inaccessible Entropy II: IE Functions and Universal One-Way Hashing [PDF]
Theory of Computing, 2021 This paper uses a variant of the notion of inaccessible entropy (Haitner, Reingold, Vadhan and Wee, STOC 2009), to give an alternative construction and proof for the fundamental result, first proved by Rompel (STOC 1990), that Universal One-Way Hash ...
Iftach Haitner +4 more
openalex +3 more sources
EliMAC: Speeding Up LightMAC by around 20%
IACR Transactions on Symmetric Cryptology, 2023 Universal hash functions play a prominent role in the design of message authentication codes and the like. Whereas it is known how to build highly efficient sequential universal hash functions, parallel non-algebraic universal hash function designs are ...
Christoph Dobraunig +2 more
doaj +1 more source
Explicit Wiretap Channel Codes via Source Coding, Universal Hashing, and Distribution Approximation, When the Channels' Statistics are Uncertain [PDF]
IEEE Transactions on Information Forensics and Security, 2020 We consider wiretap channels with uncertainty on the eavesdropper channel under (i) noisy blockwise type II, (ii) compound, or (iii) arbitrarily varying models.
Rémi A. Chou
openalex +3 more sources
EXTENSION OF SSL/TLS FOR QUANTUM CRYPTOGRAPHY [PDF]
مجلة جامعة الانبار للعلوم الصرفة, 2008 SSL/TLS is the protocol that is used for the vast majority of secure transactions over the Internet. However, this protocol needs to be extended in order to create a promising platform for the integration of quantum cryptography (QC) into the Internet ...
Sufyan T. Faraj
doaj +1 more source
Secret Key Distillation with Speech Input and Deep Neural Network-Controlled Privacy Amplification
Mathematics, 2023 We propose a new high-speed secret key distillation system via public discussion based on the common randomness contained in the speech signal of the protocol participants.
Jelica Radomirović +3 more
doaj +1 more source