{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T16:25:40Z","timestamp":1709828740764},"reference-count":27,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"4","license":[{"start":{"date-parts":[[2011,4,1]],"date-time":"2011-04-01T00:00:00Z","timestamp":1301616000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2011,4]]},"DOI":"10.1109\/tit.2011.2112150","type":"journal-article","created":{"date-parts":[[2011,3,15]],"date-time":"2011-03-15T17:08:26Z","timestamp":1300208906000},"page":"2488-2502","source":"Crossref","is-referenced-by-count":10,"title":["Zero-Knowledge Sets With Short Proofs"],"prefix":"10.1109","volume":"57","author":[{"given":"Dario","family":"Catalano","sequence":"first","affiliation":[]},{"given":"Mario","family":"Di Raimondo","sequence":"additional","affiliation":[]},{"given":"Dario","family":"Fiore","sequence":"additional","affiliation":[]},{"given":"Mariagrazia","family":"Messina","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/s001459900043"},{"key":"ref11","author":"galbraith","year":"2006","journal-title":"Pairings for cryptographers"},{"key":"ref12","first-page":"34","article-title":"Independent zero-knowledge sets.","author":"gennaro","year":"2006","journal-title":"Proc ICA 2006"},{"key":"ref13","year":"0","journal-title":"Gnu Multiple Precision Arithmetic Library"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48071-4_16"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-11799-2_30"},{"key":"ref16","author":"lim","year":"2000","journal-title":"Efficient Multi-Exponentiation and Application to Batch Verification of Digital Signatures"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48658-5_11"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_10"},{"key":"ref19","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/3-540-48184-2_32","article-title":"A digital signature based on a conventional encryption function","author":"merkle","year":"1988","journal-title":"Proc Adv Cryptol (CRYPTO'87)"},{"key":"ref4","doi-asserted-by":"crossref","first-page":"120","DOI":"10.1007\/11681878_7","article-title":"Mercurial commitments: Minimal assumptions and efficient constructions","author":"catalano","year":"2006","journal-title":"Proc Theory of Cryptogr Conf (TCC 2006)"},{"key":"ref27","author":"prabhakaran","year":"2007","journal-title":"Statistically Hiding Sets"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"56","DOI":"10.1007\/978-3-540-24676-3_4","article-title":"Short signatures without random oracles","author":"boneh","year":"2004","journal-title":"Proc Advances in Cryptology (EUROCRYPT 2000)"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1007\/11426639_25","article-title":"Mercurial commitments with applications to zero-knowledge sets","author":"chase","year":"2005","journal-title":"Proc Advances in Cryptology (EUROCRYPT 2000)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_25"},{"key":"ref8","first-page":"173","article-title":"New generation of secure and practical RSA-based signatures","author":"cramer","year":"1996","journal-title":"Proc of Advances in Cryptology (CRYPTO99)"},{"key":"ref7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/11761679_1","article-title":"Security analysis of the strong Diffie-Hellman problem","author":"cheon","year":"2006","journal-title":"Proc Advances in Cryptology (EUROCRYPT 2000)"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1137\/0220068"},{"key":"ref9","first-page":"203","article-title":"Collision free hash functions and public key signature schemes","author":"damgrd","year":"1987","journal-title":"Proc Adv Cryptol (EUROCRYPT'87)"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/168588.168596"},{"key":"ref20","first-page":"80","author":"micali","year":"2003","journal-title":"Proc 44th Ann IEEE Symp Found Comput Sci FOCS'03"},{"key":"ref22","doi-asserted-by":"crossref","first-page":"275","DOI":"10.1007\/978-3-540-30574-3_19","article-title":"Accumulators from bilinear pairings and applications","author":"nguyen","year":"2005","journal-title":"Topics in Cryptology (CT-RSA 2004)"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/SFFCS.1999.814584"},{"key":"ref24","first-page":"3","article-title":"Efficient consistency proofs for generalized queries on a committed database","author":"ostrovsky","year":"2004","journal-title":"Proc of ICALP 2004"},{"key":"ref23","year":"2005","journal-title":"NIST Recommendation for Key Management"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46766-1_9"},{"key":"ref25","year":"0"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/5730547\/05730568.pdf?arnumber=5730568","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,10]],"date-time":"2021-10-10T23:52:34Z","timestamp":1633909954000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/5730568\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,4]]},"references-count":27,"journal-issue":{"issue":"4"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2112150","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,4]]}}}