Damm, Frank and Heider, Franz-Peter
(1996).
Amplifying the Security of One-Way Functions — A Proof of Yao's XOR-Lemma.
Working Paper.
Preview |
PDF
zpr96-240.pdf Download (195kB) | Preview |
Abstract
In this paper we give a consistent and simple proof for the XOR-Lemma which was hinted at by Yao and subsequently presented by him in lectures. It can be found in print in "E. Kranakis, Primality and Cryptography, Wiley-Teubner Series in Computer Science, 1986". By the lemma we know that the security of any one-way function f:Xlongrightarrow { 0,1} can be substantially amplified if the function is replaced by the XOR with itself, namely by foplus f:X imes Xlongrightarrow { 0,1}, (x,y)longrightarrow f(x)oplus f(y). Applications are in cryptography and complexity theory. However, the existence of one-way functions still remains an open problem.
| Item Type: | Monograph (Working Paper) |
| Creators: | Creators Email ORCID ORCID Put Code Damm, Frank UNSPECIFIED UNSPECIFIED UNSPECIFIED Heider, Franz-Peter UNSPECIFIED UNSPECIFIED UNSPECIFIED |
| URN: | urn:nbn:de:hbz:38-547599 |
| Date: | 1996 |
| Language: | English |
| Faculty: | Faculty of Mathematics and Natural Sciences |
| Divisions: | Faculty of Mathematics and Natural Sciences > Department of Mathematics and Computer Science > Institute of Computer Science |
| Subjects: | Data processing Computer science |
| Refereed: | No |
| URI: | http://kups.ub.uni-koeln.de/id/eprint/54759 |
Downloads
Downloads per month over past year
Export
Actions (login required)
 |
View Item |