{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:29:20Z","timestamp":1725514160216},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642372810"},{"type":"electronic","value":"9783642372827"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37282-7_3","type":"book-chapter","created":{"date-parts":[[2013,4,2]],"date-time":"2013-04-02T21:20:03Z","timestamp":1364937603000},"page":"18-33","source":"Crossref","is-referenced-by-count":1,"title":["Privacy-Friendly Checking of Remote Token Blacklists"],"prefix":"10.1007","author":[{"given":"Roel","family":"Peeters","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andreas","family":"Pashalidis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"3_CR1","unstructured":"Yearly Report on Algorithms and Keysizes (2011), D.SPA.17 Rev. 1.0. Technical report, ICT-2007-216676\u00a0ECRYPT\u00a0II (June 2011)"},{"key":"3_CR2","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. Cryptology ePrint Archive, Report 1998\/003 (1998), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/978-3-642-03168-7_10","volume-title":"Privacy Enhancing Technologies","author":"E. Cristofaro De","year":"2009","unstructured":"De Cristofaro, E., Jarecki, S., Kim, J., Tsudik, G.: Privacy-Preserving Policy-Based Information Transfer. In: Goldberg, I., Atallah, M.J. (eds.) PETS 2009. LNCS, vol.\u00a05672, pp. 164\u2013184. Springer, Heidelberg (2009)"},{"key":"3_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/978-3-642-14577-3_13","volume-title":"Financial Cryptography and Data Security","author":"E. Cristofaro De","year":"2010","unstructured":"De Cristofaro, E., Tsudik, G.: Practical Private Set Intersection Protocols with Linear Complexity. In: Sion, R. (ed.) FC 2010. LNCS, vol.\u00a06052, pp. 143\u2013159. Springer, Heidelberg (2010)"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-642-30921-2_4","volume-title":"Trust and Trustworthy Computing","author":"E. De Cristofaro","year":"2012","unstructured":"De Cristofaro, E., Tsudik, G.: Experimenting with Fast Private Set Intersection. In: Katzenbeisser, S., Weippl, E., Camp, L.J., Volkamer, M., Reiter, M., Zhang, X. (eds.) Trust 2012. LNCS, vol.\u00a07344, pp. 55\u201373. Springer, Heidelberg (2012)"},{"key":"3_CR6","unstructured":"De Cristofaro, E., Tsudik, G.: On the performance of certain private set intersection protocols. Cryptology ePrint Report 2012\/054 (2012), \n                    \n                      http:\/\/eprint.iacr.org\/"},{"issue":"6","key":"3_CR7","doi-asserted-by":"publisher","first-page":"637","DOI":"10.1145\/3812.3818","volume":"28","author":"S. Even","year":"1985","unstructured":"Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Commun. ACM\u00a028(6), 637\u2013647 (1985)","journal-title":"Commun. ACM"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-24676-3_1","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"M.J. Freedman","year":"2004","unstructured":"Freedman, M.J., Nissim, K., Pinkas, B.: Efficient Private Matching and Set Intersection. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol.\u00a03027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"3_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/11957454_16","volume-title":"Privacy Enhancing Technologies","author":"S. Hohenberger","year":"2006","unstructured":"Hohenberger, S., Weis, S.A.: Honest-Verifier Private Disjointness Testing Without Random Oracles. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 277\u2013294. Springer, Heidelberg (2006)"},{"key":"3_CR10","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: Are garbled circuits better than custom protocols? In: Proceedings of the NDSS 2012. IEEE (2012)"},{"key":"3_CR11","unstructured":"International Civil Aviation Organization. Document 9303, vol. 2, pt. 1 (2006)"},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Juels, A., Wattenberg, M.: A fuzzy commitment scheme. In: Motiwalla, J., Tsudik, G. (eds.) CCS 1999, Proceedings of the 6th ACM Conference on Computer and Communications Security, Singapore, November 1-4, pp. 28\u201336 (1999)","DOI":"10.1145\/319709.319714"},{"key":"3_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11507840_13","volume-title":"Financial Cryptography and Data Security","author":"A. Kiayias","year":"2005","unstructured":"Kiayias, A., Mitrofanova, A.: Testing Disjointness of Private Datasets. In: S. Patrick, A., Yung, M. (eds.) FC 2005. LNCS, vol.\u00a03570, pp. 109\u2013124. Springer, Heidelberg (2005)"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/s00446-004-0116-1","volume":"17","author":"N. Li","year":"2005","unstructured":"Li, N., Du, W., Boneh, D.: Oblivious signature-based envelope. Distributed Computing\u00a017(4), 293\u2013302 (2005)","journal-title":"Distributed Computing"},{"key":"3_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"573","DOI":"10.1007\/3-540-48405-1_36","volume-title":"Advances in Cryptology - CRYPTO \u201999","author":"M. Naor","year":"1999","unstructured":"Naor, M., Pinkas, B.: Oblivious Transfer with Adaptive Queries. In: Wiener, M. (ed.) CRYPTO 1999. LNCS, vol.\u00a01666, pp. 573\u2013590. Springer, Heidelberg (1999)"},{"issue":"1","key":"3_CR16","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/s10207-008-0064-z","volume":"8","author":"M. Narasimha","year":"2009","unstructured":"Narasimha, M., Solis, J., Tsudik, G.: Privacy-Preserving Revocation Checking. Int. J. Inf. Secur.\u00a08(1), 61\u201375 (2009)","journal-title":"Int. J. Inf. Secur."},{"key":"3_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/11889663_19","volume-title":"Financial Cryptography and Data Security","author":"S. Nasserian","year":"2006","unstructured":"Nasserian, S., Tsudik, G.: Revisiting Oblivious Signature-Based Envelopes. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol.\u00a04107, pp. 221\u2013235. Springer, Heidelberg (2006)"},{"issue":"2-3","key":"3_CR18","first-page":"356","volume":"20","author":"W. Ogata","year":"2004","unstructured":"Ogata, W., Kurosawa, K.: Oblivious keyword search. Journal of Complexity - Special issue on coding and cryptography\u00a020(2-3), 356\u2013371 (2004)","journal-title":"Journal of Complexity - Special issue on coding and cryptography"},{"key":"3_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/11957454_20","volume-title":"Privacy Enhancing Technologies","author":"J. Solis","year":"2006","unstructured":"Solis, J., Tsudik, G.: Simple and Flexible Revocation Checking with Privacy. In: Danezis, G., Golle, P. (eds.) PET 2006. LNCS, vol.\u00a04258, pp. 351\u2013367. Springer, Heidelberg (2006)"},{"key":"3_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/978-3-540-70500-0_12","volume-title":"Information Security and Privacy","author":"Q. Ye","year":"2008","unstructured":"Ye, Q., Wang, H., Pieprzyk, J., Zhang, X.-M.: Efficient Disjointness Tests for Private Datasets. In: Mu, Y., Susilo, W., Seberry, J. (eds.) ACISP 2008. LNCS, vol.\u00a05107, pp. 155\u2013169. Springer, Heidelberg (2008)"},{"issue":"3","key":"3_CR21","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1504\/IJACT.2009.023471","volume":"1","author":"Q. Ye","year":"2009","unstructured":"Ye, Q., Wang, H., Pieprzyk, J., Zhang, X.-M.: Unconditionally secure disjointness tests for private datasets. IJACT\u00a01(3), 225\u2013235 (2009)","journal-title":"IJACT"}],"container-title":["IFIP Advances in Information and Communication Technology","Policies and Research in Identity Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-37282-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,11]],"date-time":"2019-05-11T23:03:44Z","timestamp":1557615824000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-37282-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642372810","9783642372827"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37282-7_3","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2013]]}}}