Paper 2023/1033

OWF Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting

Paweł Cyprys, Ben-Gurion University of the Negev
Shlomi Dolev, Ben-Gurion University of the Negev
Oded Margalit, Ben-Gurion University of the Negev
Abstract

Our 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, couple the output with the committed value xored with folded 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 (that serves as the commitment mask) and also as 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 efficient, in particular, 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).

Metadata
Available format(s)
PDF
Category
Foundations
Publication info
Preprint.
Keywords
One way functionsOne time padSecret sharing
Contact author(s)
cyprysp @ post bgu ac il
dolev @ cs bgu ac il
odedm @ post bgu ac il
History
2024-08-19: last of 5 revisions
2023-07-03: received
See all versions
Short URL
https://ia.cr/2023/1033
License
No rights reserved
CC0

BibTeX

@misc{cryptoeprint:2023/1033,
      author = {Paweł Cyprys and Shlomi Dolev and Oded Margalit},
      title = {{OWF} Candidates Based on: Xors, Error Detection Codes, Permutations, Polynomials, Interaction and Nesting},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/1033},
      year = {2023},
      url = {https://eprint.iacr.org/2023/1033}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.