{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T04:56:23Z","timestamp":1755838583931,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":52,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,4,2]],"date-time":"2017-04-02T00:00:00Z","timestamp":1491091200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"JSPS KAKENHI","award":["JP16K00198"],"award-info":[{"award-number":["JP16K00198"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,4,2]]},"DOI":"10.1145\/3052973.3052979","type":"proceedings-article","created":{"date-parts":[[2017,3,31]],"date-time":"2017-03-31T12:22:54Z","timestamp":1490962974000},"page":"777-788","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Group Signatures with Time-bound Keys Revisited"],"prefix":"10.1145","author":[{"given":"Keita","family":"Emura","sequence":"first","affiliation":[{"name":"National Institute of Information and Communications Technology, Koganei, Japan"}]},{"given":"Takuya","family":"Hayashi","sequence":"additional","affiliation":[{"name":"National Institute of Information and Communications Technology, Koganei, Japan"}]},{"given":"Ai","family":"Ishida","sequence":"additional","affiliation":[{"name":"Tokyo Institute of Technology\/National Institute of Advanced Industrial Science and Technology, Meguro, Japan"}]}],"member":"320","published-online":{"date-parts":[[2017,4,2]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30191-2_1"},{"key":"e_1_3_2_1_2_1","unstructured":"D. F. Aranha and C. P. L. Gouv\u00eaa. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic.  D. F. Aranha and C. P. L. Gouv\u00eaa. RELIC is an Efficient LIbrary for Cryptography. https:\/\/github.com\/relic-toolkit\/relic."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-07536-5_25"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/bxv026"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-44618-9_3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/11832072_8"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/1766171.1766225"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15317-4_24"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28628-8_3"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-39555-5_7"},{"key":"e_1_3_2_1_14_1","first-page":"1","volume-title":"Public Key Cryptography","author":"Boyen X.","year":"2007"},{"key":"e_1_3_2_1_15_1","first-page":"215","volume-title":"SECRYPT","author":"Bringer J.","year":"2012"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-45572-3_1"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30598-9_9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-27954-6_21"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754868.1754897"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2414456.2414470"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/11958239_13"},{"key":"e_1_3_2_1_23_1","first-page":"61","volume-title":"ACM DRM","author":"Dodis Y.","year":"2002"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-013-0204-y"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1093\/ietfec\/e89-a.5.1328"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-17373-8_23"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-89255-7_12"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1781454.1781469"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45664-3_4"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-49896-5_1"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897845.2897898"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-32009-5_34"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-29011-4_36"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48000-7_15"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-10433-6_34"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/11496137_31"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIFS.2014.2366300"},{"key":"e_1_3_2_1_38_1","first-page":"555","volume-title":"SECRYPT","author":"Malina L.","year":"2013"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1002\/sec.1383"},{"key":"e_1_3_2_1_40_1","unstructured":"A. Miyaji M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions 84-A(5):1234--1243 2001.  A. Miyaji M. Nakabayashi and S. Takano. New explicit conditions of elliptic curve traces for FR-reduction. IEICE Transactions 84-A(5):1234--1243 2001."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-00468-1_26"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/11593447_29"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/11908739_2"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"T. Nakanishi and N. Funabiki. Revocable group signatures with compact revocation list using accumulators. IEICE Transactions 98-A(1):117--131 2015.  T. Nakanishi and N. Funabiki. Revocable group signatures with compact revocation list using accumulators. IEICE Transactions 98-A(1):117--131 2015.","DOI":"10.1587\/transfun.E98.A.117"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"D. Naor M. Naor and J. Lotspiech. Revocation and tracing schemes for stateless receivers. Electronic Colloquium on Computational Complexity (ECCC) (043) 2002.  D. Naor M. Naor and J. Lotspiech. Revocation and tracing schemes for stateless receivers. Electronic Colloquium on Computational Complexity (ECCC) (043) 2002.","DOI":"10.1007\/3-540-44647-8_3"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-30574-3_19"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02384-2_10"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-29485-8_7"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.5555\/1754495.1754540"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-72540-4_13"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-30057-8_42"},{"key":"e_1_3_2_1_53_1","doi-asserted-by":"publisher","DOI":"10.5555\/1948966.1948979"},{"key":"e_1_3_2_1_54_1","doi-asserted-by":"publisher","DOI":"10.1007\/11935070_8"}],"event":{"name":"ASIA CCS '17: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Abu Dhabi United Arab Emirates","acronym":"ASIA CCS '17"},"container-title":["Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3052973.3052979","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3052973.3052979","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:36:57Z","timestamp":1750217817000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3052973.3052979"}},"subtitle":["A New Model and an Efficient Construction"],"short-title":[],"issued":{"date-parts":[[2017,4,2]]},"references-count":52,"alternative-id":["10.1145\/3052973.3052979","10.1145\/3052973"],"URL":"https:\/\/doi.org\/10.1145\/3052973.3052979","relation":{},"subject":[],"published":{"date-parts":[[2017,4,2]]},"assertion":[{"value":"2017-04-02","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}