乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:31:28Z","timestamp":1726410688541},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662479995"},{"type":"electronic","value":"9783662480007"}],"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"},{"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-662-48000-7_28","type":"book-chapter","created":{"date-parts":[[2015,7,31]],"date-time":"2015-07-31T02:27:46Z","timestamp":1438309666000},"page":"565-584","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":22,"title":["Bloom Filters in Adversarial Environments"],"prefix":"10.1007","author":[{"given":"Moni","family":"Naor","sequence":"first","affiliation":[]},{"given":"Eylon","family":"Yogev","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,1]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","unstructured":"Arbitman, Y., Naor, M., Segev, G.: Backyard cuckoo hashing: constant worst-case operations with a succinct representation. In: FOCS, pp. 787\u2013796. IEEE Computer Society (2010)","DOI":"10.1109\/FOCS.2010.80"},{"issue":"3","key":"28_CR2","doi-asserted-by":"publisher","first-page":"428","DOI":"10.1007\/s00453-013-9840-x","volume":"70","author":"M Aum\u00fcller","year":"2014","unstructured":"Aum\u00fcller, M., Dietzfelbinger, M., Woelfel, P.: Explicit and efficient hash families suffice for cuckoo hashing with a stash. Algorithmica 70(3), 428\u2013456 (2014). \n http:\/\/dx.doi.org\/10.1007\/s00453-013-9840-x","journal-title":"Algorithmica"},{"key":"28_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1007\/978-3-642-36594-2_3","volume-title":"Theory of Cryptography","author":"I Berman","year":"2013","unstructured":"Berman, I., Haitner, I., Komargodski, I., Naor, M.: Hardness preserving reductions via cuckoo hashing. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 40\u201359. Springer, Heidelberg (2013)"},{"key":"28_CR4","doi-asserted-by":"publisher","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, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"28_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"278","DOI":"10.1007\/3-540-48329-2_24","volume-title":"Advances in Cryptology - CRYPTO \u201993","author":"A Blum","year":"1994","unstructured":"Blum, A., Furst, M.L., Kearns, M., Lipton, R.J.: Cryptographic primitives based on hard learning problems. In: Stinson, D.R. (ed.) CRYPTO 1993. LNCS, vol. 773, pp. 278\u2013291. Springer, Heidelberg (1994)"},{"key":"28_CR6","unstructured":"Broder, A., Mitzenmacher, M.: Network applications of bloom filters: a survey. In: Internet Mathematics, pp. 636\u2013646 (2002)"},{"key":"28_CR7","unstructured":"Carter, L., Floyd, R., Gill, J., Markowsky, G., Wegman, M.: Exact and approximate membership testers. In: Proceedings of the tenth annual ACM symposium on Theory of computing, STOC 1978, pp. 59\u201365. ACM, New York, NY, USA (1978). \n http:\/\/doi.acm.org\/10.1145\/800133.804332"},{"key":"28_CR8","unstructured":"Chazelle, B., Kilian, J., Rubinfeld, R., Tal, A.: The bloomier filter: an efficient data structure for static support lookup tables. In: SODA, pp. 30\u201339. SIAM (2004)"},{"key":"28_CR9","doi-asserted-by":"crossref","unstructured":"Deng, F., Rafiei, D.: Approximately detecting duplicates for streaming data using stable Bloom filters. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 25\u201336. ACM (2006)","DOI":"10.1145\/1142473.1142477"},{"issue":"1","key":"28_CR10","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/MM.2004.1268997","volume":"24","author":"S Dharmapurikar","year":"2004","unstructured":"Dharmapurikar, S., Krishnamurthy, P., Sproull, T.S., Lockwood, J.W.: Deep packet inspection using parallel Bloom filters. IEEE Micro 24(1), 52\u201361 (2004)","journal-title":"IEEE Micro"},{"key":"28_CR11","unstructured":"Dietzfelbinger, M., Woelfel, P.: Almost random graphs with simple hash functions. In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9\u201311, 2003, San Diego, CA, USA, pp. 629\u2013638. ACM (2003)"},{"key":"28_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/11681878_14","volume-title":"Theory of Cryptography","author":"C Dwork","year":"2006","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265\u2013284. Springer, Heidelberg (2006)"},{"issue":"3","key":"28_CR13","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1109\/90.851975","volume":"8","author":"L Fan","year":"2000","unstructured":"Fan, L., Cao, P., Almeida, J.M., Broder, A.Z.: Summary cache: a scalable wide-area web cache sharing protocol. IEEE\/ACM Trans. Netw. 8(3), 281\u2013293 (2000)","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"28_CR14","doi-asserted-by":"crossref","unstructured":"Hardt, M., Woodruff, D.P.: How robust are linear sketches to adaptive inputs? In: STOC, pp. 121\u2013130. ACM (2013)","DOI":"10.1145\/2488608.2488624"},{"key":"28_CR15","doi-asserted-by":"crossref","unstructured":"Impagliazzo, R., Luby, M.: One-way functions are essential for complexity based cryptography (extended abstract). In: FOCS, pp. 230\u2013235. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63483"},{"issue":"3","key":"28_CR16","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01190898","volume":"9","author":"RJ Lipton","year":"1993","unstructured":"Lipton, R.J., Naughton, J.F.: Clocked adversaries for hashing. Algorithmica 9(3), 239\u2013252 (1993)","journal-title":"Algorithmica"},{"issue":"4","key":"28_CR17","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/0020-0190(94)00032-8","volume":"50","author":"U Manber","year":"1994","unstructured":"Manber, U., Wu, S.: An algorithm for approximate membership checking with application to password security. Inf. Process. Lett. 50(4), 191\u2013197 (1994)","journal-title":"Inf. Process. Lett."},{"issue":"6","key":"28_CR18","doi-asserted-by":"publisher","first-page":"1845","DOI":"10.1137\/080733772","volume":"40","author":"I Mironov","year":"2011","unstructured":"Mironov, I., Naor, M., Segev, G.: Sketching in adversarial environments. SIAM J. Comput. 40(6), 1845\u20131870 (2011). \n http:\/\/dx.doi.org\/10.1137\/080733772","journal-title":"SIAM J. Comput."},{"issue":"5","key":"28_CR19","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1109\/32.52778","volume":"16","author":"JK Mullin","year":"1990","unstructured":"Mullin, J.K.: Optimal semijoins for distributed database systems. IEEE Trans. Softw. Eng. 16(5), 558\u2013560 (1990)","journal-title":"IEEE Trans. Softw. Eng."},{"key":"28_CR20","doi-asserted-by":"crossref","unstructured":"Naor, M., Rothblum, G.N.: Learning to impersonate. In: ICML, ACM International Conference Proceeding Series, vol. 148, pp. 649\u2013656. ACM (2006)","DOI":"10.1145\/1143844.1143926"},{"key":"28_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1007\/978-3-642-45030-3_48","volume-title":"Algorithms and Computation","author":"M Naor","year":"2013","unstructured":"Naor, M., Yogev, E.: Sliding Bloom filters. In: Cai, L., Cheng, S.-W., Lam, T.-W. (eds.) ISAAC 2013. LNCS, vol. 8283, pp. 513\u2013523. Springer, Heidelberg (2013)"},{"key":"28_CR22","unstructured":"Naor, M., Yogev, E.: Bloom filters in adversarial environments. CoRR abs\/1412.8356 (2014). \n http:\/\/arxiv.org\/abs\/1412.8356"},{"issue":"1","key":"28_CR23","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1137\/060658400","volume":"38","author":"A Pagh","year":"2008","unstructured":"Pagh, A., Pagh, R.: Uniform hashing in constant time and optimal space. SIAM J. Comput. 38(1), 85\u201396 (2008)","journal-title":"SIAM J. Comput."},{"key":"28_CR24","unstructured":"Pagh, A., Pagh, R., Rao, S.S.: An optimal Bloom filter replacement. In: SODA, pp. 823\u2013829. SIAM (2005)"},{"key":"28_CR25","first-page":"1","volume-title":"Encyclopedia of Algorithms","author":"R Pagh","year":"2008","unstructured":"Pagh, R.: Cuckoo hashing. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 1\u201399. Springer, New York (2008)"},{"issue":"2","key":"28_CR26","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/j.jalgor.2003.12.002","volume":"51","author":"R Pagh","year":"2004","unstructured":"Pagh, R., Rodler, F.F.: Cuckoo hashing. J. Algorithms 51(2), 122\u2013144 (2004)","journal-title":"J. Algorithms"},{"key":"28_CR27","doi-asserted-by":"crossref","unstructured":"Putze, F., Sanders, P., Singler, J.: Cache-, hash-, and space-efficient bloom filters. ACM J. Exp. Algorithmics 14 (2009)","DOI":"10.1145\/1498698.1594230"},{"issue":"1","key":"28_CR28","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1109\/SURV.2011.031611.00024","volume":"14","author":"S Tarkoma","year":"2012","unstructured":"Tarkoma, S., Rothenberg, C.E., Lagerspetz, E.: Theory and practice of bloom filters for distributed systems. IEEE Commun. Surv. Tutorials 14(1), 131\u2013155 (2012)","journal-title":"IEEE Commun. Surv. Tutorials"},{"issue":"11","key":"28_CR29","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27(11), 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"28_CR30","doi-asserted-by":"crossref","unstructured":"Yan, J., Cho, P.L.: Enhancing collaborative spam detection with bloom filters. In: ACSAC, pp. 414\u2013428. IEEE Computer Society (2006)","DOI":"10.1109\/ACSAC.2006.26"},{"key":"28_CR31","doi-asserted-by":"crossref","unstructured":"Zhang, L., Guan, Y.: Detecting click fraud in pay-per-click streams of online advertising networks. In: ICDCS, pp. 77\u201384. IEEE Computer Society (2008)","DOI":"10.1109\/ICDCS.2008.98"},{"key":"28_CR32","unstructured":"Zhu, Y., Jiang, H., Wang, J.: Hierarchical Bloom filter arrays (hba): a novel, scalable metadata management system for large cluster-based storage. In: CLUSTER, pp. 165\u2013174. IEEE Computer Society (2004)"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology -- CRYPTO 2015"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-48000-7_28","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,10]],"date-time":"2019-08-10T00:08:48Z","timestamp":1565395728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-48000-7_28"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783662479995","9783662480007"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-48000-7_28","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"1 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}