{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T21:27:57Z","timestamp":1780435677726,"version":"3.54.1"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T00:00:00Z","timestamp":1704153600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"the Key Specialized Research and Development Program of Henan Province","award":["222102210062"],"award-info":[{"award-number":["222102210062"]}]},{"name":"the Key Specialized Research and Development Program of Henan Province","award":["222102210052"],"award-info":[{"award-number":["222102210052"]}]},{"name":"the Basic Higher Educational Key Scientific Research Program of Henan Province","award":["22A413004"],"award-info":[{"award-number":["22A413004"]}]},{"name":"the National Key Research and Development Program","award":["2018YFA0704703"],"award-info":[{"award-number":["2018YFA0704703"]}]},{"DOI":"10.13039\/501100001809","name":"the National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61972073"],"award-info":[{"award-number":["61972073"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"the Fundamental Research Funds for the Central Universities of China"},{"name":"the Natural Science Foundation of Tianjin","award":["20JCZDJC00640"],"award-info":[{"award-number":["20JCZDJC00640"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Timed-release encryption (TRE) is a cryptographic primitive that can control the decryption time and has significant application value in time-sensitive scenarios. To solve the reliability issue of nodes in existing TRE anonymous interaction schemes, we propose a blockchain-based TRE protocol for anonymous query time trapdoors. In our protocol, the recipient divides the encrypted trapdoor request information into<jats:italic>n<\/jats:italic>ciphertext fragments using secret sharing technology near the decryption time, and employs the idea of onion routing to perform layer-by-layer encryption, creating onion-type data transmitted through middlemen selected from the smart contract. After receiving the ciphertext fragments, the time server integrates them to obtain the trapdoor request information and returns the corresponding time trapdoor to the recipient. This allows the recipient to query any time trapdoor anonymously. Our protocol provides a normative design for the smart contract and specific constraints on the participants\u2019 behavior. Compared with the related anonymous query trapdoor schemes, our protocol improves the probability of successful queries. Security analysis shows that our protocol can resist release-ahead attack, interruption attack, eavesdropping attack, and replacement attack. Performance analysis shows that our protocol outperforms related protocols regarding anonymity, efficiency, and flexibility, achieving highly efficient anonymous interactions. Finally, we conducted an experiment in the Ethereum<jats:italic>Rinkeby<\/jats:italic>test network. For the settings of ciphertext fragment number<jats:inline-formula><jats:alternatives><jats:tex-math>$$n=3$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>n<\/mml:mi><mml:mo>=<\/mml:mo><mml:mn>3<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>and ciphertext fragment threshold<jats:inline-formula><jats:alternatives><jats:tex-math>$$t=2$$<\/jats:tex-math><mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\"><mml:mrow><mml:mi>t<\/mml:mi><mml:mo>=<\/mml:mo><mml:mn>2<\/mml:mn><\/mml:mrow><\/mml:math><\/jats:alternatives><\/jats:inline-formula>, the gas consumption for a user to execute the contract was $5.66, which was higher than the contract cost of related schemes, but the contract execution cost was within an acceptable range.<\/jats:p>","DOI":"10.1186\/s13677-023-00536-1","type":"journal-article","created":{"date-parts":[[2024,1,2]],"date-time":"2024-01-02T14:02:47Z","timestamp":1704204167000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Timed-release encryption anonymous interaction protocol based on smart contract"],"prefix":"10.1186","volume":"13","author":[{"given":"Ke","family":"Yuan","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zilin","family":"Wang","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Keyan","family":"Chen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bingcai","family":"Zhou","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Chunfu","family":"Jia","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2024,1,2]]},"reference":[{"key":"536_CR1","unstructured":"Rivest RL, Shamir A, Wagner DA (2001) Time-lock puzzles and timed-release crypto. Massachusetts Institute of Technology"},{"key":"536_CR2","unstructured":"May T (1993) Timed-release crypto. http:\/\/cypherpunks.venona.com\/date\/1993\/02\/msg00129.html. Accessed date 10 Feb 1993"},{"issue":"2","key":"536_CR3","first-page":"1","volume":"86","author":"L Jia","year":"2018","unstructured":"Jia L, Jager T, Kakvi SA, Warinschi B (2018) How to build time-lock encryption. Des Codes Cryptogr 86(2):1\u201338","journal-title":"Des Codes Cryptogr"},{"issue":"4","key":"536_CR4","doi-asserted-by":"publisher","first-page":"746","DOI":"10.1109\/TIFS.2015.2509912","volume":"11","author":"Y Yang","year":"2016","unstructured":"Yang Y, Ma M (2016) Conjunctive keyword search with designated tester and timing enabled proxy re-encryption function for e-health clouds. IEEE Trans Inf Forensic Secur 11(4):746\u2013759","journal-title":"IEEE Trans Inf Forensic Secur"},{"key":"536_CR5","doi-asserted-by":"publisher","unstructured":"Yuan K, Liu Z, Jia C, Yang J, and Lv S (2013) Multi-user public key timed-release searchable encryption. 2013 Fourth international conference on emerging intelligent data and web technologies. p. 363\u2013370. https:\/\/doi.org\/10.1109\/EIDWT.2013.69","DOI":"10.1109\/EIDWT.2013.69"},{"key":"536_CR6","doi-asserted-by":"crossref","unstructured":"Chan A, Blake IF (2005) Scalable, server-passive, user-anonymous timed release cryptography. In: IEEE International Conference on Distributed Computing Systems. p 504-513.\u00a0IEEE, Columbus","DOI":"10.1109\/ICDCS.2005.72"},{"key":"536_CR7","unstructured":"Paterson KG, Quaglia EA (2010) Time-specific encryption. In: Security and Cryptography for Networks, 7th International Conference, SCN 2010, p 1-16. Amalfi, Italy, September 13-15, 2010. Proceedings.\u00a0Springer-Verlag, Berlin"},{"key":"536_CR8","doi-asserted-by":"crossref","unstructured":"Xiong J, Li F, Ma J, Liu X, Yao Z, Chen PS (2015) A full lifecycle privacy protection scheme for sensitive data in cloud computing. Peer-to-peer Netw Appl 8(8-6):1025\u20131037","DOI":"10.1007\/s12083-014-0295-x"},{"key":"536_CR9","doi-asserted-by":"crossref","unstructured":"Yuan K, Wang Y, Zeng Y, Ouyang W, Li Z, Jia C (2021) Provably secure security-enhanced timed-release encryption in the random oracle model. Secur Commun Netw 2021(3):1-10","DOI":"10.1155\/2021\/5593363"},{"key":"536_CR10","doi-asserted-by":"crossref","unstructured":"Kuhn C, Hofheinz D, Rupp A, Strufe T (2021) Onion routing with replies. In: Tibouchi M, Wang, H (eds) Advances in Cryptology - ASIACRYPT 2021, p 573-604. Springer, Cham","DOI":"10.1007\/978-3-030-92075-3_20"},{"key":"536_CR11","doi-asserted-by":"crossref","unstructured":"Ayaz F, Sheng Z, Tian D, Guan YL (2022) A blockchain based federated learning for message dissemination in vehicular networks. IEEE Trans Veh Technol 71(2):1927-1940","DOI":"10.1109\/TVT.2021.3132226"},{"issue":"3","key":"536_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3439725","volume":"54","author":"J Huang","year":"2021","unstructured":"Huang J, He D, Obaidat MS, Vijayakumar P, Choo K (2021) The application of the blockchain technology in voting systems: A review. ACM Comput Surv 54(3):1\u201328","journal-title":"ACM Comput Surv"},{"key":"536_CR13","doi-asserted-by":"crossref","unstructured":"Wang J, Lu N, Cheng Q, Zhou L, Shi W (2021) A secure spectrum auction scheme without the trusted party based on the smart contract. Dig Users Dig Commun 7(2):223-234","DOI":"10.1016\/j.dcan.2020.06.004"},{"key":"536_CR14","doi-asserted-by":"crossref","unstructured":"Ma A, Mm A, Am A, Skk B (2021) Automatic smart contract generation for internet of media things - sciencedirect. ICT Express 7(3):274-277","DOI":"10.1016\/j.icte.2021.08.009"},{"issue":"3","key":"536_CR15","first-page":"1","volume":"16","author":"D Catalano","year":"2016","unstructured":"Catalano D, Fiore D, Gennaro R (2016) A certificateless approach to onion routing. Int J Inf Secur 16(3):1\u201317","journal-title":"Int J Inf Secur"},{"key":"536_CR16","doi-asserted-by":"crossref","unstructured":"Yuan J, Yang J, Wang C, Jia X, Fu FW, Xu G (2022) A new efficient hierarchical multi-secret sharing scheme based on linear homogeneous recurrence relations. Inf Sci Int J\u00a0592:36-49","DOI":"10.1016\/j.ins.2022.01.053"},{"issue":"10","key":"536_CR17","first-page":"530","volume":"40","author":"J Liu","year":"2015","unstructured":"Liu J, Garcia F, Ryan M (2015) Time-release protocol from bitcoin and witness encryption for sat. Korean Circ J 40(10):530\u20135","journal-title":"Korean Circ J"},{"key":"536_CR18","doi-asserted-by":"crossref","unstructured":"Chao L, Palanisamy B (2018) Decentralized release of self-emerging data using smart contracts. In: 2018 IEEE 37th Symposium on Reliable Distributed Systems (SRDS), p 213-220.\u00a0IEEE, Salvador","DOI":"10.1109\/SRDS.2018.00033"},{"key":"536_CR19","unstructured":"Ning J, Dang H, Hou R, Chang EC (2018) Keeping time-release secrets through smart contracts. IACR Cryptol ePrint Arch 2018:1166. https:\/\/api.semanticscholar.org\/CorpusID:54200316."},{"key":"536_CR20","doi-asserted-by":"crossref","unstructured":"Lai WJ, Hsueh CW, Wu JL (2019) A fully decentralized time-lock encryption system on blockchain. In: 2019 IEEE International Conference on Blockchain (Blockchain), p 302-307.\u00a0IEEE, Atlanta","DOI":"10.1109\/Blockchain.2019.00047"},{"issue":"2","key":"536_CR21","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1109\/TC.2015.2419662","volume":"65","author":"Q Wu","year":"2016","unstructured":"Wu Q, Qin B, Zhang L, Domingo-Ferrer J, Farras O, Manjon JA (2016) Contributory broadcast encryption with efficient encryption and short ciphertexts. IEEE Trans Comput 65(2):466\u2013479","journal-title":"IEEE Trans Comput"},{"key":"536_CR22","unstructured":"Msn. currency converter. [EB\/OL]. https:\/\/www.msn.cn\/zh-cn\/money\/tools\/currencyconverter\/fi-brjcfr?ocid=ansMSNMoney11&duration=1D. Accessed 19 June - 01 July 2022"},{"key":"536_CR23","unstructured":"Etherscan. transaction information. [EB\/OL], https:\/\/etherscan.io\/block\/12965263. Accessed 19 June - 01 July 2022"},{"key":"536_CR24","doi-asserted-by":"crossref","unstructured":"Yuan K, Cao H, Zhang S, et al (2023) A tamper-resistant timed secure data transmission protocol based on smart contract[J]. Scie Rep 13(1):11510","DOI":"10.1038\/s41598-023-38136-3"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-023-00536-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-023-00536-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T07:13:05Z","timestamp":1730963585000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-023-00536-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,1,2]]},"references-count":24,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2024,12]]}},"alternative-id":["536"],"URL":"https:\/\/doi.org\/10.1186\/s13677-023-00536-1","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024,1,2]]},"assertion":[{"value":"11 July 2023","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 October 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"2 January 2024","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"Not applicable.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"The research has consent by all authors and there is no conflict.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"The authors declare no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"3"}}