{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T03:46:31Z","timestamp":1725680791483},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642300448"},{"type":"electronic","value":"9783642300455"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-30045-5_11","type":"book-chapter","created":{"date-parts":[[2012,5,15]],"date-time":"2012-05-15T00:33:29Z","timestamp":1337042009000},"page":"135-148","source":"Crossref","is-referenced-by-count":8,"title":["On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks"],"prefix":"10.1007","author":[{"given":"Udi","family":"Ben-Porat","sequence":"first","affiliation":[]},{"given":"Anat","family":"Bremler-Barr","sequence":"additional","affiliation":[]},{"given":"Hanoch","family":"Levy","sequence":"additional","affiliation":[]},{"given":"Bernhard","family":"Plattner","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"Smith, R., Estan, C., Jha, S.: Backtracking Algorithmic Complexity Attacks Against a NIDS. In: Proceedings of ACSAC Annual Computer Security Applications Conference (2006)","DOI":"10.1109\/ACSAC.2006.17"},{"key":"11_CR2","unstructured":"Crosby, S., Wallach, D.: Denial of Service via Algorithmic Complexity Attacks. In: Proceedings of USENIX Security Symposium (2003)"},{"key":"11_CR3","doi-asserted-by":"crossref","unstructured":"Kumar, S., Turner, J., Crowley, P.: Peacock Hash: Fast and Updatable Hashing for High Performance Packet Processing Algorithms. In: Proceedings of IEEE INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2007.29"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"Pagh, R., Rodler, F.: Cuckoo Hashing. Journal of Algorithms (2001)","DOI":"10.7146\/brics.v8i32.21692"},{"key":"11_CR5","unstructured":"Mitzenmacher, M., Broder, A.: Using Multiple Hash Functions to Improve IP Lookups. In: Proceedings of IEEE INFOCOM (2000)"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Song, H., Dharmapurikar, S., Turner, J., Lockwood, J.: Fast Hash Table Lookup Using Extended Bloom Filter: An Aid to Network Processing. In: Proceedings of ACM SIGCOMM (2005)","DOI":"10.1145\/1080091.1080114"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Waldvogel, M., Varghese, G., Turner, J., Plattner, B.: Scalable High Speed IP Routing Lookups. In: Proceedings of ACM SIGCOMM (1997)","DOI":"10.1145\/263105.263136"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Thinh, T., Kittitornkun, S.: Massively Parallel Cuckoo Pattern Matching Applied for NIDS\/NIPS. In: Proceedings of IEEE DELTA (2010)","DOI":"10.1109\/DELTA.2010.46"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Kirsch, A., Mitzenmacher, M., Varghese, G.: Hash-Based Techniques for High-Speed Packet Processing. Algorithms for Next Generation Networks. Springer (2010)","DOI":"10.1007\/978-1-84882-765-3_9"},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"Ben-Porat, U., Bremler-Barr, A., Levy, H.: Evaluating the Vulnerability of Network Mechanisms to Sophisticated DDoS Attacks. In: Proceedings of IEEE INFOCOM (2008)","DOI":"10.1109\/INFOCOM.2007.298"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"Ben-Porat, U., Bremler-Barr, A., Levy, H., Plattner, B.: On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks. Technical Report (2011), \n                    \n                      http:\/\/www.faculty.idc.ac.il\/bremler\/","DOI":"10.1007\/978-3-642-30045-5_11"},{"key":"11_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/978-3-540-87744-8_51","volume-title":"Algorithms - ESA 2008","author":"A. Kirsch","year":"2008","unstructured":"Kirsch, A., Mitzenmacher, M., Wieder, U.: More Robust Hashing: Cuckoo Hashing with a Stash. In: Halperin, D., Mehlhorn, K. (eds.) ESA 2008. LNCS, vol.\u00a05193, pp. 611\u2013622. Springer, Heidelberg (2008)"},{"key":"11_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"271","DOI":"10.1007\/3-540-36494-3_25","volume-title":"STACS 2003","author":"D. Fotakis","year":"2003","unstructured":"Fotakis, D., Pagh, R., Sanders, P., Spirakis, P.: Space Efficient Hash Tables with Worst Case Constant Access Time. In: Alt, H., Habib, M. (eds.) STACS 2003. LNCS, vol.\u00a02607, pp. 271\u2013282. Springer, Heidelberg (2003)"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"490","DOI":"10.1007\/978-3-642-03685-9_37","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"A. Frieze","year":"2009","unstructured":"Frieze, A., Melsted, P., Mitzenmacher, M.: An Analysis of Random-Walk Cuckoo Hashing. In: Dinur, I., Jansen, K., Naor, J., Rolim, J. (eds.) APPROX and RANDOM 2009. LNCS, vol.\u00a05687, pp. 490\u2013503. Springer, Heidelberg (2009)"},{"issue":"6","key":"11_CR15","doi-asserted-by":"publisher","first-page":"1752","DOI":"10.1109\/TNET.2010.2047868","volume":"18","author":"A. Kirsch","year":"2010","unstructured":"Kirsch, A., Mitzenmacher, M.: The Power of One Move: Hashing Schemes for Hardware. IEEE\/ACM Transactions on Networking\u00a018(6), 1752\u20131765 (2010)","journal-title":"IEEE\/ACM Transactions on Networking"},{"key":"11_CR16","doi-asserted-by":"crossref","unstructured":"Estan, C., Keys, K., Moore, D., Varghese, G.: Building a Better NetFlow. In: Proceedings of ACM SIGCOMM (2004)","DOI":"10.1145\/1015467.1015495"}],"container-title":["Lecture Notes in Computer Science","NETWORKING 2012"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30045-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T20:39:58Z","timestamp":1558298398000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-30045-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642300448","9783642300455"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30045-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}