The Application of Claw Free Functions in Cryptography: - Unconditional Protection in Cryptographic Protocols
DOI:
https://doi.org/10.7146/dpb.v17i269.7622Abstract
A set of clawfree functions is a set of functions that are all easily computable, but for which it is hard to simultaneously find preimages of an element under different functions. In this thesis we develop a formalism for describing such functions, and show several techniques for building them, some new and others well known. We show how clawfree functions can be extremely useful, in the construction of for example collision free hash functions and of cryptographic protocols in general. In particular, we show how to solve the famous multiparty computation problem, while achieving un conditional privacy protection for one participant. This is the optimal result in the model of communication we consider.Downloads
Published
1988-05-01
How to Cite
Damgård, I. B. (1988). The Application of Claw Free Functions in Cryptography: - Unconditional Protection in Cryptographic Protocols. DAIMI Report Series, 17(269). https://doi.org/10.7146/dpb.v17i269.7622
Issue
Section
Articles
License
Articles published in DAIMI PB are licensed under a Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported License.