{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T19:12:03Z","timestamp":1769541123551,"version":"3.49.0"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation"},{"name":"Korean Government [Ministry of Science and ICT (MSIT)]","award":["RS-2021-II210727 (90%)"],"award-info":[{"award-number":["RS-2021-II210727 (90%)"]}]},{"name":"Culture, Sports and Tourism Research and Development Program through Korea Creative Content Agency"},{"DOI":"10.13039\/501100003561","name":"Ministry of Culture, Sports and Tourism","doi-asserted-by":"publisher","award":["RS-2024-00332210 (10%)"],"award-info":[{"award-number":["RS-2024-00332210 (10%)"]}],"id":[{"id":"10.13039\/501100003561","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2026]]},"DOI":"10.1109\/access.2026.3654539","type":"journal-article","created":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T20:40:58Z","timestamp":1768423258000},"page":"10217-10244","source":"Crossref","is-referenced-by-count":0,"title":["Cougar: Cubic Root Verifier Inner Product Argument Under Discrete Logarithm Assumption"],"prefix":"10.1109","volume":"14","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0435-4394","authenticated-orcid":false,"given":"Hyeonbum","family":"Lee","sequence":"first","affiliation":[{"name":"BK21 FOUR Intelligence Computing Program, Seoul National University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1105-1607","authenticated-orcid":false,"given":"Seunghun","family":"Paik","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9134-979X","authenticated-orcid":false,"given":"Hyunjung","family":"Son","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hanyang University, Seoul, Republic of Korea"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0547-5702","authenticated-orcid":false,"given":"Jae Hong","family":"Seo","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Hanyang University, Seoul, Republic of Korea"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/s00145-014-9196-7"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1007\/978-3-031-31371-4_19","article-title":"Dew: Transparent constant-sized zkSNARKs","volume-title":"Public-Key Cryptography\u2014PKC 2023","author":"Arun","year":"2023"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-96881-0_23"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45374-9_17"},{"key":"ref5","article-title":"Scalable, transparent, and post-quantum secure computational integrity","volume-title":"IACR Cryptol. ePrint Arch.","author":"Ben-Sasson","year":"2018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-26954-8_23"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-17653-2_4"},{"key":"ref9","first-page":"781","article-title":"Succinct non-interactive zero knowledge for a von Neumann architecture","volume-title":"Proc. USENIX Secur.","author":"Ben-Sasson"},{"key":"ref10","first-page":"81","article-title":"Efficient polynomial commitment schemes for multiple points and polynomials","volume":"2020","author":"Boneh","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_12"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-03326-2_20"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64378-2_2"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56880-1_16"},{"key":"ref15","article-title":"Recursive proof composition without a trusted setup","volume-title":"IACR Cryptol. ePrint Arch.","author":"Bowe","year":"2019"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-84242-0_24"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48621-0_14"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_24"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-92078-4_3"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/35.1.21"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-30617-4_17"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45721-1_27"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2022.3167806"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-45374-9_18"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-58740-5_9"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/BF02351717"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref29","volume-title":"BLSTRS","year":"2024"},{"key":"ref30","article-title":"PLONK: Permutations over Lagrange-bases for oecumenical noninteractive arguments of knowledge","volume-title":"IACR Cryptol. ePrint Arch.","author":"Gabizon","year":"2019"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2022.3179913"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1137\/0218012"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38545-2_7"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_12"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25385-0_23"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_13"},{"key":"ref38","article-title":"Lelantus: A new design for anonymous and confidential cryptocurrencies","volume-title":"IACR Cryptol. ePrint Arch.","author":"Jivanyan","year":"2019"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_11"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2023.3300525"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-22966-4_14"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-38551-3_21"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_13"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-41326-1_12"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-90453-1_1"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-68403-6_8"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/0209022"},{"key":"ref49","volume-title":"Halo2curves","year":"2024"},{"key":"ref50","volume-title":"Halo2_Proofs","year":"2024"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49890-3_16"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-34805-0_22"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-19379-8_24"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-56877-1_25"},{"key":"ref56","first-page":"339","article-title":"Proving the correct execution of concurrent services in zero-knowledge","volume-title":"OSDI 2018","author":"Setty","year":"2018"},{"key":"ref57","first-page":"1275","article-title":"Quarks: Quadruple-efficient transparent zkSNARKs","volume":"2020","author":"Setty","year":"2020","journal-title":"Cryptol. ePrint Arch."},{"key":"ref58","article-title":"Customizable constraint systems for succinct arguments","author":"Setty","year":"2023","journal-title":"IACR Cryptol. ePrint Arch."},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-66399-9_25"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-15985-5_11"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51280-4_25"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1145\/3548606.3560646"},{"key":"ref64","volume-title":"The Halo2 Book","year":"2022"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/SP40000.2020.00052"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/11323511\/11353436.pdf?arnumber=11353436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,27]],"date-time":"2026-01-27T06:00:09Z","timestamp":1769493609000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11353436\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/access.2026.3654539","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]}}}