Author:
Yuan Ke,Cao Haowen,Zhang Suya,Zhai Chenxu,Du Xiaoyu,Jia Chunfu
Abstract
AbstractMany time-sensitive scenarios need to decrypt data at a specified time. The timed-release encryption (TRE) primitive can meet this requirement. However, in the single-time server TRE model, there is a single point of failure problem. Therefore, we propose a tamper-resistant timed secure data transmission protocol based on smart contracts. Firstly, by decomposing the ciphertext into ciphertext fragments, the amount of deposit that a single middleman needs to submit is reduced. Secondly, it provides the system with security redundancy that changes with the decomposition mode. Thirdly, the sender is required to submit the hash value of each ciphertext fragment to the blockchain network at the same time as sending data, so that the receiver can quickly verify the authenticity of the ciphertext to resist substitution attack. Security analysis shows that the proposed protocol model can resist interruption attacks, release-ahead attacks and replacement attacks. Finally, we conduct a monetary cost test on the Ethereum’s Rinkeby test network. The results show that our running cost is almost double compared with the existing similar scheme, but it is still very low and almost negligible compared with the value of the content and the expected profits it brings.
Funder
the Basic Higher Educational Key Scientific Research Program of Henan Province
the Key Specialized Research and Development Program of Henan Province
the National Key Research and Development Program
the National Natural Science Foundation of China
the Fundamental Research Funds for the Central Universities of China<
the Natural Science Foundation of Tianjin
Publisher
Springer Science and Business Media LLC
Reference35 articles.
1. Rivest, R. L., Shamir, A. & Wagner, D. A. Time-lock puzzles and timed-release crypto. Massachusetts Institute of Technology (2001).
2. T, M. Timed-release crypto. http://cypherpunks.venona.com/date/1993/02/msg00129.html (1993).
3. Mahmoody, M., Moran, T. & Vadhan, S. Time-lock puzzles in the random oracle model. In Advances in Cryptology–CRYPTO 2011: 31st Annual Cryptology Conference, Santa Barbara, CA, USA, August 14-18, 2011. Proc. 31, 39–50 (Springer, 2011).
4. Bitansky, N. et al. Time-lock puzzles from randomized encodings. In Proc. of the 2016 ACM Conf. on Innovations in Theoretical Computer Science, 345–356 (2016).
5. Liu, J., Jager, T., Kakvi, S. A. & Warinschi, B. How to build time-lock encryption. Designs Codes Cryptography 86, 2549–2586 (2018).
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献