New combinatorial complete one-way functions

被引：0
|
作者：
Kojevnikov, Arist [1 ]
Nikolenko, Sergey I. [1 ]
机构：
[1] VA Steklov Math Inst, St Petersburg Dept, St Petersburg 191023, Russia
来源：
STACS 2008: PROCEEDINGS OF THE 25TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE | 2008年
关键词：
cryptography; complete problem; one-way function;
D O I：
暂无
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In 2003, Leonid A. Levin presented the idea of a combinatorial complete one-way function and a sketch of the proof that Tiling represents such a function. In this paper, we present two new one-way functions based on semi-Thue string rewriting systems and a version of the Post Correspondence Problem and prove their completeness. Besides, we present an alternative proof of Levin's result. We also discuss the properties a combinatorial problem should have in order to hold a complete one-way function.
引用
收藏
页码：457 / 466
页数：10
相关论文
共 50 条
  • [21] The existence of relativization one-way functions
    Cao, Z.
    Lü, Y.
    Shi, C.
    2001, Chinese Academy of Sciences (12):
  • [22] ONE-WAY FUNCTIONS AND CIRCUIT COMPLEXITY
    BOPPANA, RB
    LAGARIAS, JC
    LECTURE NOTES IN COMPUTER SCIENCE, 1986, 223 : 51 - 65
  • [23] On One-Way Functions and Sparse Languages
    Liu, Yanyi
    Pass, Rafael
    THEORY OF CRYPTOGRAPHY, TCC 2023, PT I, 2023, 14369 : 219 - 237
  • [24] Polynomials and One-Way Functions.
    Mueller, Winfred B.
    1988, 105 (01): : 31 - 35
  • [25] One-Way Functions and Zero Knowledge
    Hirahara, Shuichi
    Nanashima, Mikito
    PROCEEDINGS OF THE 56TH ANNUAL ACM SYMPOSIUM ON THEORY OF COMPUTING, STOC 2024, 2024, : 1731 - 1738
  • [26] Secrecy without one-way functions
    Grigoriev, Dima
    Shpilrain, Vladimir
    GROUPS COMPLEXITY CRYPTOLOGY, 2013, 5 (01) : 31 - 52
  • [27] ON THE EXISTENCE OF EXTRACTABLE ONE-WAY FUNCTIONS
    Bitansky, Nir
    Canetti, Ran
    Paneth, Omer
    Rosen, Alon
    SIAM JOURNAL ON COMPUTING, 2016, 45 (05) : 1910 - 1952
  • [28] Weakly Extractable One-Way Functions
    Bitansky, Nir
    Eizenstadt, Noa
    Paneth, Omer
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT I, 2020, 12550 : 596 - 626
  • [29] ONE-WAY FUNCTIONS IN COMPLEXITY THEORY
    SELMAN, AL
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 452 : 88 - 104
  • [30] ONE-WAY FUNCTIONS AND CIRCUIT COMPLEXITY
    BOPPANA, RB
    LAGARIAS, JC
    INFORMATION AND COMPUTATION, 1987, 74 (03) : 226 - 240
12345