Post Quantum Lightweight OWF Candidates - Based on Theoretically Secure Primitives: Xors, Error Detection Codes, Permutations, Polynomials, Interaction, and Nesting (Short Version)

Pawel Cyprys, Shlomi Dolev, Oded Margalit

Abstract: 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.

External IDs:dblp:conf/cscml/CyprysDM24