{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,19]],"date-time":"2026-01-19T09:09:49Z","timestamp":1768813789662,"version":"3.49.0"},"reference-count":52,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T00:00:00Z","timestamp":1741478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T00:00:00Z","timestamp":1741478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100005801","name":"Facebook","doi-asserted-by":"publisher","award":["Supported by Facebook as a winner of the Role of Applied Cryptography in a Privacy-Focused Advertising Ecosystem Facebook RFP"],"award-info":[{"award-number":["Supported by Facebook as a winner of the Role of Applied Cryptography in a Privacy-Focused Advertising Ecosystem Facebook RFP"]}],"id":[{"id":"10.13039\/100005801","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000083","name":"Directorate for Computer and Information Science and Engineering","doi-asserted-by":"publisher","award":["CNS 2337321"],"award-info":[{"award-number":["CNS 2337321"]}],"id":[{"id":"10.13039\/100000083","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"abstract":"<jats:title>Abstract<\/jats:title>\n          <jats:p>In many real-world applications, an untrusted aggregator (server) is required to collect privacy-sensitive data from the users (clients) to compute aggregate statistics on that data periodically. In Private Stream Aggregation (PSA), multiple data producers encrypt their data for a central party, which can then retrieve only the aggregate sum of the encrypted values, without access to any individual values. PSA enables untrusted aggregators to execute aggregation operations over privacy-critical data from multiple data sources. Traditionally, existing PSA schemes require the aggregator to interact with a trusted third party to achieve fault tolerance. However, this kind of <jats:italic>interactive recovery<\/jats:italic> poses many security and practical vulnerabilities to achieve fault tolerance in real-world applications. This paper introduces a new formal PSA framework that ensures rigorous privacy guarantees for individual user inputs and achieves fault tolerance with <jats:italic>non-interactive recovery<\/jats:italic>. Existing definitions for fault tolerance do not account for the impact of faults on security and cannot defend against residual function attacks. We define a new level of security for a non-interactive fault tolerance model with malicious adversaries that guarantees defense for such attacks during fault recovery. We present the first PSA protocol that provably achieves this new level of security. Our techniques are versatile and can be used to enhance any existing PSA scheme to safely recover from faults in a non-interactive manner. We employ our proposed framework and use trusted hardware, cryptographic hashing, and p-ary trees to develop a protocol that achieves significant improvements in scalability and communication efficiency. Our proposed protocol is about 3<jats:inline-formula>\n              <jats:alternatives>\n                <jats:tex-math>$$\\times$$<\/jats:tex-math>\n                <mml:math xmlns:mml=\"http:\/\/www.w3.org\/1998\/Math\/MathML\">\n                  <mml:mo>\u00d7<\/mml:mo>\n                <\/mml:math>\n              <\/jats:alternatives>\n            <\/jats:inline-formula> faster than existing PSA protocols for cases when faults do not occur. During cases when faults occur, our protocol provides faster execution by about 1\u20132 orders of magnitude compared to existing works.<\/jats:p>","DOI":"10.1007\/s42979-025-03804-w","type":"journal-article","created":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T16:32:51Z","timestamp":1741537971000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Cryptonite: A Framework for Flexible Time-Series Secure Aggregation with Non-interactive Fault Recovery"],"prefix":"10.1007","volume":"6","author":[{"given":"Ryan","family":"Karl","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nirajan","family":"Koirala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tasha","family":"Januszewicz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jonathan","family":"Takeshita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5873-0629","authenticated-orcid":false,"given":"Taeho","family":"Jung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,3,9]]},"reference":[{"key":"3804_CR1","volume-title":"Summary of the hipaa privacy rule","author":"HC Assistance","year":"2003","unstructured":"Assistance HC. Summary of the hipaa privacy rule. Washington: Office for Civil Rights; 2003."},{"key":"3804_CR2","series-title":"Legal studies research paper","volume-title":"An introduction to the California consumer privacy act (CCPA)","author":"E Goldman","year":"2020","unstructured":"Goldman E. An introduction to the California consumer privacy act (CCPA). Legal studies research paper. Santa Clara: Santa Clara University; 2020."},{"key":"3804_CR3","doi-asserted-by":"crossref","unstructured":"Parikh N, Sundaresan N. Scalable and near real-time burst detection from ecommerce queries. In: Proceedings of the 14th ACM SIGKDD international conference on knowledge discovery and data mining; 2008. p. 972\u201380.","DOI":"10.1145\/1401890.1402006"},{"key":"3804_CR4","volume-title":"Mining the social web","author":"MA Russell","year":"2019","unstructured":"Russell MA, Klassen M. Mining the social web. 3rd ed. Sebastopol: O\u2019Reilly Media, Inc.; 2019.","edition":"3"},{"key":"3804_CR5","unstructured":"Shi E, Chan TH, Rieffel E, Chow R, Song D. Privacy-preserving aggregation of time-series data. In: Proc. NDSS. vol. 2. Citeseer; 2011. p. 1\u201317."},{"key":"3804_CR6","doi-asserted-by":"crossref","unstructured":"Valovich F, Ald\u00e0 F. Computational differential privacy from lattice-based cryptography. In: NutMiC. Springer; 2017. p. 121\u201341.","DOI":"10.1007\/978-3-319-76620-1_8"},{"key":"3804_CR7","unstructured":"Karthikeyan H, Polychroniadou A. OPA: one-shot private aggregation with single client interaction and its applications to federated learning. In: International workshop on federated foundation models in conjunction with NeurIPS 2024; 2024."},{"key":"3804_CR8","doi-asserted-by":"crossref","unstructured":"Halevi S, Ishai Y, Jain A, Komargodski I, Sahai A, Yogev E. Non-interactive multiparty computation without correlated randomness. In: ASIACRYPT. Springer; 2017. p. 181\u2013211.","DOI":"10.1007\/978-3-319-70700-6_7"},{"key":"3804_CR9","doi-asserted-by":"crossref","unstructured":"Beimel A, Gabizon A, Ishai Y, Kushilevitz E, Meldgaard S, Paskin-Cherniavsky A. Non-interactive secure multiparty computation. In: CRYPTO. Springer; 2014. p. 387\u2013404.","DOI":"10.1007\/978-3-662-44381-1_22"},{"key":"3804_CR10","doi-asserted-by":"crossref","unstructured":"Halevi S, Ishai Y, Kushilevitz E, Rabin T. Best possible information-theoretic MPC. In: Theory of cryptography conference. Springer; 2018. p. 255\u201381.","DOI":"10.1007\/978-3-030-03810-6_10"},{"key":"3804_CR11","doi-asserted-by":"crossref","unstructured":"Karl R, Burchfield T, Takeshita J, Jung T. Non-interactive MPC with trusted hardware secure against residual function attacks. In: SecureComm. Springer; 2019. p. 425\u201339.","DOI":"10.1007\/978-3-030-37231-6_25"},{"issue":"6","key":"3804_CR12","doi-asserted-by":"publisher","first-page":"1122","DOI":"10.1007\/s12083-014-0255-5","volume":"8","author":"L Chen","year":"2015","unstructured":"Chen L, Lu R, Cao Z. PDAFT: a privacy-preserving data aggregation scheme with fault tolerance for smart grid communications. Peer-to-Peer Netw Appl. 2015;8(6):1122\u201332.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"9","key":"3804_CR13","doi-asserted-by":"publisher","first-page":"1940","DOI":"10.1109\/TIFS.2015.2472369","volume":"11","author":"S Han","year":"2015","unstructured":"Han S, Zhao S, Li Q, Ju C-H, Zhou W. PPM-HDA: privacy-preserving and multifunctional health data aggregation with fault tolerance. IEEE Trans Inf Forens Secur. 2015;11(9):1940\u201355.","journal-title":"IEEE Trans Inf Forens Secur"},{"key":"3804_CR14","doi-asserted-by":"crossref","unstructured":"Chan T-HH, Shi E, Song D. Privacy-preserving stream aggregation with fault tolerance. In: FC. Springer; 2012. p. 200\u201314.","DOI":"10.1007\/978-3-642-32946-3_15"},{"key":"3804_CR15","doi-asserted-by":"crossref","unstructured":"Li Q, Cao G. Efficient privacy-preserving stream aggregation in mobile sensing with low aggregation error. In: PETS. Springer; 2013. p. 60\u201381.","DOI":"10.1007\/978-3-642-39077-7_4"},{"key":"3804_CR16","doi-asserted-by":"crossref","unstructured":"Shi J, Zhang R, Liu Y, Zhang Y. Prisense: privacy-preserving data aggregation in people-centric urban sensing systems. In: INFOCOM. IEEE; 2010. p. 1\u20139.","DOI":"10.1109\/INFCOM.2010.5462147"},{"key":"3804_CR17","unstructured":"Martin D. Intel xeon ice lake CPUs to get SGX with expanded security features; 2020."},{"key":"3804_CR18","doi-asserted-by":"crossref","unstructured":"Karl R, Takeshita J, Jung T. Cryptonite: a framework for flexible time-series secure aggregation with non-interactive fault recovery. In: International conference on security and privacy in communication systems. Springer; 2021.","DOI":"10.1007\/978-3-030-90019-9_16"},{"key":"3804_CR19","doi-asserted-by":"crossref","unstructured":"Rabin T. A simplified approach to threshold and proactive RSA. In: Annual international cryptology conference. Springer; 1998. p. 89\u2013104.","DOI":"10.1007\/BFb0055722"},{"issue":"3","key":"3804_CR20","first-page":"248","volume":"2","author":"H Bao","year":"2015","unstructured":"Bao H, Lu R. A new differentially private data aggregation with fault tolerance for smart grid communications. IEEE IoT-J. 2015;2(3):248\u201358.","journal-title":"IEEE IoT-J"},{"key":"3804_CR21","doi-asserted-by":"crossref","unstructured":"Bao H, Lu R. Ddpft: secure data aggregation scheme with differential privacy and fault tolerance. In: IEEE ICC 2015. IEEE; 2015. p. 7240\u20135.","DOI":"10.1109\/ICC.2015.7249482"},{"issue":"1","key":"3804_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1007\/s12083-015-0410-7","volume":"10","author":"H Bao","year":"2017","unstructured":"Bao H, Lu R. A lightweight data aggregation scheme achieving privacy preservation and data integrity with differential privacy and fault tolerance. Peer-to-Peer Netw Appl. 2017;10(1):106\u201321.","journal-title":"Peer-to-Peer Netw Appl"},{"issue":"1","key":"3804_CR23","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s11276-015-1120-z","volume":"23","author":"J Chen","year":"2017","unstructured":"Chen J, Ma H, Zhao D. Private data aggregation with integrity assurance and fault tolerance for mobile crowd-sensing. Wirel Netw. 2017;23(1):131\u201344.","journal-title":"Wirel Netw"},{"key":"3804_CR24","doi-asserted-by":"crossref","unstructured":"Won J, Ma CY, Yau DK, Rao NS. Proactive fault-tolerant aggregation protocol for private smart metering. In: INFOCOM. IEEE; 2014. p. 2804\u201312.","DOI":"10.1109\/INFOCOM.2014.6848230"},{"issue":"5","key":"3804_CR25","doi-asserted-by":"publisher","first-page":"2483","DOI":"10.1109\/TSG.2017.2673843","volume":"8","author":"J Ni","year":"2017","unstructured":"Ni J, Zhang K, Alharbi K, Lin X, Zhang N, Shen XS. Differentially private smart metering with fault tolerance and range-based filtering. IEEE Trans Smart Grid. 2017;8(5):2483\u201393.","journal-title":"IEEE Trans Smart Grid"},{"key":"3804_CR26","doi-asserted-by":"crossref","unstructured":"Chotard J, Sans ED, Gay R, Phan DH, Pointcheval D. Decentralized multi-client functional encryption for inner product. In: Asiacrypt. Springer; 2018. p. 703\u201332.","DOI":"10.1007\/978-3-030-03329-3_24"},{"issue":"2","key":"3804_CR27","doi-asserted-by":"publisher","first-page":"2486","DOI":"10.1109\/JIOT.2018.2870873","volume":"6","author":"K Xue","year":"2018","unstructured":"Xue K, Yang Q, Li S, Wei DS, Peng M, Memon I, Hong P. PPSO: a privacy-preserving service outsourcing scheme for real-time pricing demand response in smart grid. IEEE Internet Things J. 2018;6(2):2486\u201396.","journal-title":"IEEE Internet Things J"},{"key":"3804_CR28","doi-asserted-by":"publisher","first-page":"4065","DOI":"10.1109\/TII.2020.3014401","volume":"17","author":"X Wang","year":"2020","unstructured":"Wang X, Liu Y, Choo K. Fault tolerant, multi-subset aggregation scheme for smart grid. IEEE Trans Ind Inform. 2020;17:4065\u201372.","journal-title":"IEEE Trans Ind Inform"},{"key":"3804_CR29","doi-asserted-by":"crossref","unstructured":"Mansouri M, \u00d6nen M, Ben Jaballah W. Learning from failures: secure and fault-tolerant aggregation for federated learning. In: Proceedings of the 38th annual computer security applications conference; 2022. p. 146\u201358.","DOI":"10.1145\/3564625.3568135"},{"key":"3804_CR30","doi-asserted-by":"crossref","unstructured":"Ma Y, Woods J, Angel S, Polychroniadou A, Rabin T. Flamingo: multi-round single-server secure aggregation with applications to private federated learning. In: 2023 IEEE symposium on security and privacy (SP). IEEE; 2023. p. 477\u201396.","DOI":"10.1109\/SP46215.2023.10179434"},{"key":"3804_CR31","unstructured":"Nguyen TS, Lepoint T, Trieu N. Mario: multi-round multiple-aggregator secure aggregation with robustness against malicious actors. Cryptology ePrint Archive; 2024."},{"key":"3804_CR32","unstructured":"McMahan B, Moore E, Ramage D, Hampson S, Arcas BA. Communication-efficient learning of deep networks from decentralized data. In: Artificial intelligence and statistics. PMLR; 2017. p. 1273\u201382."},{"key":"3804_CR33","unstructured":"Kadhe S, Rajaraman N, Koyluoglu OO, Ramchandran K. Fastsecagg: scalable secure aggregation for privacy-preserving federated learning. Preprint; 2020. arXiv:2009.11248"},{"key":"3804_CR34","doi-asserted-by":"publisher","first-page":"612","DOI":"10.1145\/359168.359176","volume":"22","author":"S Adi","year":"1979","unstructured":"Adi S. How to share a secret. Commun ACM. 1979;22:612\u20133.","journal-title":"Commun ACM"},{"key":"3804_CR35","unstructured":"Stevens T, Skalka C, Vincent C, Ring J, Clark S, Near J. Efficient differentially private secure aggregation for federated learning via hardness of learning with errors. In: 31st USENIX security symposium (USENIX Security 22); 2022. p. 1379\u201395."},{"key":"3804_CR36","unstructured":"Kairouz P, Liu Z, Steinke T. The distributed discrete gaussian mechanism for federated learning with secure aggregation. In: International conference on machine learning. PMLR; 2021. p. 5201\u201312."},{"key":"3804_CR37","doi-asserted-by":"crossref","unstructured":"Zhang Y, Wang Z, Cao J, Hou R, Meng D. ShuffleFL: gradient-preserving federated learning using trusted execution environment. In: Proceedings of the 18th ACM international conference on computing frontiers. 2021. p. 161\u20138.","DOI":"10.1145\/3457388.3458665"},{"key":"3804_CR38","doi-asserted-by":"crossref","unstructured":"Mo F, Haddadi H, Katevas K, Marin E, Perino D, Kourtellis N. PPFL: privacy-preserving federated learning with trusted execution environments. In: Proceedings of the 19th annual international conference on mobile systems, applications, and services; 2021. p. 94\u2013108.","DOI":"10.1145\/3458864.3466628"},{"issue":"5","key":"3804_CR39","doi-asserted-by":"publisher","first-page":"3329","DOI":"10.1109\/TDSC.2021.3093711","volume":"19","author":"L Zhao","year":"2021","unstructured":"Zhao L, Jiang J, Feng B, Wang Q, Shen C, Li Q. Sear: secure and efficient aggregation for byzantine-robust federated learning. IEEE Trans Dependable Secure Comput. 2021;19(5):3329\u201342.","journal-title":"IEEE Trans Dependable Secure Comput"},{"key":"3804_CR40","unstructured":"Nguyen J, Malik K, Zhan H, Yousefpour A, Rabbat M, Malek M, Huba D. Federated learning with buffered asynchronous aggregation. In: International conference on artificial intelligence and statistics. PMLR; 2022. p. 3581\u2013607."},{"key":"3804_CR41","doi-asserted-by":"crossref","unstructured":"Brorsson J, Gunnarsson M. Dipsauce: efficient private stream aggregation without trusted parties. In: Nordic conference on secure IT systems. Springer; 2023. p. 204\u201322.","DOI":"10.1007\/978-3-031-47748-5_12"},{"key":"3804_CR42","doi-asserted-by":"crossref","unstructured":"Becker D, Guajardo J, Zimmermann K-H. Revisiting private stream aggregation: lattice-based PSA. In: NDSS; 2018.","DOI":"10.14722\/ndss.2018.23120"},{"issue":"3","key":"3804_CR43","first-page":"39","volume":"12","author":"D Gillin","year":"2000","unstructured":"Gillin D. The federal trade commission and internet privacy. Mark Res. 2000;12(3):39.","journal-title":"Mark Res"},{"key":"3804_CR44","doi-asserted-by":"crossref","unstructured":"Ottenhues J, Koch A. LaPSuS\u2014a lattice-based private stream aggregation scheme under scrutiny. In: International conference on security and cryptography for networks. Springer; 2024. p. 228\u2013248.","DOI":"10.1007\/978-3-031-71073-5_11"},{"key":"3804_CR45","doi-asserted-by":"crossref","unstructured":"Joye M, Libert B. A scalable scheme for privacy-preserving aggregation of time-series data. In: FC. Springer; 2013. p. 111\u201325.","DOI":"10.1007\/978-3-642-39884-1_10"},{"key":"3804_CR46","doi-asserted-by":"crossref","unstructured":"Mofrad S, Zhang F, Lu S, Shi W. A comparison study of intel SGX and AMD memory encryption technology. In: ACM HASP; 2018. p. 1\u20138.","DOI":"10.1145\/3214292.3214301"},{"key":"3804_CR47","doi-asserted-by":"crossref","unstructured":"Valovich F. Aggregation of time-series data under differential privacy. In: LATINCRYPT; Springer. 2017. p. 249\u201370.","DOI":"10.1007\/978-3-030-25283-0_14"},{"key":"3804_CR48","doi-asserted-by":"crossref","unstructured":"Boneh D, Goh E-J, Nissim K. Evaluating 2-DNF formulas on ciphertexts. In: Theory of cryptography conference. Springer; 2005. p. 325\u201341.","DOI":"10.1007\/978-3-540-30576-7_18"},{"key":"3804_CR49","doi-asserted-by":"crossref","unstructured":"Weichbrodt N, Kurmus A, Pietzuch P, Kapitza R. AsyncShock: exploiting synchronisation bugs in SGX enclaves. In: ESORICS. Springer; 2016. p. 440\u201357.","DOI":"10.1007\/978-3-319-45744-4_22"},{"issue":"11","key":"3804_CR50","doi-asserted-by":"publisher","first-page":"770","DOI":"10.1145\/358790.358797","volume":"24","author":"L Lamport","year":"1981","unstructured":"Lamport L. Password authentication with insecure communication. Commun ACM. 1981;24(11):770\u20132.","journal-title":"Commun ACM"},{"key":"3804_CR51","doi-asserted-by":"publisher","DOI":"10.1016\/j.petrol.2019.106223","volume":"181","author":"REV Vargas","year":"2019","unstructured":"Vargas REV, Munaro CJ, Ciarelli PM, Medeiros AG, Amaral BG, Barrionuevo DC, Ara\u00fajo JCD, Ribeiro JL, Magalh\u00e3es LP. A realistic and public dataset with rare undesirable real events in oil wells. J Petrol Sci Eng. 2019;181: 106223.","journal-title":"J Petrol Sci Eng"},{"issue":"4","key":"3804_CR52","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1002\/j.1538-7305.1949.tb00928.x","volume":"28","author":"CE Shannon","year":"1949","unstructured":"Shannon CE. Communication theory of secrecy systems. Bell Syst Tech J. 1949;28(4):656\u2013715.","journal-title":"Bell Syst Tech J"}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03804-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-025-03804-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-025-03804-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T16:33:02Z","timestamp":1741537982000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-025-03804-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,9]]},"references-count":52,"journal-issue":{"issue":"3","published-online":{"date-parts":[[2025,3]]}},"alternative-id":["3804"],"URL":"https:\/\/doi.org\/10.1007\/s42979-025-03804-w","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3,9]]},"assertion":[{"value":"5 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2025","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 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":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Approval"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Research Involving Human and\/or Animals"}},{"value":"Not applicable.","order":5,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"261"}}