Welcome to the resource topic for 2014/1006
Title:
Simple composition theorems of one-way functions – proofs and presentations
Authors: Jaime Gaspar, Eerke Boiten
Abstract:One-way functions are both central to cryptographic theory and a clear example of its complexity as a theory. From the aim to understand theories, proofs, and communicability of proofs in the area better, we study some small theorems on one-way functions, namely: composition theorems of one-way functions of the form “if f (or h) is well-behaved in some sense and g is a one-way function, then f \circ g (respectively, g \circ h) is a one-way function”. We present two basic composition theorems, and generalisations of them which may well be folklore. Then we experiment with different proof presentations, including using the Coq theorem prover, using one of the theorems as a case study.
ePrint: https://eprint.iacr.org/2014/1006
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .