{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T20:18:43Z","timestamp":1740169123908,"version":"3.37.3"},"reference-count":29,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/501100010418","name":"Institute for Information and communications Technology Promotion","doi-asserted-by":"publisher","award":["2018-0-00251"],"award-info":[{"award-number":["2018-0-00251"]}],"id":[{"id":"10.13039\/501100010418","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Research","award":["TL-9014101684-01"],"award-info":[{"award-number":["TL-9014101684-01"]}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["NRF-2018R1C1B6008476"],"award-info":[{"award-number":["NRF-2018R1C1B6008476"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2019]]},"DOI":"10.1109\/access.2019.2936210","type":"journal-article","created":{"date-parts":[[2019,8,22]],"date-time":"2019-08-22T12:37:58Z","timestamp":1566477478000},"page":"117505-117516","source":"Crossref","is-referenced-by-count":1,"title":["Experimenting With Non-Interactive Range Proofs Based on the Strong RSA Assumption"],"prefix":"10.1109","volume":"7","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0461-3053","authenticated-orcid":false,"given":"Myungsun","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0920-2026","authenticated-orcid":false,"given":"Hyung Tae","family":"Lee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1007\/978-3-540-40061-5_26"},{"doi-asserted-by":"publisher","key":"ref11","DOI":"10.1007\/978-3-540-24676-3_34"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/978-3-540-75670-5_8"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1007\/978-3-540-89255-7_15"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/978-3-642-25385-0_23"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/978-3-642-38553-7_19"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1007\/978-3-319-56614-6_11"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/BFb0052225"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/BFb0054154"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1002\/cpa.3160390713"},{"year":"2016","journal-title":"Recommendation for key management","key":"ref28"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/SP.2016.55"},{"year":"2019","journal-title":"GMP The GNU Multiple Precision Arithmetic Library Version 6 1 2","key":"ref27"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1145\/28395.28420"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/11496137_32"},{"key":"ref29","first-page":"87","article-title":"Secure Vickrey auctions without threshold trust","author":"lipmaa","year":"2002","journal-title":"Proc Financial Cryptography"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.1007\/3-540-44987-6_7"},{"key":"ref8","first-page":"156","article-title":"Gradual and verifiable release of a secret","author":"brickell","year":"2000","journal-title":"Proc Conf Theory Appl Cryptograph Techn"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1007\/11426639_18"},{"doi-asserted-by":"publisher","key":"ref2","DOI":"10.1145\/100216.100273"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1007\/3-540-45539-6_31"},{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/3-540-46416-6_22"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1007\/3-540-69053-0_33"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1007\/3-540-36178-2_8"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1145\/357830.357847"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1017\/CBO9780511546891"},{"key":"ref23","first-page":"186","article-title":"How to prove yourself: Practical solutions to identification and signature problems","author":"fiat","year":"1986","journal-title":"Proc Conf Theory Appl Cryptograph Techn"},{"year":"2019","author":"shoup","journal-title":"NTL A Library for Doing Number Theory Version 11 3 2","key":"ref26"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1007\/BFb0054115"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/8600701\/08805328.pdf?arnumber=8805328","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T11:32:01Z","timestamp":1641987121000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8805328\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/access.2019.2936210","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2019]]}}}