Результаты исследований: Публикации в книгах, отчётах, сборниках, трудах конференций › статья в сборнике материалов конференции › научная › Рецензирование
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.
Язык оригинала | английский |
---|---|
Название основной публикации | Computer Science - Theory and Applications - 4th International Computer Science Symposium in Russia, CSR 2009, Proceedings |
Страницы | 129-142 |
Число страниц | 14 |
DOI | |
Состояние | Опубликовано - 29 окт 2009 |
Опубликовано для внешнего пользования | Да |
Событие | 4th International Computer Science Symposium in Russia, CSR 2009 - Novosibirsk, Российская Федерация Продолжительность: 18 авг 2009 → 23 авг 2009 |
Название | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Том | 5675 LNCS |
ISSN (печатное издание) | 0302-9743 |
ISSN (электронное издание) | 1611-3349 |
конференция | 4th International Computer Science Symposium in Russia, CSR 2009 |
---|---|
Страна/Tерритория | Российская Федерация |
Город | Novosibirsk |
Период | 18/08/09 → 23/08/09 |
ID: 49827838