Truncator: Time-Space Tradeoff of Cryptographic Primitives

被引:0
|
作者
Baldimtsi, Foteini [1 ,2 ]
Chalkias, Konstantinos [2 ]
Chatzigiannis, Panagiotis [3 ]
Kelkar, Mahimna [4 ]
机构
[1] George Mason Univ, Farifax, VA USA
[2] Mysten Labs, Palo Alto, CA USA
[3] Visa Res, Foster City, CA 94404 USA
[4] Cornell Univ, Ithaca, NY USA
关键词
D O I
10.1007/978-3-031-78679-2_6
中图分类号
F8 [财政、金融];
学科分类号
0202 ;
摘要
We present mining-based techniques to reduce the size of various cryptographic outputs without loss of security. Our approach can be generalized for multiple primitives, such as cryptographic key generation, signing, hashing and encryption schemes, by introducing a brute-forcing step to provers/senders aiming at compressing submitted cryptographic material. Interestingly, mining can result in record-size cryptographic outputs, and we show that 5%-12% shorter hash digests and signatures are practically feasible even with commodity hardware. As a result, our techniques make compressing addresses and transaction signatures possible in order to pay less fees in blockchain applications while decreasing the demand for blockchain space, a major bottleneck for initial syncing, communication and storage. Also, the effects of "compressing once - then reuse" at mass scale can be economically profitable in the long run for both the Web2 and Web3 ecosystems. Our paradigm relies on a brute-force search operation in order to craft the primitive's output such that it fits into fewer bytes, while the "missing" fixed bytes are implied by the system parameters and omitted from the actual communication. While such compression requires computational effort depending on the level of compression, this cost is only paid at the source (i.e., in blockchains, senders are rewarded by lowered transaction fees), and the benefits of the compression are enjoyed by the whole ecosystem. As a starting point, we show how our paradigm applies to some basic primitives commonly used in blockchain applications but also traditional Web2 transactions (such as shorter digital certificates), and show how security is preserved using a bit security framework. Surprisingly, we also identified cases where wise mining strategies require proportionally less effort than naive brute-forcing, shorter hash-based signatures being one of the best examples. We also evaluate our approach for several primitives based on different levels of compression. Our evaluation concretely demonstrates the benefits both in terms of financial cost and storage if adopted by the community, and we showcase how our technique can achieve up to 83.21% reduction in smart contract gas fees at a cost of less than 4 s of computation on a single core.
引用
收藏
页码:101 / 118
页数:18
相关论文
共 50 条
  • [41] TIME-SPACE RATHER THAN SPACE-TIME
    CAPEK, M
    DIOGENES, 1983, (123) : 30 - 49
  • [42] Cryptographic Primitives with Hinting Property
    Alamati, Navid
    Patranabis, Sikhar
    JOURNAL OF CRYPTOLOGY, 2024, 37 (03)
  • [43] Verse: An EDSL for Cryptographic Primitives
    Dang, Abhishek
    Kurur, Piyush P.
    PPDP'18: PROCEEDINGS OF THE 20TH INTERNATIONAL SYMPOSIUM ON PRINCIPLES AND PRACTICE OF DECLARATIVE PROGRAMMING, 2018,
  • [44] TIME-SPACE SCHEDULING METHOD
    STRADAL, O
    CACHA, J
    JOURNAL OF THE CONSTRUCTION DIVISION-ASCE, 1982, 108 (03): : 445 - 457
  • [45] Time-space tradeoffs for satisfiability
    Fortnow, L
    JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 2000, 60 (02) : 337 - 353
  • [46] Making cryptographic primitives harder
    Hasegawa, Shingo
    Hatanaka, Hiroyuki
    Isobe, Shuji
    Koizumi, Eisuke
    Shizuya, Hiroki
    IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES, 2008, E91A (01) : 330 - 337
  • [47] Time-Space Diagram Revisited
    Anwar, Afian
    Zeng, Wei
    Arisona, Stefan Mueller
    TRANSPORTATION RESEARCH RECORD, 2014, (2442) : 1 - 7
  • [48] On the Bit Security of Cryptographic Primitives
    Micciancio, Daniele
    Walter, Michael
    ADVANCES IN CRYPTOLOGY - EUROCRYPT 2018, PT I, 2018, 10820 : 3 - 28
  • [49] Feebly secure cryptographic primitives
    Hirsch E.A.
    Melanich O.
    Nikolenko S.I.
    Journal of Mathematical Sciences, 2013, 188 (1) : 17 - 34
  • [50] Cryptographic Primitives with Hinting Property
    Alamati, Navid
    Patranabis, Sikhar
    ADVANCES IN CRYPTOLOGY- ASIACRYPT 2022, PT I, 2022, 13791 : 33 - 62