ON HARDNESS OF ONE-WAY FUNCTIONS

被引：16
|
作者：
WATANABE, O
机构：
来源：
INFORMATION PROCESSING LETTERS | 1988年 / 27卷 / 03期
关键词：
D O I：
10.1016/0020-0190(88)90071-3
中图分类号：
TP [自动化技术、计算机技术];
学科分类号：
0812 ;
摘要：
引用
收藏
页码：151 / 157
页数：7
相关论文
共 50 条
  • [1] On hardness amplification of one-way functions
    Lin, H
    Trevisan, L
    Wee, H
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2005, 3378 : 34 - 49
  • [2] On the complexity of parallel hardness amplification for one-way functions
    Lu, Chi-Jen
    THEORY OF CRYPTOGRAPHY, PROCEEDINGS, 2006, 3876 : 462 - 481
  • [3] On basing one-way functions on NP-hardness
    MIT, Cambridge, MA, United States
    不详
    Proc. Annu. ACM Symp. Theory Comput., (701-710):
  • [4] Erratum for: On Basing One-Way Functions on NP-Hardness
    Akavia, Adi
    Goldreich, Oded
    Goldwasser, Shafi
    Moshkovitz, Dana
    STOC 2010: PROCEEDINGS OF THE 2010 ACM SYMPOSIUM ON THEORY OF COMPUTING, 2010, : 795 - 795
  • [5] ON ONE-WAY FUNCTIONS
    WATANABE, O
    COMBINATORICS, COMPUTING AND COMPLEXITY, 1989, : 98 - 131
  • [6] One-way functions
    Levin, L.A.
    Problemy Peredachi Informatsii, 2003, 39 (01): : 103 - 117
  • [7] On Average-Case Hardness in TFNP from One-Way Functions
    Hubacek, Pavel
    Kamath, Chethan
    Kral, Karel
    Slivova, Veronika
    THEORY OF CRYPTOGRAPHY, TCC 2020, PT III, 2020, 12552 : 614 - 638
  • [8] Hardness of Computing Individual Bits for One-Way Functions on Elliptic Curves
    Duc, Alexandre
    Jetchev, Dimitar
    ADVANCES IN CRYPTOLOGY - CRYPTO 2012, 2012, 7417 : 832 - 849
  • [9] Hardness of Non-interactive Differential Privacy from One-Way Functions
    Kowalczyk, Lucas
    Malkin, Tal
    Ullman, Jonathan
    Wichs, Daniel
    ADVANCES IN CRYPTOLOGY - CRYPTO 2018, PT I, 2018, 10991 : 437 - 466
  • [10] On Basing Size-Verifiable One-Way Functions on NP-Hardness
    Bogdanov, Andrej
    Brzuska, Christina
    THEORY OF CRYPTOGRAPHY (TCC 2015), PT I, 2015, 9014 : 1 - 6
12345