Standard

An infinitely-often one-way function based on an average-case assumption. / Hirsch, Edward A.; Itsykson, Dmitry M.

Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. 2008. стр. 208-217 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5110 LNAI).

Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование

Harvard

Hirsch, EA & Itsykson, DM 2008, An infinitely-often one-way function based on an average-case assumption. в Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Том. 5110 LNAI, стр. 208-217, 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008, Edinburgh, Великобритания, 1/07/08. https://doi.org/10.1007/978-3-540-69937-8_18

APA

Hirsch, E. A., & Itsykson, D. M. (2008). An infinitely-often one-way function based on an average-case assumption. в Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings (стр. 208-217). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Том 5110 LNAI). https://doi.org/10.1007/978-3-540-69937-8_18

Vancouver

Hirsch EA, Itsykson DM. An infinitely-often one-way function based on an average-case assumption. в Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. 2008. стр. 208-217. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-540-69937-8_18

Author

Hirsch, Edward A. ; Itsykson, Dmitry M. / An infinitely-often one-way function based on an average-case assumption. Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings. 2008. стр. 208-217 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

BibTeX

@inproceedings{6c9f947a807c478283a01eac7e19144e,
title = "An infinitely-often one-way function based on an average-case assumption",
abstract = "We assume the existence of a function f that is computable in polynomial time but its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.",
author = "Hirsch, {Edward A.} and Itsykson, {Dmitry M.}",
year = "2008",
month = jul,
day = "28",
doi = "10.1007/978-3-540-69937-8_18",
language = "English",
isbn = "3540699368",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "208--217",
booktitle = "Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings",
note = "15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008 ; Conference date: 01-07-2008 Through 04-07-2008",

}

RIS

TY - GEN

T1 - An infinitely-often one-way function based on an average-case assumption

AU - Hirsch, Edward A.

AU - Itsykson, Dmitry M.

PY - 2008/7/28

Y1 - 2008/7/28

N2 - We assume the existence of a function f that is computable in polynomial time but its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.

AB - We assume the existence of a function f that is computable in polynomial time but its inverse function is not computable in randomized average-case polynomial time. The cryptographic setting is, however, different: even for a weak one-way function, every possible adversary should fail on a polynomial fraction of inputs. Nevertheless, we show how to construct an infinitely-often one-way function based on f.

UR - http://www.scopus.com/inward/record.url?scp=47749149267&partnerID=8YFLogxK

U2 - 10.1007/978-3-540-69937-8_18

DO - 10.1007/978-3-540-69937-8_18

M3 - Conference contribution

AN - SCOPUS:47749149267

SN - 3540699368

SN - 9783540699361

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 208

EP - 217

BT - Logic, Language, Information and Computation - 15th International Workshop, WoLLIC 2008, Proceedings

T2 - 15th International Workshop on Logic, Language, Information and Computation, WoLLIC 2008

Y2 - 1 July 2008 through 4 July 2008

ER -

ID: 49828664