{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T01:11:41Z","timestamp":1725412301210},"reference-count":10,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1109\/gcce.2013.6664912","type":"proceedings-article","created":{"date-parts":[[2013,11,27]],"date-time":"2013-11-27T21:57:12Z","timestamp":1385589432000},"page":"530-533","source":"Crossref","is-referenced-by-count":1,"title":["Reducing public-key size in an anonymous credential system for CNF formulas with constant-size proofs"],"prefix":"10.1109","author":[{"given":"Nasima","family":"Begum","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Toru","family":"Nakanishi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nobuo","family":"Funabiki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"3","article-title":"Efficient proofs for cnf formulas on attributes in pairing-based anonymous credential system","author":"begum","year":"2012","journal-title":"Proc 15th Annual International Conference on Information Security and Cryptology 2012 (ICISC 2012)"},{"key":"2","first-page":"207","article-title":"Efficient proofs for cnf formulas on attributes in pairing-based anonymous credential system","author":"begum","year":"2012","journal-title":"IEICE Technical Report isEC2012-38"},{"key":"10","first-page":"246","article-title":"Efficient proofs of attributes in pairing-based anonymous credential system","author":"sudarsono","year":"2011","journal-title":"Proc 11th Privacy Enhancing Technologies Symposium (PETS 2011) Ser LNCS 6794"},{"journal-title":"Signing on Elements in Bilinear Groups for Modular Protocol Design","year":"2010","author":"abe","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_24"},{"key":"6","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/3-540-45708-9_5","article-title":"Dynamic accumulators and application to efficient revocation of anonymous credentials","author":"camenisch","year":"2002","journal-title":"Advances in Cryptology-Crypto'2002 LNCS 2442"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1145\/1455770.1455814"},{"key":"4","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-540-89255-7_15","article-title":"Efficient protocols for set membership and range proofs","author":"camenisch","year":"2008","journal-title":"Advances in Cryptology-ASIACRYPT 2008 Ser LNCS 5350"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-78967-3_9"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25516-8_26"}],"event":{"name":"2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)","start":{"date-parts":[[2013,10,1]]},"location":"Tokyo, Japan","end":{"date-parts":[[2013,10,4]]}},"container-title":["2013 IEEE 2nd Global Conference on Consumer Electronics (GCCE)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6653324\/6664739\/06664912.pdf?arnumber=6664912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,22]],"date-time":"2017-06-22T03:16:50Z","timestamp":1498101410000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6664912\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/gcce.2013.6664912","relation":{},"subject":[],"published":{"date-parts":[[2013,10]]}}}