{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T18:26:50Z","timestamp":1725906410408},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319647005"},{"type":"electronic","value":"9783319647012"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-64701-2_3","type":"book-chapter","created":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T04:56:55Z","timestamp":1500958615000},"page":"31-45","source":"Crossref","is-referenced-by-count":2,"title":["Private Membership Test Protocol with Low Communication Complexity"],"prefix":"10.1007","author":[{"given":"Sara","family":"Ramezanian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tommi","family":"Meskanen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masoud","family":"Naderpour","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valtteri","family":"Niemi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,7,26]]},"reference":[{"issue":"15","key":"3_CR1","doi-asserted-by":"crossref","first-page":"5802","DOI":"10.1073\/pnas.1218772110","volume":"110","author":"M Kosinski","year":"2013","unstructured":"Kosinski, M., Stillwell, D., Graepel, T.: Private traits and attributes are predictable from digital records of human behavior. Proc. Nat. Acad. Sci. 110(15), 5802\u20135805 (2013)","journal-title":"Proc. Nat. Acad. Sci."},{"issue":"2","key":"3_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2636242.2636244","volume":"18","author":"S Seneviratne","year":"2014","unstructured":"Seneviratne, S., Seneviratne, A., Mohapatra, P., Mahanti, A.: Predicting user traits from a snapshot of apps installed on a smartphone. ACM SIGMOBILE Mob. Comput. Commun. Rev. 18(2), 1\u20138 (2014)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"7","key":"3_CR3","doi-asserted-by":"crossref","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13(7), 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"3_CR4","doi-asserted-by":"crossref","unstructured":"Fan, B., Andersen, D.G., Kaminsky, M., Mitzenmacher, M.D.: Cuckoo filter: practically better than bloom. In: Proceedings of the 10th ACM International on Conference on Emerging Networking Experiments and Technologies, pp. 75\u201388. ACM (2014)","DOI":"10.1145\/2674005.2674994"},{"key":"3_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1007\/11841036_61","volume-title":"Algorithms \u2013 ESA 2006","author":"F Bonomi","year":"2006","unstructured":"Bonomi, F., Mitzenmacher, M., Panigrahy, R., Singh, S., Varghese, G.: An improved construction for counting bloom filters. In: Azar, Y., Erlebach, T. (eds.) ESA 2006. LNCS, vol. 4168, pp. 684\u2013695. Springer, Heidelberg (2006). doi:\n10.1007\/11841036_61"},{"issue":"11","key":"3_CR6","first-page":"169","volume":"4","author":"RL Rivest","year":"1978","unstructured":"Rivest, R.L., Adleman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. Found. Secur. Comput. 4(11), 169\u2013180 (1978)","journal-title":"Found. Secur. Comput."},{"key":"3_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-540-48000-6_14","volume-title":"Advances in Cryptology - ASIACRYPT\u201999","author":"P Paillier","year":"1999","unstructured":"Paillier, P., Pointcheval, D.: Efficient public-key cryptosystems provably secure against active adversaries. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 165\u2013179. Springer, Heidelberg (1999). doi:\n10.1007\/978-3-540-48000-6_14"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1007\/978-3-540-27800-9_5","volume-title":"Information Security and Privacy","author":"Y-C Chang","year":"2004","unstructured":"Chang, Y.-C.: Single database private information retrieval with logarithmic communication. In: Wang, H., Pieprzyk, J., Varadharajan, V. (eds.) ACISP 2004. LNCS, vol. 3108, pp. 50\u201361. Springer, Heidelberg (2004). doi:\n10.1007\/978-3-540-27800-9_5"},{"key":"3_CR9","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords. CiteSeer (1997)"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Ostrovsky, R.: Replication is not needed: single database, computationally-private information retrieval. In: Proceedings of the 38th Annual Symposium on Foundations of Computer Science, pp. 364\u2013373. IEEE (1997)","DOI":"10.1109\/SFCS.1997.646125"},{"key":"3_CR11","first-page":"72","volume":"82","author":"W Gasarch","year":"2004","unstructured":"Gasarch, W.: A survey on private information retrieval. Bull. EATCS 82, 72\u2013107 (2004)","journal-title":"Bull. EATCS"},{"key":"3_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"803","DOI":"10.1007\/11523468_65","volume-title":"Automata, Languages and Programming","author":"C Gentry","year":"2005","unstructured":"Gentry, C., Ramzan, Z.: Single-database private information retrieval with constant communication rate. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 803\u2013815. Springer, Heidelberg (2005). doi:\n10.1007\/11523468_65"},{"key":"3_CR13","unstructured":"Pinkas, B., Schneider, T., Zohner, M.: Scalable private set intersection based on OT extension (2016). \nhttp:\/\/eprint.iacr.org\/2016\/930\n\n. (in submission)"},{"key":"3_CR14","unstructured":"Rabin, M.O.: How to exchange secrets with oblivious transfer. IACR Cryptology ePrint Archive 2005, 187 (2005)"},{"key":"3_CR15","unstructured":"Tamrakar, S., Liu, J., Paverd, A., Ekberg, J.E., Pinkas, B., Asokan, N.: The circle game: Scalable private membership test using trusted hardware (2016). arXiv preprint: \narXiv:1606.01655"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Meskanen, T., Liu, J., Ramezanian, S., Niemi, V.: Private membership test for bloom filters. In: 2015 IEEE Trustcom\/BigDataSE\/ISPA, vol. 1, pp. 515\u2013522. IEEE (2015)","DOI":"10.1109\/Trustcom.2015.414"}],"container-title":["Lecture Notes in Computer Science","Network and System Security"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-64701-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T04:58:02Z","timestamp":1500958682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-64701-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319647005","9783319647012"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-64701-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}