Impossibility results on weakly black-box hardness amplification

被引:0
|
作者
Lu, Chi-Jen [1 ]
Tsai, Shi-Chun [1 ]
Wu, Hsin-Lung [1 ]
机构
[1] Natl Chiao Tung Univ, Dept Comp Sci, Hsinchu, Taiwan
关键词
D O I
暂无
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
We study the task of hardness amplification which transforms a hard function into a harder one. It is known that in a high complexity class such as exponential time, one can convert worst-case hardness into average-case hardness. However, in a lower complexity class such as NP or sub-exponential time, the existence of such an amplification procedure remains unclear. We consider a class of hardness amplifications called weakly black-box hardness amplification, in which the initial hard function is only used as a black box to construct the harder function. We show that if an amplification procedure in TIME(t) can amplify hardness beyond an O(t) factor, then it must basically embed in itself a hard function computable in TIME(t). As a result, it is impossible to have such a hardness amplification with hardness measured against TIME(t). Furthermore, we show that, for any k is an element of N, if an amplification procedure in Sigma P-k can amplify hardness beyond a polynomial factor, then it must basically embed a hard function in Sigma P-k. This in turn implies the impossibility of having such hardness amplification with hardness measured against Sigma P-k/poly.
引用
收藏
页码:400 / +
页数:3
相关论文
共 50 条
  • [1] On the impossibility of black-box transformations in mechanism design
    Pass, Rafael
    Seth, Karn
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2014, 8768 : 279 - 290
  • [2] On the Impossibility of Black-Box Transformations in Mechanism Design
    Pass, Rafael
    Seth, Karn
    ALGORITHMIC GAME THEORY, SAGT 2014, 2014, 8768 : 279 - 290
  • [3] Impossibility of Black-Box Simulation Against Leakage Attacks
    Ostrovsky, Rafail
    Persiano, Giuseppe
    Visconti, Ivan
    ADVANCES IN CRYPTOLOGY, PT II, 2015, 9216 : 130 - 149
  • [4] On the Impossibility of Virtual Black-Box Obfuscation in Idealized Models
    Mahmoody, Mohammad
    Mohammed, Ameer
    Nematihaji, Soheil
    THEORY OF CRYPTOGRAPHY, TCC 2016-A, PT I, 2016, 9562 : 18 - 48
  • [5] Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
    Alagic, Gorjan
    Brakerski, Zvika
    Dulek, Yfke
    Schaffner, Christian
    ADVANCES IN CRYPTOLOGY (CRYPTO 2021), PT I, 2021, 12825 : 497 - 525
  • [6] THE BLACK-BOX
    KYLE, SA
    NEW SCIENTIST, 1986, 110 (1512) : 61 - 61
  • [7] THE BLACK-BOX
    WISEMAN, J
    ECONOMIC JOURNAL, 1991, 101 (404): : 149 - 155
  • [8] On the Impossibility of Post-Quantum Black-Box Zero-Knowledge in Constant Round
    Chia, Nai-Hui
    Chung, Kai-Min
    Liu, Qipeng
    Yamakawa, Takashi
    2021 IEEE 62ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS 2021), 2022, : 59 - 67
  • [9] Generating expected results for automated black-box testing
    Schroeder, PJ
    Faherty, P
    Korel, B
    ASE 2002: 17TH IEEE INTERNATIONAL CONFERENCE ON AUTOMATED SOFTWARE ENGINEERING, 2002, : 139 - 148
  • [10] THE MATHEMATICAL WORLD IN THE BLACK-BOX - SIGNIFICANCE OF THE BLACK-BOX AS A MEDIUM OF MATHEMATIZING
    MAASS, J
    SCHLOGLMANN, W
    CYBERNETICS AND SYSTEMS, 1988, 19 (04) : 295 - 309