scholarly journals On an Almost-Universal Hash Function Family with Applications to Authentication and Secrecy Codes

2018 ◽  
Vol 29 (03) ◽  
pp. 357-375 ◽  
Author(s):  
Khodakhast Bibak ◽  
Bruce M. Kapron ◽  
Venkatesh Srinivasan ◽  
László Tóth
Keyword(s):  
Prime Divisor ◽  
Hash Function ◽  
Arbitrary Integer ◽  
Authentication Code ◽  
Number Of Solutions ◽  
Universal Hashing ◽  
Universal Family ◽  
The Family ◽  
Linear Congruences ◽  
Universal Hash Function

Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH[Formula: see text], which was shown to be [Formula: see text]-universal by Halevi and Krawczyk in 1997, is a well-known universal hash function family. We introduce a variant of MMH[Formula: see text], that we call GRDH, where we use an arbitrary integer [Formula: see text] instead of prime [Formula: see text] and let the keys [Formula: see text] satisfy the conditions [Formula: see text] ([Formula: see text]), where [Formula: see text] are given positive divisors of [Formula: see text]. Then via connecting the universal hashing problem to the number of solutions of restricted linear congruences, we prove that the family GRDH is an [Formula: see text]-almost-[Formula: see text]-universal family of hash functions for some [Formula: see text] if and only if [Formula: see text] is odd and [Formula: see text] [Formula: see text]. Furthermore, if these conditions are satisfied then GRDH is [Formula: see text]-almost-[Formula: see text]-universal, where [Formula: see text] is the smallest prime divisor of [Formula: see text]. Finally, as an application of our results, we propose an authentication code with secrecy scheme which strongly generalizes the scheme studied by Alomair et al. [J. Math. Cryptol. 4 (2010) 121–148], and [J.UCS 15 (2009) 2937–2956].

Everlasting security of quantum key distribution with 1K-DWCDM and quadratic hash

2021 ◽  
Vol 21 (3&4) ◽  
pp. 0181-0202
Author(s):  
Khodakhast Bibak ◽  
Robert Ritchie ◽  
Behrouz Zolfaghari
Keyword(s):  
Hash Function ◽  
Quantum Key Distribution ◽  
Key Distribution ◽  
Privacy Amplification ◽  
Universal Hashing ◽  
Wide Range ◽  
Strong Property ◽  
Everlasting Security ◽  
Universal Hash Function ◽  
General Method

Quantum key distribution (QKD) offers a very strong property called everlasting security, which says if authentication is unbroken during the execution of QKD, the generated key remains information-theoretically secure indefinitely. For this purpose, we propose the use of certain universal hashing based MACs for use in QKD, which are fast, very efficient with key material, and are shown to be highly secure. Universal hash functions are ubiquitous in computer science with many applications ranging from quantum key distribution and information security to data structures and parallel computing. In QKD, they are used at least for authentication, error correction, and privacy amplification. Using results from Cohen [Duke Math. J., 1954], we also construct some new families of $\varepsilon$-almost-$\Delta$-universal hash function families which have much better collision bounds than the well-known Polynomial Hash. Then we propose a general method for converting any such family to an $\varepsilon$-almost-strongly universal hash function family, which makes them useful in a wide range of applications, including authentication in QKD.

Power trace functions over finite fields

2019 ◽  
Vol 19 (10) ◽  
pp. 2050196
Author(s):  
Robert W. Fitzgerald ◽  
Yasanthi Kottegoda
Keyword(s):  
Finite Fields ◽  
Trace Function ◽  
Authentication Code ◽  
Number Of Solutions ◽  
Successful Attack

We count the number of solutions to a power trace function equal to a constant and use this to find the probability of a successful attack on an authentication code proposed by Ding et al. (2005) [C. Ding, A. Salomaa, P. Solé and X. Tian, Three constructions of authentication/secrecy codes, J. Pure Appl. Algebra 196 (2005) 149–168].

scholarly journals Secure WiFi-Direct Using Key Exchange for IoT Device-to-Device Communications in a Smart Environment

2019 ◽  
Vol 11 (12) ◽  
pp. 251 ◽  
Author(s):  
Zakariae Belghazi ◽  
Nabil Benamar ◽  
Adnane Addaim ◽  
Chaker Abdelaziz Kerrache
Keyword(s):  
Key Exchange ◽  
D2d Communication ◽  
Security Requirements ◽  
Mobile Users ◽  
Sensitive Information ◽  
Secret Key ◽  
Authentication Code ◽  
Universal Hashing ◽  
Device To Device ◽  
Shared Secret

