{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:12Z","timestamp":1750220052282,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T00:00:00Z","timestamp":1688947200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,10]]},"DOI":"10.1145\/3579856.3595785","type":"proceedings-article","created":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T14:52:13Z","timestamp":1688568733000},"page":"539-551","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["How Secure Are The Main Real-World Mix Networks \u2014 Case Studies To Explore Vulnerabilities And Usability"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-2433-8610","authenticated-orcid":false,"given":"Kun","family":"Peng","sequence":"first","affiliation":[{"name":"Huawei Technology Ltd, China and University of Queensland, Australia"}]}],"member":"320","published-online":{"date-parts":[[2023,7,10]]},"reference":[{"first-page":"273","volume-title":"ASIACRYPT \u201998","key":"e_1_3_2_1_1_1","unstructured":"[ 1 ] M\u00a0Abe. Mix-networks on permutation net-works . In ASIACRYPT \u201998 , pages 258\u2013 273 . [1] M\u00a0Abe. Mix-networks on permutation net-works. In ASIACRYPT \u201998, pages 258\u2013273."},{"key":"e_1_3_2_1_2_1","first-page":"324","volume-title":"PKC \u201901","author":"Abe M","unstructured":"[ 2 ] M Abe and F Hoshino . Remarks on mix-network based on permutation networks . In PKC \u201901 , pages 317\u2013 324 . [2] M Abe and F Hoshino. Remarks on mix-network based on permutation networks. In PKC \u201901, pages 317\u2013324."},{"issue":"8","key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1016\/j.cose.2005.07.008","article-title":"Seas, a secure e-voting protocol: Design and implementationstar, open","volume":"24","author":"Martinellib F","year":"2005","unstructured":"[ 3 ] R\u00a0Granchib, F Martinellib , M\u00a0Petrocchib, F\u00a0Baiardia, A\u00a0Fallenib and A\u00a0Vaccarellib . Seas, a secure e-voting protocol: Design and implementationstar, open . In Computers & Security , Volume 24 , Issue 8 , November 2005 , pages 642 \u2013 652 . [3] R\u00a0Granchib, F Martinellib, M\u00a0Petrocchib, F\u00a0Baiardia, A\u00a0Fallenib and A\u00a0Vaccarellib. Seas, a secure e-voting protocol: Design and implementationstar, open. In Computers & Security, Volume 24, Issue 8, November 2005, pages 642\u2013652.","journal-title":"Computers & Security"},{"key":"e_1_3_2_1_4_1","first-page":"280","volume-title":"Annual International Conference on the Theory and Applications of Cryptographic Techniques","author":"Bayer S","unstructured":"[ 4 ] S Bayer and J Groth . Efficient zero-knowledge argument for correctness of a shuffle . In Annual International Conference on the Theory and Applications of Cryptographic Techniques , pages 263\u2013 280 . Springer, 2012. [4] S Bayer and J Groth. Efficient zero-knowledge argument for correctness of a shuffle. In Annual International Conference on the Theory and Applications of Cryptographic Techniques, pages 263\u2013280. Springer, 2012."},{"key":"e_1_3_2_1_5_1","unstructured":"[ 5 ] M Bellare J Garay and T Rabin. Fast batch verification for modular exponentiation and digital signatures. [5] M Bellare J Garay and T Rabin. Fast batch verification for modular exponentiation and digital signatures."},{"key":"e_1_3_2_1_6_1","first-page":"444","volume-title":"EUROCRYPT \u201900","author":"Boudot F","unstructured":"[ 6 ] F Boudot . Efficient proofs that a committed number lies in an interval . In EUROCRYPT \u201900 , pages 431\u2013 444 . [6] F Boudot. Efficient proofs that a committed number lies in an interval. In EUROCRYPT \u201900, pages 431\u2013444."},{"key":"e_1_3_2_1_7_1","first-page":"71","volume-title":"ASIACRYPT \u201900","author":"Boyd C","unstructured":"[ 7 ] C Boyd and C Pavlovski . Attacking and repairing batch verification schemes . In ASIACRYPT \u201900 , pages 58\u2013 71 . [7] C Boyd and C Pavlovski. Attacking and repairing batch verification schemes. In ASIACRYPT \u201900, pages 58\u201371."},{"first-page":"252","volume-title":"ASIACRYPT \u201908","key":"e_1_3_2_1_8_1","unstructured":"[ 8 ] J\u00a0Camenisch, R\u00a0Chaabouni, and A\u00a0Shelat. Efficient protocols for set membership and range proofs . In ASIACRYPT \u201908 , pages 234\u2013 252 . [8] J\u00a0Camenisch, R\u00a0Chaabouni, and A\u00a0Shelat. Efficient protocols for set membership and range proofs. In ASIACRYPT \u201908, pages 234\u2013252."},{"key":"e_1_3_2_1_9_1","first-page":"336","volume-title":"ACISP \u201910","author":"Chaabouni R","unstructured":"[ 9 ] R Chaabouni , H Lipmaa , and A Shelat . Additive Combinatorics and Discrete Logarithm Based Range Protocols . In ACISP \u201910 , pages 336 - 351 . [9] R Chaabouni, H Lipmaa, and A Shelat. Additive Combinatorics and Discrete Logarithm Based Range Protocols. In ACISP \u201910, pages 336-351."},{"key":"e_1_3_2_1_10_1","first-page":"105","volume-title":"CRYPTO \u201992","author":"T\u00a0Pedersen D\u00a0Chaum","unstructured":"[ 10 ] D\u00a0Chaum and T\u00a0Pedersen . Wallet databases with observers . In CRYPTO \u201992 , pages 89\u2013 105 . [10] D\u00a0Chaum and T\u00a0Pedersen. Wallet databases with observers. In CRYPTO \u201992, pages 89\u2013105."},{"key":"e_1_3_2_1_11_1","volume-title":"IEEE","author":"Deng C","year":"2019","unstructured":"[ 11 ] C Deng , J Fan , Z Wang , Y Luo , Y Zheng , Y Li , and J Ding . A survey on range proof and its applications on blockchain. In CyberC \u201909, pages 1\u20138 . IEEE , 2019 . [11] C Deng, J Fan, Z Wang, Y Luo, Y Zheng, Y Li, and J Ding. A survey on range proof and its applications on blockchain. In CyberC \u201909, pages 1\u20138. IEEE, 2019."},{"key":"e_1_3_2_1_12_1","first-page":"320","volume-title":"USENIX SecuritySymposium","author":"Syverson P","year":"2004","unstructured":"[ 12 ] R\u00a0Dingledine, N\u00a0Mathewson, and P Syverson . Tor : The second-generation onion router . In USENIX SecuritySymposium , pages 303\u2013 320 , 2004 . [12] R\u00a0Dingledine, N\u00a0Mathewson, and P Syverson. Tor: The second-generation onion router. In USENIX SecuritySymposium, pages 303\u2013320, 2004."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s42452-019-0989-z"},{"key":"e_1_3_2_1_14_1","first-page":"387","volume-title":"CRYPTO \u201901","author":"Furukawa J","unstructured":"[ 14 ] J Furukawa and K Sako . An efficient scheme for proving a shuffle . In CRYPTO \u201901 , pages 368\u2013 387 . [14] J Furukawa and K Sako. An efficient scheme for proving a shuffle. In CRYPTO \u201901, pages 368\u2013387."},{"key":"e_1_3_2_1_15_1","first-page":"30","volume-title":"Fc\u201902","author":"Furukawa J","unstructured":"[ 15 ] J Furukawa , H Miyauchi , K Mori , S Obana , and K Sako . An implementation of a universally verifiable electronic voting scheme based on shuffling . In Fc\u201902 , pages 16\u2013 30 . [15] J Furukawa, H Miyauchi, K Mori, S Obana, and K Sako. An implementation of a universally verifiable electronic voting scheme based on shuffling. In Fc\u201902, pages 16\u201330."},{"key":"e_1_3_2_1_16_1","unstructured":"[ 16 ] GDPR Recital 26. In General Data Protection Regulation. Available as https:\/\/gdpr.eu\/recital-26-not-applicable-to-anonymous-data\/ [16] GDPR Recital 26. In General Data Protection Regulation. Available as https:\/\/gdpr.eu\/recital-26-not-applicable-to-anonymous-data\/"},{"first-page":"482","volume-title":"ACNS \u201905","key":"e_1_3_2_1_17_1","unstructured":"[ 17 ] J\u00a0Groth. Non-interactive zero-knowledge arguments for voting . In ACNS \u201905 , pages 467\u2013 482 . Springer-Verlag. [17] J\u00a0Groth. Non-interactive zero-knowledge arguments for voting. In ACNS \u201905, pages 467\u2013482. Springer-Verlag."},{"key":"e_1_3_2_1_18_1","first-page":"396","volume-title":"EUROCRYPT \u201908","author":"Y\u00a0Ishai J\u00a0Groth","unstructured":"[ 18 ] J\u00a0Groth and Y\u00a0Ishai . Sub-linear zero-knowledge argument for correctness of a shuffle . In EUROCRYPT \u201908 , pages 379\u2013 396 . [18] J\u00a0Groth and Y\u00a0Ishai. Sub-linear zero-knowledge argument for correctness of a shuffle. In EUROCRYPT \u201908, pages 379\u2013396."},{"key":"e_1_3_2_1_19_1","first-page":"392","volume-title":"PKC \u201907","author":"S\u00a0Lu J\u00a0Groth","unstructured":"[ 19 ] J\u00a0Groth and S\u00a0Lu . Verifiable shuffle of large size ciphertexts . In PKC \u201907 , pages 377\u2013 392 . [19] J\u00a0Groth and S\u00a0Lu. Verifiable shuffle of large size ciphertexts. In PKC \u201907, pages 377\u2013392."},{"key":"e_1_3_2_1_20_1","series-title":"Lecture Notes in Computer Science","first-page":"160","volume-title":"Public Key Cryptography","author":"Groth J","year":"2003","unstructured":"[ 20 ] J Groth . A verifiable secret shuffle of homomorphic encryptions . In Public Key Cryptography 2003 , volume 2567 of Lecture Notes in Computer Science , pages 145\u2013 160 , Berlin, 2003. Springer-Verlag . [20] J Groth. A verifiable secret shuffle of homomorphic encryptions. In Public Key Cryptography 2003, volume 2567 of Lecture Notes in Computer Science, pages 145\u2013160, Berlin, 2003. Springer-Verlag."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-010-9067-9"},{"key":"e_1_3_2_1_22_1","first-page":"50","volume-title":"USENIX Security Symposium \u201905","author":"C\u00a0Karlof N\u00a0Sastry","unstructured":"[ 22 ] N\u00a0Sastry C\u00a0Karlof and D\u00a0Wagner. Cryptographic voting protocols: A systems perspective . In USENIX Security Symposium \u201905 , pages 33\u2013 50 . [22] N\u00a0Sastry C\u00a0Karlof and D\u00a0Wagner. Cryptographic voting protocols: A systems perspective. In USENIX Security Symposium \u201905, pages 33\u201350."},{"key":"e_1_3_2_1_23_1","first-page":"363","volume-title":"ACM CCS \u201915","author":"Zacharias A Kiayias T","unstructured":"[ 23 ] A Kiayias T Zacharias and B Zhang . DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles . In ACM CCS \u201915 , pages 352\u2013 363 . [23] A Kiayias T Zacharias and B Zhang. DEMOS-2: Scalable E2E Verifiable Elections without Random Oracles. In ACM CCS \u201915, pages 352\u2013363."},{"first-page":"415","volume-title":"ASIACRYPT \u201903","key":"e_1_3_2_1_24_1","unstructured":"[ 24 ] H\u00a0Lipmaa. On diophantine complexity and statistical zero-knowledge arguments . In ASIACRYPT \u201903 , pages 398\u2013 415 . [24] H\u00a0Lipmaa. On diophantine complexity and statistical zero-knowledge arguments. In ASIACRYPT \u201903, pages 398\u2013415."},{"volume-title":"Pseudorandomness and cryptographic applications","year":"1996","key":"e_1_3_2_1_25_1","unstructured":"[ 25 ] M\u00a0Luby. Pseudorandomness and cryptographic applications . Princeton University Press , 1996 . [25] M\u00a0Luby. Pseudorandomness and cryptographic applications. Princeton University Press, 1996."},{"key":"e_1_3_2_1_26_1","first-page":"9","volume-title":"USENIX\/Accurate Electronic Voting Technology Workshop","author":"J\u00a0Gibson McGaley","year":"2006","unstructured":"[ 26 ] M\u00a0 McGaley and J\u00a0Gibson . A critical analysis of the council of europe recommendations on e-voting . In USENIX\/Accurate Electronic Voting Technology Workshop 2006 , page\u00a0 9 . [26] M\u00a0McGaley and J\u00a0Gibson. A critical analysis of the council of europe recommendations on e-voting. In USENIX\/Accurate Electronic Voting Technology Workshop 2006, page\u00a09."},{"key":"e_1_3_2_1_27_1","first-page":"125","volume-title":"ACM Conference on Computer and Communications Security 2001","author":"Neff C","year":"2001","unstructured":"[ 27 ] C Neff . A verifiable secret shuffle and its application to e-voting . In ACM Conference on Computer and Communications Security 2001 , pages 116\u2013 125 , 2001 . [27] C Neff. A verifiable secret shuffle and its application to e-voting. In ACM Conference on Computer and Communications Security 2001, pages 116\u2013125, 2001."},{"key":"e_1_3_2_1_28_1","volume-title":"Verifiable mixing (shuffling) of elgamal pairs","author":"Neff C","year":"2004","unstructured":"[ 28 ] C Neff . Verifiable mixing (shuffling) of elgamal pairs . 2004 . Available as http:\/\/theory.lcs.mit.edu\/\u00a0rivest\/voting\/papers\/Neff-2004-04-21-ElGamalShuffles.pdf. [28] C Neff. Verifiable mixing (shuffling) of elgamal pairs. 2004. Available as http:\/\/theory.lcs.mit.edu\/\u00a0rivest\/voting\/papers\/Neff-2004-04-21-ElGamalShuffles.pdf."},{"key":"e_1_3_2_1_29_1","volume-title":"Verifiable mixing (shuffling) of elgamal pairs. vhti technical document, votehere","author":"Neff C","year":"2003","unstructured":"[ 29 ] C Neff . Verifiable mixing (shuffling) of elgamal pairs. vhti technical document, votehere , 2003 . [29] C Neff. Verifiable mixing (shuffling) of elgamal pairs. vhti technical document, votehere, 2003."},{"key":"e_1_3_2_1_30_1","first-page":"6","article-title":"Verifiable, secret shuffles of encrypted data, such as elgamal encrypted data for secure multi-authority elections","author":"Neff C","year":"2005","unstructured":"[ 30 ] C Neff . Verifiable, secret shuffles of encrypted data, such as elgamal encrypted data for secure multi-authority elections , September\u00a027 2005 . US Patent 6 ,950,948. [30] C Neff. Verifiable, secret shuffles of encrypted data, such as elgamal encrypted data for secure multi-authority elections, September\u00a027 2005. US Patent 6,950,948.","journal-title":"September\u00a027"},{"key":"e_1_3_2_1_31_1","first-page":"7","article-title":"Verifiable secret shuffles and their application to electronic voting","author":"Neff C","year":"2008","unstructured":"[ 31 ] C Neff . Verifiable secret shuffles and their application to electronic voting , April\u00a015 2008 . US Patent 7 ,360,094. [31] C Neff. Verifiable secret shuffles and their application to electronic voting, April\u00a015 2008. US Patent 7,360,094.","journal-title":"April\u00a015"},{"key":"e_1_3_2_1_32_1","first-page":"75","volume-title":"ACNS","author":"Nguyen L","year":"2004","unstructured":"[ 32 ] L Nguyen , R Safavi-Naini , and K Kurosawa . Verifiable shuffles : A formal model and a paillier-based efficient construction with provable security . In ACNS 2004 , pages 61\u2013 75 . [32] L Nguyen, R Safavi-Naini, and K Kurosawa. Verifiable shuffles: A formal model and a paillier-based efficient construction with provable security. In ACNS 2004, pages 61\u201375."},{"issue":"6","key":"e_1_3_2_1_33_1","first-page":"986","article-title":"A provably secure and effcient verifiable shuffle based on a variant of the paillier cryptosystem","volume":"11","author":"Nguyen L","year":"2005","unstructured":"[ 33 ] L Nguyen , R Safavi-Naini , and K Kurosawa . A provably secure and effcient verifiable shuffle based on a variant of the paillier cryptosystem . In Journal of Universal Computer Science , 11 ( 6 ), 2005 , pages 986 \u2013 1010 . [33] L Nguyen, R Safavi-Naini, and K Kurosawa. A provably secure and effcient verifiable shuffle based on a variant of the paillier cryptosystem. In Journal of Universal Computer Science, 11(6), 2005, pages 986\u20131010.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_1_34_1","first-page":"454","volume-title":"PKC \u201904","author":"Peng K","unstructured":"[ 34 ] K Peng , C Boyd , E\u00a0Dawson, and K Viswanathan . A correct, private and efficient mix net . In PKC \u201904 , pages 439\u2013 454 . [34] K Peng, C Boyd, E\u00a0Dawson, and K Viswanathan. A correct, private and efficient mix net. In PKC \u201904, pages 439\u2013454."},{"key":"e_1_3_2_1_35_1","first-page":"204","volume-title":"CRYPTO \u201905","author":"Peng K","unstructured":"[ 35 ] K Peng , C Boyd and E\u00a0Dawson. Simple and efficient shuffling with provable correctness and ZK privacy . In CRYPTO \u201905 , pages 188\u2013 204 . [35] K Peng, C Boyd and E\u00a0Dawson. Simple and efficient shuffling with provable correctness and ZK privacy. In CRYPTO \u201905, pages 188\u2013204."},{"key":"e_1_3_2_1_36_1","volume-title":"International Journal of Information Security","volume":"10","author":"Peng K","year":"2011","unstructured":"[ 36 ] K Peng , E\u00a0Dawson and F Bao . Modification and optimisation of a shuffling scheme: stronger security, formal analysis and higher efficiency . In International Journal of Information Security , 2011 Volume 10 , Number 1, pages 33\u201347. [36] K Peng, E\u00a0Dawson and F Bao. Modification and optimisation of a shuffling scheme: stronger security, formal analysis and higher efficiency. In International Journal of Information Security, 2011 Volume 10, Number 1, pages 33\u201347."},{"key":"e_1_3_2_1_37_1","volume-title":"International Journal of Security and Networks","volume":"7","author":"Peng K","year":"2012","unstructured":"[ 37 ] K Peng . How To Communicate Anonymously In A Network \u2014 Study And Optimisation Of Efficiency And Security Of Anonymous Communication Networks . In International Journal of Security and Networks , 2012 Volume 7 , Number 3, pages 133\u2013147. [37] K Peng. How To Communicate Anonymously In A Network \u2014 Study And Optimisation Of Efficiency And Security Of Anonymous Communication Networks. In International Journal of Security and Networks, 2012 Volume 7, Number 3, pages 133\u2013147."},{"key":"e_1_3_2_1_38_1","first-page":"96","volume-title":"IDCS \u201912","author":"Peng K","unstructured":"[ 38 ] K Peng . Y Zhang . A Secure Mix Network with an Efficient Validity Verification Mechanism . In IDCS \u201912 , pages 85\u2013 96 . [38] K Peng. Y Zhang. A Secure Mix Network with an Efficient Validity Verification Mechanism. In IDCS \u201912, pages 85\u201396."},{"key":"e_1_3_2_1_39_1","first-page":"174","volume-title":"ICDKE \u201912","author":"Peng K","unstructured":"[ 39 ] K Peng . A Secure and Efficient Mix Network Especially Suitable for E-Voting . In ICDKE \u201912 , pages 161\u2013 174 . [39] K Peng. A Secure and Efficient Mix Network Especially Suitable for E-Voting. In ICDKE \u201912, pages 161\u2013174."},{"key":"e_1_3_2_1_40_1","first-page":"498","volume-title":"Theory and Practice of Cryptography Solutions for Secure Information Systems","author":"Peng K","unstructured":"[ 40 ] K Peng . Theory and practice of secure e-voting systems . In Theory and Practice of Cryptography Solutions for Secure Information Systems , pages 428\u2013 498 . 2013. [40] K Peng. Theory and practice of secure e-voting systems. In Theory and Practice of Cryptography Solutions for Secure Information Systems, pages 428\u2013498. 2013."},{"key":"e_1_3_2_1_41_1","first-page":"593","article-title":"Electronic voting systems","author":"Salomonsen G","year":"2008","unstructured":"[ 41 ] G Salomonsen and J Groth . Electronic voting systems , January\u00a03 2008 . US Patent App. 10\/ 593 ,754. [41] G Salomonsen and J Groth. Electronic voting systems, January\u00a03 2008. US Patent App. 10\/593,754.","journal-title":"January\u00a03"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF00196725"},{"key":"e_1_3_2_1_43_1","unstructured":"[ 43 ] https:\/\/verificatum.org\/. Available from https:\/\/github.com\/verificatum. [43] https:\/\/verificatum.org\/. Available from https:\/\/github.com\/verificatum."},{"key":"e_1_3_2_1_44_1","unstructured":"[ 44 ] https:\/\/votem.com. Available from https:\/\/github.com\/votem\/proof-of-vote. [44] https:\/\/votem.com. Available from https:\/\/github.com\/votem\/proof-of-vote."},{"first-page":"292","volume-title":"ASIACRYPT \u201905","key":"e_1_3_2_1_45_1","unstructured":"[ 45 ] D\u00a0Wikstrom. A sender verifiable mix-net and a new proof of a shuffle . In ASIACRYPT \u201905 , pages 273\u2013 292 . [45] D\u00a0Wikstrom. A sender verifiable mix-net and a new proof of a shuffle. In ASIACRYPT \u201905, pages 273\u2013292."},{"volume-title":"A sender verifiable mix-net and a new proof of a shuffle","year":"2005","key":"e_1_3_2_1_46_1","unstructured":"[ 46 ] D\u00a0Wikstrom. A sender verifiable mix-net and a new proof of a shuffle . 2005 . Available as http:\/\/eprint.iacr.org\/2005\/137. [46] D\u00a0Wikstrom. A sender verifiable mix-net and a new proof of a shuffle. 2005. Available as http:\/\/eprint.iacr.org\/2005\/137."}],"event":{"name":"ASIA CCS '23: ACM ASIA Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Melbourne VIC Australia","acronym":"ASIA CCS '23"},"container-title":["Proceedings of the ACM Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595785","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:08:17Z","timestamp":1750183697000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3579856.3595785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,10]]},"references-count":46,"alternative-id":["10.1145\/3579856.3595785","10.1145\/3579856"],"URL":"https:\/\/doi.org\/10.1145\/3579856.3595785","relation":{},"subject":[],"published":{"date-parts":[[2023,7,10]]},"assertion":[{"value":"2023-07-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}