**Simple composition theorems of one-way functions -- proofs and presentations**

*Jaime Gaspar and 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.

**Category / Keywords: **foundations/one-way functions, proof presentation, Coq

**Date: **received 18 Dec 2014, last revised 25 Dec 2014

**Contact author: **e a boiten at kent ac uk

**Available format(s): **PDF | BibTeX Citation

**Note: **Intending to further expand our thoughts on proof presentation for submission to a conference later, we would like to invite comment from the cryptology community first. We could not find these theorems anywhere, not even as "folklore" or as "an obvious homework exercise". Any such pointers or further suggestions would be much appreciated. The same goes for thoughts on definitions of collision-freeness: the transition to "families" to solve a technical problem seems to be broadly resented in the literature, is our alternative felt to be sensible?

**Version: **20141225:145438 (All versions of this report)

**Short URL: **ia.cr/2014/1006

[ Cryptology ePrint archive ]