With the rapid growth of Internet of Things (IoT) devices around the world, thousands of mobile users share many data with each other daily. IoT communication has been developed in the past few years to ensure direct connection among mobile users. However, wireless vulnerabilities exist that cause security concerns for IoT device-to-device (D2D) communication. This has become a serious debate, especially in smart environments where highly sensitive information is exchanged. In this paper, we study the security requirements in IoT D2D communication. In addition, we propose a novel authentication approach called Secure Key Exchange with QR Code (SeKeQ) to verify user identity by ensuring an automatic key comparison and providing a shared secret key using Diffie-Hellman key agreement with an SHA-256 hash. To evaluate the performance of SeKeQ, we ran a testbed using devices with a WiFi-Direct communication interface. The obtained results depict that our proposal can offer the required security functions including key exchange, data confidentiality, and integrity. In addition, our proposal can reach the same security performances as MANA (Manual Authentication) and UMAC (Universal-Hashing Message Authentication Code) but with 10 times fewer key computations and reduced memory occupancy.

Pseudorandom Generators Based on One-Way Functions

2014 ◽  
Vol 577 ◽  
pp. 820-823
Author(s):  
Shu Jing Gao ◽  
Ting Qiang Song ◽  
Wei Zhang
Keyword(s):  
Hash Function ◽  
Pseudorandom Generator ◽  
Pseudorandom Generators ◽  
Output Sequence ◽  
Universal Hash Function ◽  
The One ◽  
One Way Function ◽  
Important Notion

Pseudorandom Generators is an important notion of cryptography. A new randomized iterating method of one-way function is proposed, after the analyzing of current research on pseudorandom generators based on one-way function. On the basis of this randomized iteration, a pseudorandom generator with linear seeds length is constructed using general regular one-way function and universal hash function. The output sequence of the proposed PRNG is unpredictable and the length of the seeds is linear to the input length of the one-way function.

scholarly journals Implementasi Keyed-Hash Message Authentatication Code Pada Sistem Keamanan Rumah

MIND Journal ◽  
2018 ◽  
Vol 1 (1) ◽  
pp. 9
Author(s):  
M Ichwan ◽  
Milda Gustian ◽  
Novan Rizky Nurjaman
Keyword(s):  
Hash Function ◽  
Message Authentication ◽  
Brute Force ◽  
Message Authentication Code ◽  
Authentication Code ◽  
Avalanche Effect ◽  
Brute Force Attack

Keyed-Hash Message Authentication Code (HMAC) adalah algoritma untuk menghitung nilai MAC (Message Authentication Code) yang menggunakan Fungsi Hash dikombinasikan dengan sebuah kunci rahasia, Fungsi Hash yang digunakan dalam penelitian ini adalah Secure Ha sh Algorithm 256 (SHA256). Nilai MAC digunakan sebagai otentikasi untuk menjamin integritas data dan keaslian pesan. Algoritma ini di implementasikan pada sistem keamanan rumah, dimana pertukaran pesan antara user dan sistem keamanan di otentikasi dengan menggunakan HMAC. Keamanan  algoritma  HMAC ini  dibuktikan  dengan  hasil  pengujian  Avalanche  effect  yang mencapai 87.5% pada fungsi Hash yang digunakan ,dan dibutuhkan waktu sampai 84 tahun untuk serangan Brute force berhasil pada kunci dengan panjang 8 karakter. Kata kunci: keyed-Hash Message Authentication Code, Hash function, Avalanche  effect, Brute force attack

scholarly journals Counting Words by Number of Occurrences of Some Patterns

10.37236/630 ◽  
2011 ◽  
Vol 18 (1) ◽  
Author(s):  
Zhicheng Gao ◽  
Andrew MacFie ◽  
Daniel Panario
Keyword(s):  
The Other ◽  
Binomial Coefficients ◽  
Integer Partitions ◽  
Number Of Solutions ◽  
Partially Ordered ◽  
Asymptotic Expressions ◽  
The Family ◽  
Two Parameters

We give asymptotic expressions for the number of words containing a given number of occurrences of a pattern for two families of patterns with two parameters each. One is the family of classical patterns in the form $22\cdots 212 \cdots 22$ and the other is a family of partially ordered patterns. The asymptotic expressions are in terms of the number of solutions to an equation, and for one subfamily this quantity is the number of integer partitions into $q$th order binomial coefficients.

Sign in / Sign up

Export Citation Format

Share Document