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 条
  • [31] On the design of cryptographic primitives
    Caballero-Gil, Pino
    Fuster-Sabater, Amparo
    ACTA APPLICANDAE MATHEMATICAE, 2006, 93 (1-3) : 279 - 297
  • [32] Cryptographic primitives in blockchains
    Wang, Licheng
    Shen, Xiaoying
    Li, Jing
    Shao, Jun
    Yang, Yixian
    JOURNAL OF NETWORK AND COMPUTER APPLICATIONS, 2019, 127 : 43 - 58
  • [33] ON UNIVERSAL CLASSES OF FAST HIGH-PERFORMANCE HASH FUNCTIONS, THEIR TIME-SPACE TRADEOFF, AND THEIR APPLICATIONS
    SIEGEL, A
    30TH ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, 1989, : 20 - 25
  • [34] The time-space of craftsmanship
    Eriksson, Lars
    Seiler, Joakim
    Jarefjall, Patrik
    Almevik, Gunnar
    CRAFT RESEARCH, 2019, 10 (01) : 17 - 39
  • [35] Time-Space Fluctuations
    Miguel, Alcebiades Diniz
    ARQUIVO MAARAVI-REVISTA DIGITAL DE ESTUDOS JUDAICOS DA UFMG, 2013, 7 (13) : 3 - 16
  • [36] ECONOMIC TIME-SPACE
    HRUBY, P
    POLITICKA EKONOMIE, 1970, 18 (08) : 735 - 742
  • [37] POSTER: Stopping Run-Time Countermeasures in Cryptographic Primitives
    Kim, Myung-Hyun
    Youn, Taek-Young
    Lee, Seungkwang
    APPLIED CRYPTOGRAPHY AND NETWORK SECURITY WORKSHOPS, ACNS 2023 SATELLITE WORKSHOPS, ADSC 2023, AIBLOCK 2023, AIHWS 2023, AIOTS 2023, CIMSS 2023, CLOUD S&P 2023, SCI 2023, SECMT 2023, SIMLA 2023, 2023, 13907 : 675 - 679
  • [38] POSTER: Stopping Run-Time Countermeasures in Cryptographic Primitives
    Kim, Myung-Hyun
    Youn, Taek-Young
    Lee, Seungkwang
    Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 2023, 13907 LNCS : 675 - 679
  • [39] Time-space and space-times
    Laudal, OA
    Noncommutative Geometry and Representation Theory in Mathematical Physics, 2005, 391 : 249 - 280
  • [40] TIME-SPACE TRADEOFF IN DEEP LEARNING MODELS FOR CROP CLASSIFICATION ON SATELLITE MULTI-SPECTRAL IMAGE TIME SERIES
    Garnot, V. Sainte Fare
    Landrieu, L.
    Giordano, S.
    Chehata, N.
    2019 IEEE INTERNATIONAL GEOSCIENCE AND REMOTE SENSING SYMPOSIUM (IGARSS 2019), 2019, : 6247 - 6250