TY - GEN
T1 - Post Quantum Lightweight OWF Candidates
T2 - 8th International Symposium on Cyber Security, Cryptology, and Machine Learning, CSCML 2024
AU - Cyprys, Paweł
AU - Dolev, Shlomi
AU - Margalit, Oded
N1 - Publisher Copyright: © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.
PY - 2025/1/1
Y1 - 2025/1/1
N2 - This research focuses on designing efficient commitment schemes by drawing inspiration from (perfect) information-theoretical secure primitives, e.g., the one-time pad and secret sharing. We use a random input as a mask for the committed value, outputting a function on the random input. Then, we couple the output with the committed value xored with the random input folded (half of the input xored with the other half of the) random input. First, we explore the potential of leveraging the unique properties of the one-time pad to design effective one-way functions. Our methodology applies the exclusive-or (xor) operation to two randomly chosen strings. To address concerns related to preimage mappings, we incorporate error detection codes. Additionally, we utilize permutations to overcome linearity issues in the computation process. Feistel networks are employed to ensure super pseudo-random permutation using the (random string) input (the commitment mask) and the encryption key. We propose integrating a secret-sharing scheme based on a linear polynomial to mitigate possible collisions. Lastly, we explore the possibility of nesting one-way functions as a countermeasure against potential backdoors. The resulting commitment schemes are particularly efficient, as they have fewer layers than the standard cryptographic hash functions, such as SHA, and may fit the NIST effort for lightweight IoT cryptography (e.g., ASCON [DEMS21]).
AB - This research focuses on designing efficient commitment schemes by drawing inspiration from (perfect) information-theoretical secure primitives, e.g., the one-time pad and secret sharing. We use a random input as a mask for the committed value, outputting a function on the random input. Then, we couple the output with the committed value xored with the random input folded (half of the input xored with the other half of the) random input. First, we explore the potential of leveraging the unique properties of the one-time pad to design effective one-way functions. Our methodology applies the exclusive-or (xor) operation to two randomly chosen strings. To address concerns related to preimage mappings, we incorporate error detection codes. Additionally, we utilize permutations to overcome linearity issues in the computation process. Feistel networks are employed to ensure super pseudo-random permutation using the (random string) input (the commitment mask) and the encryption key. We propose integrating a secret-sharing scheme based on a linear polynomial to mitigate possible collisions. Lastly, we explore the possibility of nesting one-way functions as a countermeasure against potential backdoors. The resulting commitment schemes are particularly efficient, as they have fewer layers than the standard cryptographic hash functions, such as SHA, and may fit the NIST effort for lightweight IoT cryptography (e.g., ASCON [DEMS21]).
UR - http://www.scopus.com/inward/record.url?scp=85214253683&partnerID=8YFLogxK
U2 - https://doi.org/10.1007/978-3-031-76934-4_23
DO - https://doi.org/10.1007/978-3-031-76934-4_23
M3 - Conference contribution
SN - 9783031769337
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 322
EP - 334
BT - Cyber Security, Cryptology, and Machine Learning - 8th International Symposium, CSCML 2024, Proceedings
A2 - Dolev, Shlomi
A2 - Elhadad, Michael
A2 - Kutyłowski, Mirosław
A2 - Persiano, Giuseppe
PB - Springer Science and Business Media Deutschland GmbH
Y2 - 19 December 2024 through 20 December 2024
ER -