Standard

A feebly secure trapdoor function. / Hirsch, Edward A.; Nikolenko, Sergey I.

Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. 2009. p. 129-142 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5675 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

Harvard

Hirsch, EA & Nikolenko, SI 2009, A feebly secure trapdoor function. in Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 5675 LNCS, pp. 129-142, 4th International Computer Science Symposium in Russia, CSR 2009, Novosibirsk, Russian Federation, 18/08/09. https://doi.org/10.1007/978-3-642-03351-3_14

APA

Hirsch, E. A., & Nikolenko, S. I. (2009). A feebly secure trapdoor function. In Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings (pp. 129-142). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 5675 LNCS). https://doi.org/10.1007/978-3-642-03351-3_14

Vancouver

Hirsch EA, Nikolenko SI. A feebly secure trapdoor function. In Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. 2009. p. 129-142. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-642-03351-3_14

Author

Hirsch, Edward A. ; Nikolenko, Sergey I. / A feebly secure trapdoor function. Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings. 2009. pp. 129-142 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{57ed477b07574d4b94e0c9f0e52c8c69,
title = "A feebly secure trapdoor function",
abstract = "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.",
author = "Hirsch, {Edward A.} and Nikolenko, {Sergey I.}",
year = "2009",
month = oct,
day = "29",
doi = "10.1007/978-3-642-03351-3_14",
language = "English",
isbn = "3642033504",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "129--142",
booktitle = "Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings",
note = "4th International Computer Science Symposium in Russia, CSR 2009 ; Conference date: 18-08-2009 Through 23-08-2009",

}

RIS

TY - GEN

T1 - A feebly secure trapdoor function

AU - Hirsch, Edward A.

AU - Nikolenko, Sergey I.

PY - 2009/10/29

Y1 - 2009/10/29

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 - Conference contribution

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 -

ID: 49827838