{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:28:44Z","timestamp":1742916524338,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319184661"},{"type":"electronic","value":"9783319184678"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-18467-8_9","type":"book-chapter","created":{"date-parts":[[2015,5,8]],"date-time":"2015-05-08T08:12:03Z","timestamp":1431072723000},"page":"126-141","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Survey of Alerting Websites: Risks and Solutions"],"prefix":"10.1007","author":[{"given":"Amrit","family":"Kumar","sequence":"first","affiliation":[]},{"given":"C\u00e9dric","family":"Lauradoux","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,5,9]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Communications of the ACM 13, July 1970","DOI":"10.1145\/362686.362692"},{"key":"9_CR2","unstructured":"Bongard, D.: De-anonymizing users of french political forums. In: Passwords 2013 (2013)"},{"key":"9_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"402","DOI":"10.1007\/3-540-48910-X_28","volume-title":"Advances in Cryptology - EUROCRYPT \u201999","author":"C Cachin","year":"1999","unstructured":"Cachin, C., Micali, S., Stadler, M.A.: Computationally private information retrieval with polylogarithmic communication. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 402\u2013414. Springer, Heidelberg (1999)"},{"key":"9_CR4","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)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Chor, B., Gilboa, N., Naor, M.: Private information retrieval by keywords (1998)","DOI":"10.1145\/293347.293350"},{"key":"9_CR6","unstructured":"Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Annual Symposium on Foundations of Computer Science, FOCS 1995 (1995)"},{"key":"9_CR7","doi-asserted-by":"crossref","unstructured":"Das, A., Bonneau, J., Caesar, M., Borisov, N., Wang, X.: The tangled web of password reuse. In: Network and Distributed System Security Symposium, NDSS 2014 (2014)","DOI":"10.14722\/ndss.2014.23357"},{"key":"9_CR8","doi-asserted-by":"crossref","unstructured":"de Carn\u00e9 de Carnavalet, X., Mannan, M.: From very weak to very strong: analyzing password-strength meters. In: Network and Distributed System Security Symposium, NDSS 2014 (2014)","DOI":"10.14722\/ndss.2014.23268"},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-35404-5_17","volume-title":"Cryptology and Network Security","author":"E Cristofaro De","year":"2012","unstructured":"De Cristofaro, E., Gasti, P., Tsudik, G.: Fast and private computation of cardinality of set intersection and union. In: Pieprzyk, J., Sadeghi, A.-R., Manulis, M. (eds.) CANS 2012. LNCS, vol. 7712, pp. 218\u2013231. Springer, Heidelberg (2012)"},{"key":"9_CR10","doi-asserted-by":"crossref","unstructured":"De Cristofaro, E., Tsudik, G.: Practical private set intersection protocols with linear complexity. In: Proceedings of the 14th International Conference on Financial Cryptography and Data Security (2010)","DOI":"10.1007\/978-3-642-14577-3_13"},{"key":"9_CR11","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. 7344, pp. 55\u201373. Springer, Heidelberg (2012)"},{"key":"9_CR12","doi-asserted-by":"crossref","unstructured":"Dong, C., Chen, L., Wen, Z.: When private set intersection meets big data: an efficient and scalable protocol. In: ACM Conference on Computer and Communications Security (2013)","DOI":"10.1145\/2508859.2516701"},{"key":"9_CR13","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":"MJ 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. 3027, pp. 1\u201319. Springer, Heidelberg (2004)"},{"key":"9_CR14","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)"},{"key":"9_CR15","doi-asserted-by":"crossref","unstructured":"Goldberg, I.: Improving the robustness of private information retrieval. In: IEEE Symposium on Security and Privacy, 2007. S&P 2007 (2007)","DOI":"10.1109\/SP.2007.23"},{"key":"9_CR16","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. 4258, pp. 277\u2013294. Springer, Heidelberg (2006)"},{"key":"9_CR17","unstructured":"Huang, Y., Evans, D., Katz, J.: Private set intersection: are garbled circuits better than custom protocols? In: NDSS (2012)"},{"key":"9_CR18","doi-asserted-by":"crossref","unstructured":"Juels, A., Rivest, R.L.: Honeywords: making password-cracking detectable. In: ACM SIGSAC Conference on Computer and Communications Security, CCS 201313 (2013)","DOI":"10.1145\/2508859.2516671"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1007\/11535218_15","volume-title":"Advances in Cryptology \u2013 CRYPTO 2005","author":"L Kissner","year":"2005","unstructured":"Kissner, L., Song, D.: Privacy-preserving set operations. In: Shoup, V. (ed.) CRYPTO 2005. LNCS, vol. 3621, pp. 241\u2013257. Springer, Heidelberg (2005)"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Kontaxis, G., Athanasopoulos, E., Portokalidis, G., Keromytis, A.D.: SAuth: protecting user accounts from password database leaks. In: ACM SIGSAC Conference on Computer and Communications Security, CCS 2013 (2013)","DOI":"10.1145\/2508859.2516746"},{"key":"9_CR21","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 (1997)"},{"key":"9_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"314","DOI":"10.1007\/11556992_23","volume-title":"Information Security","author":"H Lipmaa","year":"2005","unstructured":"Lipmaa, H.: An oblivious transfer protocol with log-squared communication. In: Zhou, J., L\u00f3pez, J., Deng, R.H., Bao, F. (eds.) ISC 2005. LNCS, vol. 3650, pp. 314\u2013328. Springer, Heidelberg (2005)"},{"key":"9_CR23","unstructured":"Melchor, C.A., Gaborit, P.: A fast private information retrieval protocol. In: IEEE International Symposium on Information Theory, 2008. ISIT 2008 (2008)"},{"key":"9_CR24","doi-asserted-by":"crossref","unstructured":"Mitzenmacher, M.: Compressed bloom filters. In: ACM Symposium on Principles of Distributed Computing - PODC 2001 (2001)","DOI":"10.1145\/383962.384004"},{"key":"9_CR25","doi-asserted-by":"crossref","unstructured":"Narayanan, A., Shmatikov, V.: Fast dictionary attacks on passwords using time-space tradeoff. In: ACM Conference on Computer and Communications Security, CCS 2005 (2005)","DOI":"10.1145\/1102120.1102168"},{"key":"9_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/978-3-642-27576-0_13","volume-title":"Financial Cryptography and Data Security","author":"F Olumofin","year":"2012","unstructured":"Olumofin, F., Goldberg, I.: Revisiting the computational practicality of private information retrieval. In: Danezis, G. (ed.) FC 2011. LNCS, vol. 7035, pp. 158\u2013172. Springer, Heidelberg (2012)"},{"key":"9_CR27","doi-asserted-by":"crossref","unstructured":"Parno, B., McCune, J.M., Wendlandt, D., Andersen, D.G., Perrig, A.: CLAMP: Practical prevention of large-scale data leaks. In: IEEE Symposium on Security and Privacy - S&P 2009 (2009)","DOI":"10.1109\/SP.2009.21"},{"key":"9_CR28","unstructured":"Sion, R., Carbunar, B.: On the Practicality of Private Information Retrieval. In: NDSS (2007)"},{"issue":"4","key":"9_CR29","doi-asserted-by":"crossref","first-page":"593","DOI":"10.3233\/JCS-2005-13401","volume":"13","author":"J Vaidya","year":"2005","unstructured":"Vaidya, J., Clifton, C.: Secure set intersection cardinality with application to association rule mining. J. Comput. Secur. 13(4), 593\u2013622 (2005)","journal-title":"J. Comput. Secur."}],"container-title":["IFIP Advances in Information and Communication Technology","ICT Systems Security and Privacy Protection"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-18467-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T20:17:01Z","timestamp":1559161021000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-18467-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319184661","9783319184678"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-18467-8_9","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"9 May 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}