{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T16:46:55Z","timestamp":1780418815310,"version":"3.54.1"},"reference-count":32,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT Korea","award":["2017-0-00661"],"award-info":[{"award-number":["2017-0-00661"]}]},{"name":"Institute of Information and Communications Technology Planning and Evaluation (IITP) Grant funded by the Ministry of Science and ICT Korea","award":["2016-6-00599"],"award-info":[{"award-number":["2016-6-00599"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2020]]},"DOI":"10.1109\/access.2020.3019980","type":"journal-article","created":{"date-parts":[[2020,8,28]],"date-time":"2020-08-28T20:04:58Z","timestamp":1598645098000},"page":"156569-156581","source":"Crossref","is-referenced-by-count":17,"title":["Simulation-Extractable zk-SNARK With a Single Verification"],"prefix":"10.1109","volume":"8","author":[{"given":"Jihye","family":"Kim","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3387-3372","authenticated-orcid":false,"given":"Jiwon","family":"Lee","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9044-7441","authenticated-orcid":false,"given":"Hyunok","family":"Oh","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref32","first-page":"99","article-title":"Generating hard instances of lattice problems","author":"ajtai","year":"1996","journal-title":"Proc 28th Annu ACM Symp Theory Comput"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_19"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/140975048"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2090236.2090245"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/3133956.3133984"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00060"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00020"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00013"},{"key":"ref15","first-page":"781","article-title":"Succinct non-interactive zero knowledge for a von neumann architecture","author":"ben-sasson","year":"2014","journal-title":"Proc Usenix Secur Symp"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-47721-7_12"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-38348-9_37"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.23"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.22"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/11818175_5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2517872.2517878"},{"key":"ref27","article-title":"Accountable privacy for decentralized anonymous payments","author":"garman","year":"2016","journal-title":"Proc Int Conf Financial Cryptograph Data Secur"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2014.36"},{"key":"ref6","author":"bowe","year":"2018","journal-title":"Making Groth’s Zk-Snark Simulation Extractable in the Random Oracle Model"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-36594-2_18"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-63715-0_20"},{"key":"ref8","first-page":"612","article-title":"Simulation-extractable snarks revisited","author":"lipmaa","year":"2019","journal-title":"Proc IAC"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03356-8_18"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.47"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1374376.1374396"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_11"},{"key":"ref20","first-page":"765","article-title":"Trueset: Faster verifiable set computations","author":"kosba","year":"2014","journal-title":"Proc Usenix Secur Symp"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2015.24"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2976749.2978368"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2018.00018"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-016-0221-0"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2016.55"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40084-1_6"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8948470\/09179754.pdf?arnumber=9179754","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,17]],"date-time":"2021-12-17T19:55:31Z","timestamp":1639770931000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9179754\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"references-count":32,"URL":"https:\/\/doi.org\/10.1109\/access.2020.3019980","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]}}}