{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,1]],"date-time":"2025-11-01T13:49:52Z","timestamp":1762004992106,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":29,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,5,29]],"date-time":"2018-05-29T00:00:00Z","timestamp":1527552000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1314598, 1265886, 1642928"],"award-info":[{"award-number":["1314598, 1265886, 1642928"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,5,29]]},"DOI":"10.1145\/3196494.3196497","type":"proceedings-article","created":{"date-parts":[[2018,5,31]],"date-time":"2018-05-31T13:18:28Z","timestamp":1527772708000},"page":"567-574","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":8,"title":["Direct Anonymous Attestation with Efficient Verifier-Local Revocation for Subscription System"],"prefix":"10.1145","author":[{"given":"Vireshwar","family":"Kumar","sequence":"first","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"He","family":"Li","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Noah","family":"Luther","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Pranav","family":"Asokan","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Jung-Min (Jerry)","family":"Park","sequence":"additional","affiliation":[{"name":"Virginia Tech, Blacksburg, VA, USA"}]},{"given":"Kaigui","family":"Bian","sequence":"additional","affiliation":[{"name":"Peking University, Beijing, China"}]},{"given":"Martin B. H.","family":"Weiss","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, PA, USA"}]},{"given":"Taieb","family":"Znati","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, PA, USA"}]}],"member":"320","published-online":{"date-parts":[[2018,5,29]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSYST.2012.2221931"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/11693383_22"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10207-013-0191-z"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2016.02.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368310.1368342"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030106"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030103"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SocialCom.2010.118"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TDSC.2011.63"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"J. Camenisch L. Chen M. Drijvers A. Lehmann D. Novick and R. Urian. 2017. One TPM to bind them all: Fixing TPM 2.0 for provably secure anonymous attestation IEEE Symposium on Security and Privacy (S&P). 901--920.  J. Camenisch L. Chen M. Drijvers A. Lehmann D. Novick and R. Urian. 2017. One TPM to bind them all: Fixing TPM 2.0 for provably secure anonymous attestation IEEE Symposium on Security and Privacy (S&P). 901--920.","DOI":"10.1109\/SP.2017.22"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"J. Camenisch M. Drijvers and A. Lehmann. 2016. Anonymous attestation using the strong Diffie Hellman assumption revisited Proceedings of the 9th International Conference on Trust and Trustworthy Computing (TRUST). 1--20.  J. Camenisch M. Drijvers and A. Lehmann. 2016. Anonymous attestation using the strong Diffie Hellman assumption revisited Proceedings of the 9th International Conference on Trust and Trustworthy Computing (TRUST). 1--20.","DOI":"10.1007\/978-3-319-45572-3_1"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25283-9_9"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2508859.2516729"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12510-2_16"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","unstructured":"L. Chen and R. Urian. 2015. DAA-A: Direct anonymous attestation with attributes International Conference on Trust and Trustworthy Computing. 228--245.  L. Chen and R. Urian. 2015. DAA-A: Direct anonymous attestation with attributes International Conference on Trust and Trustworthy Computing. 228--245.","DOI":"10.1007\/978-3-319-22846-4_14"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/3196494.3196497"},{"key":"e_1_3_2_1_17_1","volume-title":"2018 b. Prototype of LASER. (2018). Retrieved","author":"Kumar V.","year":"2017","unstructured":"V. Kumar . 2018 b. Prototype of LASER. (2018). Retrieved Nov. 1, 2017 from https:\/\/github.com\/luthern\/laser\/ V. Kumar et al.. 2018 b. Prototype of LASER. (2018). Retrieved Nov. 1, 2017 from https:\/\/github.com\/luthern\/laser\/"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2007.12.010"},{"key":"e_1_3_2_1_19_1","volume-title":"Retrieved","author":"Goldman K.","year":"2017","unstructured":"K. Goldman . 2017. IBM TPM 2.0 TSS. ( 2017 ). Retrieved Nov. 1, 2017 from https:\/\/sourceforge.net\/projects\/ibmtpm20tss\/ K. Goldman. 2017. IBM TPM 2.0 TSS. (2017). Retrieved Nov. 1, 2017 from https:\/\/sourceforge.net\/projects\/ibmtpm20tss\/"},{"volume-title":"Scalable and Private Media Consumption with Popcorn Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI). 91--107","author":"Gupta T.","key":"e_1_3_2_1_20_1","unstructured":"T. Gupta , N. Crooks , W. Mulhern , S. Setty , L. Alvisi , and M. Walfish . 2016 . Scalable and Private Media Consumption with Popcorn Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI). 91--107 . T. Gupta, N. Crooks, W. Mulhern, S. Setty, L. Alvisi, and M. Walfish. 2016. Scalable and Private Media Consumption with Popcorn Proceedings of the 13th Usenix Conference on Networked Systems Design and Implementation (NSDI). 91--107."},{"key":"e_1_3_2_1_21_1","volume-title":"Retrieved","author":"EC.","year":"2015","unstructured":"ISO\/I EC. 2015. ISO\/IEC 11889:2015, Parts 1--4. ( 2015 ). Retrieved Nov. 1, 2017 from http:\/\/www.iso.org\/iso\/home\/store\/catalogue_tc\/catalogue_detail.htm?csnumber=66510 ISO\/IEC. 2015. ISO\/IEC 11889:2015, Parts 1--4. (2015). Retrieved Nov. 1, 2017 from http:\/\/www.iso.org\/iso\/home\/store\/catalogue_tc\/catalogue_detail.htm?csnumber=66510"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"crossref","unstructured":"N. Komninos and A. K. Junejo. 2015. Privacy preserving attribute based encryption for multiple cloud collaborative environment IEEE\/ACM 8th International Conference on Utility and Cloud Computing (UCC). 595--600.  N. Komninos and A. K. Junejo. 2015. Privacy preserving attribute based encryption for multiple cloud collaborative environment IEEE\/ACM 8th International Conference on Utility and Cloud Computing (UCC). 595--600.","DOI":"10.1109\/UCC.2015.104"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2013.29"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2815675.2815685"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cose.2016.11.018"},{"key":"e_1_3_2_1_26_1","volume-title":"PBC: Pairing-based cryptography.","author":"Lynn B.","year":"2017","unstructured":"B. Lynn . 2017 . PBC: Pairing-based cryptography. (2017). Retrieved Nov . 1, 2017 from https:\/\/crypto.stanford.edu\/pbc\/ B. Lynn. 2017. PBC: Pairing-based cryptography. (2017). Retrieved Nov. 1, 2017 from https:\/\/crypto.stanford.edu\/pbc\/"},{"key":"e_1_3_2_1_27_1","unstructured":"Ponemon Institute. 2010. The billion dollar lost laptop problem: Benchmark study of U.S. organizations. (2010).  Ponemon Institute. 2010. The billion dollar lost laptop problem: Benchmark study of U.S. organizations. (2010)."},{"key":"e_1_3_2_1_28_1","volume-title":"TPM library specification. (2014). Retrieved","author":"Trusted Computing Group","year":"2017","unstructured":"Trusted Computing Group . 2014. TPM library specification. (2014). Retrieved Nov. 1, 2017 from http:\/\/www.trustedcomputinggroup.org\/tpm-library-specification\/ Trusted Computing Group. 2014. TPM library specification. (2014). Retrieved Nov. 1, 2017 from http:\/\/www.trustedcomputinggroup.org\/tpm-library-specification\/"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"crossref","unstructured":"L. Xi D. Feng Y. Qin F. Wei J. Shao and B. Yang. 2014. Direct anonymous attestation in practice: Implementation and efficient revocation Twelfth Annual International Conference on Privacy Security and Trust (PST). 67--74.  L. Xi D. Feng Y. Qin F. Wei J. Shao and B. Yang. 2014. Direct anonymous attestation in practice: Implementation and efficient revocation Twelfth Annual International Conference on Privacy Security and Trust (PST). 67--74.","DOI":"10.1109\/PST.2014.6890925"}],"event":{"name":"ASIA CCS '18: ACM Asia Conference on Computer and Communications Security","sponsor":["SIGSAC ACM Special Interest Group on Security, Audit, and Control"],"location":"Incheon Republic of Korea","acronym":"ASIA CCS '18"},"container-title":["Proceedings of the 2018 on Asia Conference on Computer and Communications Security"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196497","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196494.3196497","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3196494.3196497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T01:39:05Z","timestamp":1750210745000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3196494.3196497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,29]]},"references-count":29,"alternative-id":["10.1145\/3196494.3196497","10.1145\/3196494"],"URL":"https:\/\/doi.org\/10.1145\/3196494.3196497","relation":{},"subject":[],"published":{"date-parts":[[2018,5,29]]},"assertion":[{"value":"2018-05-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}