TY - GEN
T1 - A feebly secure trapdoor function
AU - Hirsch, Edward A.
AU - Nikolenko, Sergey I.
PY - 2009
Y1 - 2009
N2 - In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as circuit complexity over circuits with arbitrary binary gates) is amplified by a constant factor only (with the factor approaching 2). In traditional cryptography, one-way functions are the basic primitive of private-key and digital signature schemes, while public-key cryptosystems are constructed with trapdoor functions. We continue Hiltgen's work by providing an example of a feebly trapdoor function where the adversary is guaranteed to spend more time than every honest participant by a constant factor of 25/22.
AB - In 1992, A. Hiltgen [1] provided the first constructions of provably (slightly) secure cryptographic primitives, namely feebly one-way functions. These functions are provably harder to invert than to compute, but the complexity (viewed as circuit complexity over circuits with arbitrary binary gates) is amplified by a constant factor only (with the factor approaching 2). In traditional cryptography, one-way functions are the basic primitive of private-key and digital signature schemes, while public-key cryptosystems are constructed with trapdoor functions. We continue Hiltgen's work by providing an example of a feebly trapdoor function where the adversary is guaranteed to spend more time than every honest participant by a constant factor of 25/22.
UR - http://www.scopus.com/inward/record.url?scp=70350348907&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-03351-3_14
DO - 10.1007/978-3-642-03351-3_14
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:70350348907
SN - 3642033504
SN - 9783642033506
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 129
EP - 142
BT - Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings
T2 - 4th International Computer Science Symposium in Russia, CSR 2009
Y2 - 18 August 2009 through 23 August 2009
ER -