{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,15]],"date-time":"2026-04-15T01:37:34Z","timestamp":1776217054986,"version":"3.50.1"},"reference-count":64,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T00:00:00Z","timestamp":1746835200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T00:00:00Z","timestamp":1746835200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cybersecurity"],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>As a variant of the signcryption scheme, threshold unsigncryption operates among multiple receiver members through a (<jats:italic>t<\/jats:italic>,\u00a0<jats:italic>n<\/jats:italic>) threshold process during the unsigncryption phase to improve security and robustness, and has been widely deployed in various applications such as cloud computing, blockchain, and electronic auctions. However, existing schemes only consider security under a limited <jats:italic>static<\/jats:italic> corruption model, where the adversary selects which parties to corrupt before the protocol begins. As a result, these schemes lack the flexibility to address more complex attack forms posed by real-world adversaries. To solve this issue, it is worth investigating threshold unsigncryption schemes with adaptive security. In this paper, we propose the first provably secure (<jats:italic>t<\/jats:italic>,\u00a0<jats:italic>n<\/jats:italic>) threshold unsigncryption scheme in the standard model against <jats:italic>adaptive<\/jats:italic> corruption adversaries who can corrupt parties at any time during protocol execution. The main contributions include: First, we provide the formal syntactic definition and security model of threshold unsigncryption schemes under the adaptive corruption model. Second, we employ the dual system technique to formally prove that the proposed scheme can achieve adaptive security in the standard model. Notably, our scheme is equipped with valuable properties such as non-interactivity, robustness, public verifiability, and splittable unsigncryption, significantly enhancing usability and functional completeness. Besides, we implement the proposed scheme on two types of elliptic curve groups with different security levels and evaluate its practical performance under different thresholds. Experiments demonstrate that on a composite order group with 80-bit security, a single receiver only takes 16.61 <jats:italic>s<\/jats:italic> to perform the threshold unsigncryption phase when the number of receivers <jats:italic>n<\/jats:italic> is 20 and the threshold <jats:italic>t<\/jats:italic> reaches up to 18. As a pioneering adaptively secure threshold unsigncryption scheme, our work not only establishes a benchmark for future proposals but also broadens its application in scenarios requiring high-security levels and flexible key management, such as electronic voting.\n<\/jats:p>","DOI":"10.1186\/s42400-024-00344-3","type":"journal-article","created":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T00:01:52Z","timestamp":1746835312000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Adaptively secure, splittable, and robust threshold unsigncryption"],"prefix":"10.1186","volume":"8","author":[{"given":"Yuxin","family":"Tong","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shimin","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhiwei","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rui","family":"Xue","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,5,10]]},"reference":[{"issue":"9","key":"344_CR1","doi-asserted-by":"publisher","first-page":"11091","DOI":"10.1007\/s11042-018-6636-7","volume":"78","author":"M Al-Zubi","year":"2019","unstructured":"Al-Zubi M, Abu-Shareha AA (2019) Efficient signcryption scheme based on el-gamal and schnorr. Multim Tools Appl 78(9):11091\u201311104","journal-title":"Multim Tools Appl"},{"key":"344_CR2","unstructured":"Armbrust M (2009) Above the clouds: a berkeley view of cloud computing"},{"key":"344_CR3","doi-asserted-by":"crossref","unstructured":"Bacho R, Loss J (2022) On the adaptive security of the threshold BLS signature scheme. In: proceedings of the 2022 ACM SIGSAC conference on computer and communications security, pp. 193\u2013207","DOI":"10.1145\/3548606.3560656"},{"key":"344_CR4","doi-asserted-by":"crossref","unstructured":"Bacho R, Loss J, Tessaro S, Wagner B, Zhu C (2023) Twinkle: Threshold Signatures from DDH with Full Adaptive Security. Cryptology ePrint Archive","DOI":"10.1007\/978-3-031-58716-0_15"},{"key":"344_CR5","doi-asserted-by":"crossref","unstructured":"Baek J, Zheng Y (2004) Identity-based threshold decryption. In: international workshop on public key cryptography, pp. 262\u2013276. Springer","DOI":"10.1007\/978-3-540-24632-9_19"},{"key":"344_CR6","doi-asserted-by":"crossref","unstructured":"Barreto PS, Libert B, McCullagh N, Quisquater J-J (2005) Efficient and provably-secure identity-based signatures and signcryption from bilinear maps. In: Advances in Cryptology-ASIACRYPT 2005: 11th international conference on the theory and application of cryptology and information security, Chennai, India, December 4-8, 2005. Proceedings 11, pp. 515\u2013532. Springer","DOI":"10.1007\/11593447_28"},{"key":"344_CR7","doi-asserted-by":"crossref","unstructured":"Boneh D, Boyen X, Halevi S (2006) Chosen ciphertext secure public key threshold encryption without random oracles. In: cyptographers\u2019 tack at the RSA cnference, pp. 226\u2013243. Springer","DOI":"10.1007\/11605805_15"},{"key":"344_CR8","doi-asserted-by":"crossref","unstructured":"Boneh D, Gennaro R, Goldfeder S, Jain A, Kim S, Rasmussen PM, Sahai A (2018) Threshold cryptosystems from threshold fully homomorphic encryption. In: advances in cryptology\u2013CRYPTO 2018: 38th annual international cryptology conference, Santa Barbara, CA, USA, proceedings, Part I 38, pp. 565\u2013596. Springer","DOI":"10.1007\/978-3-319-96884-1_19"},{"key":"344_CR9","doi-asserted-by":"crossref","unstructured":"Boneh D, Komlo C (2022) Threshold signatures with private accountability. In: annual international cryptology conference, pp. 551\u2013581. Springer","DOI":"10.1007\/978-3-031-15985-5_19"},{"key":"344_CR10","doi-asserted-by":"crossref","unstructured":"Boneh D, Shen E, Waters B (2006) Strongly unforgeable signatures based on computational diffie-hellman. In: Public Key Cryptography-PKC 2006: 9th international conference on theory and practice in public-key cryptography, New York, NY, USA, proceedings 9, pp. 229\u2013240. Springer","DOI":"10.1007\/11745853_15"},{"key":"344_CR11","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E-J, Nissim K (2005) Evaluating 2-dnf formulas on ciphertexts. In: theory of cryptography: second theory of cryptography conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005. Proceedings 2, pp. 325\u2013341. Springer","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"344_CR12","doi-asserted-by":"crossref","unstructured":"Boudgoust K, Scholl P (2023) Simple threshold (fully homomorphic) encryption from lwe with polynomial modulus. In: international conference on the theory and application of cryptology and information security, pp. 371\u2013404. Springer","DOI":"10.1007\/978-981-99-8721-4_12"},{"key":"344_CR13","doi-asserted-by":"crossref","unstructured":"Canetti R, Gennaro R, Jarecki S, Krawczyk H, Rabin T (1999) Adaptive security for threshold cryptosystems. In: advances in cryptology-CRYPTO\u201999: 19th annual international cryptology conference Santa Barbara, California, USA, proceedings 19, pp. 98\u2013116 . Springer","DOI":"10.1007\/3-540-48405-1_7"},{"key":"344_CR14","doi-asserted-by":"crossref","unstructured":"Canetti R, Halevi S, Katz J (2004) Chosen-ciphertext security from identity-based encryption. In: advances in cryptology-EUROCRYPT 2004: international conference on the theory and applications of cryptographic techniques, Interlaken, Switzerland, 2-6, 2004. Proceedings 23, pp. 207\u2013222. Springer","DOI":"10.1007\/978-3-540-24676-3_13"},{"key":"344_CR15","doi-asserted-by":"crossref","unstructured":"Chaum D, Pedersen TP (1992) Wallet databases with observers. In: annual international cryptology Conference, pp. 89\u2013105. Springer","DOI":"10.1007\/3-540-48071-4_7"},{"key":"344_CR16","doi-asserted-by":"crossref","unstructured":"Chow SS, Yiu S-M, Hui LC, Chow K-P (2004) Efficient forward and provably secure id-based signcryption scheme with public verifiability and public ciphertext authenticity. In: information security and cryptology-ICISC 2003: 6th international conference, Seoul, Korea, November 27-28, 2003. Revised Papers 6, pp. 352\u2013369. Springer","DOI":"10.1007\/978-3-540-24691-6_26"},{"key":"344_CR17","doi-asserted-by":"crossref","unstructured":"Cramer R, Damg\u00e5rd I, Dziembowski S, Hirt M, Rabin T (1999) Efficient multiparty computations secure against an adaptive adversary. In: international conference on the theory and applications of cryptographic techniques, pp. 311\u2013326. Springer","DOI":"10.1007\/3-540-48910-X_22"},{"key":"344_CR18","doi-asserted-by":"crossref","unstructured":"Crites E, Komlo C, Maller M (2023) Fully adaptive schnorr threshold signatures. In: annual international cryptology conference, pp. 678\u2013709. Springer","DOI":"10.1007\/978-3-031-38557-5_22"},{"key":"344_CR19","doi-asserted-by":"crossref","unstructured":"De Caro A, Iovino V (2011) jpbc: Java pairing based cryptography. In: proceedings of the 16th IEEE symposium on computers and communications, ISCC 2011, pp. 850\u2013855. IEEE, Kerkyra, Corfu, Greece, June 28-July 1","DOI":"10.1109\/ISCC.2011.5983948"},{"key":"344_CR20","doi-asserted-by":"crossref","unstructured":"Desmedt Y (1987) Society and group oriented cryptography: A new concept. In: conference on the theory and application of cryptographic techniques, pp. 120\u2013127 Springer","DOI":"10.1007\/3-540-48184-2_8"},{"key":"344_CR21","doi-asserted-by":"crossref","unstructured":"Desmedt Y (1992) Threshold cryptosystems. In: international workshop on the theory and application of cryptographic techniques, pp. 1\u201314 . Springer","DOI":"10.1007\/3-540-57220-1_47"},{"key":"344_CR22","doi-asserted-by":"crossref","unstructured":"Devevey J, Libert B, Nguyen K, Peters T, Yung M (2021) Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings. In: IACR international conference on public-key cryptography, pp. 659\u2013690 . Springer","DOI":"10.1007\/978-3-030-75245-3_24"},{"key":"344_CR23","doi-asserted-by":"crossref","unstructured":"Dierks T, Rescorla E (2008) The transport layer security (TLS) protocol version 1.2. Technical report","DOI":"10.17487\/rfc5246"},{"key":"344_CR24","doi-asserted-by":"crossref","unstructured":"Garg S, Kolonelos D, Policharla G-V, Wang M (2024) Threshold encryption with silent setup. In: annual international cryptology conference, pp. 352\u2013386. Springer","DOI":"10.1007\/978-3-031-68394-7_12"},{"key":"344_CR25","doi-asserted-by":"crossref","unstructured":"Garg S, Jain A, Mukherjee P, Sinha R, Wang M, Zhang Y (2024) hints: Threshold signatures with silent setup. In: 2024 IEEE symposium on security and privacy (SP), pp. 3034\u20133052. IEEE","DOI":"10.1109\/SP54263.2024.00057"},{"key":"344_CR26","doi-asserted-by":"crossref","unstructured":"Guillevic A (2013) Comparing the pairing efficiency over composite-order and prime-order elliptic curves. In: applied cryptography and network security: 11th international conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceedings 11, pp. 357\u2013372. Springer","DOI":"10.1007\/978-3-642-38980-1_22"},{"key":"344_CR27","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s10623-012-9688-0","volume":"70","author":"J Herranz","year":"2014","unstructured":"Herranz J, Ruiz A, S\u00e1ez G (2014) Signcryption schemes with threshold unsigncryption, and applications. Designs, codes cryptogr 70:323\u2013345","journal-title":"Designs, codes cryptogr"},{"key":"344_CR28","doi-asserted-by":"crossref","unstructured":"Herranz J, Ruiz A, S\u00e1ez G (2010) Fully secure threshold unsigncryption. In: international conference on provable security, pp. 261\u2013278. Springer","DOI":"10.1007\/978-3-642-16280-0_18"},{"issue":"2","key":"344_CR29","first-page":"196","volume":"17","author":"L Huixian","year":"2020","unstructured":"Huixian L, Jin G, Lingyun W, Liaojun P (2020) Mpkc-based threshold proxy signcryption scheme. Int. Arab J. Inf. Tech 17(2):196\u2013206","journal-title":"Int. Arab J. Inf. Tech"},{"key":"344_CR30","doi-asserted-by":"crossref","unstructured":"Jarecki S, Lysyanskaya A (2000) Adaptively secure threshold cryptography: Introducing concurrency, removing erasures. In: advances in cryptology-EUROCRYPT 2000: international conference on the theory and application of cryptographic techniques Bruges, Belgium, proceedings 19, pp. 221\u2013242 . Springer","DOI":"10.1007\/3-540-45539-6_16"},{"key":"344_CR31","unstructured":"Jung H, Lee D, Lim J, Chang K (2001) Signcryption scheme with forward security. Proceeding of WISA2001"},{"key":"344_CR32","doi-asserted-by":"crossref","unstructured":"Kohno T, Stubblefield A, Rubin AD, Wallach DS (2004) Analysis of an electronic voting system. In: IEEE symposium on security and privacy, 2004. proceedings. 2004, pp. 27\u201340. IEEE","DOI":"10.1109\/SECPRI.2004.1301313"},{"key":"344_CR33","unstructured":"Koo J-H, Kim H-J, Jeong IR, Lee D-H, Lim J (2001) Jointly unsigncryptable signcryption schemes. In: Proceedings of WISA, 1, pp. 397\u2013407"},{"issue":"1","key":"344_CR34","first-page":"20","volume":"81","author":"M Kudo","year":"1998","unstructured":"Kudo M (1998) Secure electronic sealed-bid auction protocol with public key cryptography. IEICE Trans Fundam Electron , Commun Comput Sci 81(1):20\u201327","journal-title":"IEICE Trans Fundam Electron , Commun Comput Sci"},{"key":"344_CR35","doi-asserted-by":"crossref","unstructured":"Lai RW, Malavolta G, Ronge V (2019) Succinct arguments for bilinear group arithmetic: practical structure-preserving cryptography. In: proceedings of the 2019 ACM SIGSAC conference on computer and communications security, pp. 2057\u20132074","DOI":"10.1145\/3319535.3354262"},{"key":"344_CR36","doi-asserted-by":"crossref","unstructured":"Lewko A, Waters B (2010) New techniques for dual system encryption and fully secure hibe with short ciphertexts. In: theory of cryptography conference, pp. 455\u2013479 . Springer","DOI":"10.1007\/978-3-642-11799-2_27"},{"issue":"14","key":"344_CR37","doi-asserted-by":"publisher","first-page":"2112","DOI":"10.1002\/cpe.2826","volume":"25","author":"F Li","year":"2013","unstructured":"Li F, Bin Muhaya FT, Khan MK, Takagi T (2013) Lattice-based signcryption. Concurr Computation: Pract Exp 25(14):2112\u20132122","journal-title":"Concurr Computation: Pract Exp"},{"key":"344_CR38","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s00607-017-0548-7","volume":"99","author":"F Li","year":"2017","unstructured":"Li F, Liu B, Hong J (2017) An efficient signcryption for data access control in cloud computing. Computing 99:465\u2013479","journal-title":"Computing"},{"issue":"2","key":"344_CR39","first-page":"155","volume":"3","author":"F Li","year":"2006","unstructured":"Li F, Xin X, Hu Y (2006) Id-based signcryption scheme with (t, n) shared unsigncryption. Int. J. Netw. Secur. 3(2):155\u2013159","journal-title":"Int. J. Netw. Secur."},{"key":"344_CR40","doi-asserted-by":"crossref","unstructured":"Li F, Gao J, Hu Y (2005) Id-based threshold unsigncryption scheme from pairings. In: information security and cryptology: first SKLOIS conference, CISC 2005, Beijing, China, December 15-17, 2005. proceedings 1, pp. 242\u2013253. Springer","DOI":"10.1007\/11599548_21"},{"key":"344_CR41","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/j.tcs.2013.01.001","volume":"478","author":"B Libert","year":"2013","unstructured":"Libert B, Yung M (2013) Adaptively secure non-interactive threshold cryptosystems. Theoreti Comput Sci. 478:76\u2013100","journal-title":"Theoreti Comput Sci."},{"key":"344_CR42","doi-asserted-by":"crossref","unstructured":"Libert B, Quisquater J-J (2003) A new identity based signcryption scheme from pairings. In: proceedings 2003 IEEE information theory workshop (Cat. No. 03EX674), pp. 155\u2013158 . IEEE","DOI":"10.1109\/ITW.2003.1216718"},{"key":"344_CR43","doi-asserted-by":"crossref","unstructured":"Lysyanskaya A, Peikert C (2001) Adaptive security in the threshold setting: From cryptosystems to signature schemes. In: Advances in Cryptology-ASIACRYPT 2001: 7th international conference on the theory and application of cryptology and information security gold coast, Australia, proceedings 7, pp. 331\u2013350. Springer","DOI":"10.1007\/3-540-45682-1_20"},{"key":"344_CR44","doi-asserted-by":"crossref","unstructured":"Malone-Lee J, Mao W (2003) Two birds one stone: Signcryption using rsa. In: cryptographers\u2019 track at the RSA conference, pp. 211\u2013226 . Springer","DOI":"10.1007\/3-540-36563-X_14"},{"key":"344_CR45","doi-asserted-by":"crossref","unstructured":"Mohassel P (2011) One-time signatures and chameleon hash functions. In: Selected Areas in Cryptography: 17th international workshop, SAC 2010, waterloo, ontario, Canada, Revised Selected Papers 17, pp. 302\u2013319. Springer","DOI":"10.1007\/978-3-642-19574-7_21"},{"key":"344_CR46","unstructured":"Nakamoto S (2008) Bitcoin: a peer-to-peer electronic cash system. Satoshi Nakamoto"},{"issue":"11","key":"344_CR47","doi-asserted-by":"publisher","first-page":"0166173","DOI":"10.1371\/journal.pone.0166173","volume":"11","author":"L Pang","year":"2016","unstructured":"Pang L, Yan X, Zhao H, Hu Y, Li H (2016) A novel multi-receiver signcryption scheme with complete anonymity. PloS one 11(11):0166173","journal-title":"PloS one"},{"key":"344_CR48","doi-asserted-by":"publisher","first-page":"180205","DOI":"10.1109\/ACCESS.2019.2958089","volume":"7","author":"J Qiu","year":"2019","unstructured":"Qiu J, Fan K, Zhang K, Pan Q, Li H, Yang Y (2019) An efficient multi-message and multi-receiver signcryption scheme for heterogeneous smart mobile iot. IEEE Access 7:180205\u2013180217","journal-title":"IEEE Access"},{"issue":"3","key":"344_CR49","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1145\/937503.937506","volume":"35","author":"S Rafaeli","year":"2003","unstructured":"Rafaeli S, Hutchison D (2003) A survey of key management for secure group communication. ACM Comput Surv (CSUR) 35(3):309\u2013329","journal-title":"ACM Comput Surv (CSUR)"},{"key":"344_CR50","doi-asserted-by":"crossref","unstructured":"Schnorr C-P (1990) Efficient identification and signatures for smart cards. In: advances in cryptology-CRYPTO\u201989 proceedings 9, pp. 239\u2013252. Springer","DOI":"10.1007\/0-387-34805-0_22"},{"key":"344_CR51","doi-asserted-by":"crossref","unstructured":"Selvi SSD, Vivek SS, Rangan CP, Priti S (2010) On the security of identity based threshold unsigncryption schemes. In: 2010 furth international conference on network and system security, pp. 554\u2013559. IEEE","DOI":"10.1109\/NSS.2010.99"},{"issue":"11","key":"344_CR52","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"A Shamir","year":"1979","unstructured":"Shamir A (1979) How to share a secret. Commun ACM 22(11):612\u2013613","journal-title":"Commun ACM"},{"key":"344_CR53","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00145-001-0020-9","volume":"15","author":"V Shoup","year":"2002","unstructured":"Shoup V, Gennaro R (2002) Securing threshold cryptosystems against chosen ciphertext attack. J Cryptology 15:75\u201396","journal-title":"J Cryptology"},{"key":"344_CR54","doi-asserted-by":"crossref","unstructured":"Waters B (2009) Dual system encryption: Realizing fully secure ibe and hibe under simple assumptions. In: annual international cryptology conference, pp. 619\u2013636. Springer","DOI":"10.1007\/978-3-642-03356-8_36"},{"issue":"14","key":"344_CR55","doi-asserted-by":"publisher","first-page":"11960","DOI":"10.1109\/JIOT.2022.3151359","volume":"10","author":"G Xu","year":"2022","unstructured":"Xu G, Dong J, Ma C, Liu J, Cliff UGO (2022) A certificateless signcryption mechanism based on blockchain for edge computing. IEEE Internet Things J 10(14):11960\u201311974","journal-title":"IEEE Internet Things J"},{"key":"344_CR56","doi-asserted-by":"crossref","unstructured":"Yang B, Yu Y, Li F, Sun Y (2007) Provably secure identity-based threshold unsigncryption scheme. In: international conference on autonomic and trusted computing, pp. 114\u2013122. Springer","DOI":"10.1007\/978-3-540-73547-2_14"},{"issue":"2","key":"344_CR57","doi-asserted-by":"publisher","first-page":"2687","DOI":"10.1109\/JSYST.2020.3007519","volume":"15","author":"H Yu","year":"2020","unstructured":"Yu H, Bai L, Hao M, Wang N (2020) Certificateless signcryption scheme from lattice. IEEE Syst J 15(2):2687\u20132695","journal-title":"IEEE Syst J"},{"key":"344_CR58","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2021.106981","volume":"221","author":"H Yu","year":"2021","unstructured":"Yu H, Wang S (2021) Certificateless threshold signcryption scheme with secret sharing mechanism. Knowledge-Based Syst 221:106981","journal-title":"Knowledge-Based Syst"},{"key":"344_CR59","volume":"70","author":"H Yu","year":"2022","unstructured":"Yu H, Wang H (2022) Elliptic curve threshold signature scheme for blockchain. J Inform Security Appl 70:103345","journal-title":"J Inform Security Appl"},{"issue":"10","key":"344_CR60","doi-asserted-by":"publisher","first-page":"11057","DOI":"10.1109\/TITS.2023.3276920","volume":"24","author":"H Yu","year":"2023","unstructured":"Yu H, Wang H (2023) Lattice-based threshold signcryption for blockchain oracle data transmission. IEEE Trans Intell Transp Syst 24(10):11057\u201311065","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"344_CR61","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2022.102457","volume":"126","author":"X Yu","year":"2022","unstructured":"Yu X, Zhao W, Tang D (2022) Efficient and provably secure multi-receiver signcryption scheme using implicit certificate in edge computing. J Syst Archit 126:102457","journal-title":"J Syst Archit"},{"key":"344_CR62","unstructured":"Zhang Z, Mian C, Jin Q (2002) Signcryption scheme with threshold shared unsigncryption preventing malicious receivers. In: 2002 IEEE region 10 conference on computers, communications, control and power engineering. TENCOM\u201902. proceedings., vol. 1, pp. 196\u2013199. IEEE"},{"key":"344_CR63","doi-asserted-by":"crossref","unstructured":"Zheng Y (1997) Digital signcryption or how to achieve cost (signature & encryption) $$\\ll$$cost (signature)+ cost (encryption). In: advances in cryptology-CRYPTO\u201997: 17th annual international cryptology conference santa barbara, California, USA August 17\u201321, 1997 Proceedings 17, pp. 165\u2013179 Springer","DOI":"10.1007\/BFb0052234"},{"key":"344_CR64","volume-title":"Principles of Distributed Database Systems","author":"MT \u00d6zsu","year":"1999","unstructured":"\u00d6zsu MT, Valduriez P et al (1999) Principles of Distributed Database Systems. Springer, Berlin Heidelberg"}],"container-title":["Cybersecurity"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00344-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s42400-024-00344-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s42400-024-00344-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,10]],"date-time":"2025-05-10T00:02:10Z","timestamp":1746835330000},"score":1,"resource":{"primary":{"URL":"https:\/\/cybersecurity.springeropen.com\/articles\/10.1186\/s42400-024-00344-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,5,10]]},"references-count":64,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2025,12]]}},"alternative-id":["344"],"URL":"https:\/\/doi.org\/10.1186\/s42400-024-00344-3","relation":{},"ISSN":["2523-3246"],"issn-type":[{"value":"2523-3246","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,5,10]]},"assertion":[{"value":"11 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 December 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 May 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no Conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interest"}}],"article-number":"57"}}