{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:45:37Z","timestamp":1772163937159,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":31,"publisher":"ACM","license":[{"start":{"date-parts":[[2007,8,27]],"date-time":"2007-08-27T00:00:00Z","timestamp":1188172800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2007,8,27]]},"DOI":"10.1145\/1282380.1282413","type":"proceedings-article","created":{"date-parts":[[2012,10,11]],"date-time":"2012-10-11T11:35:23Z","timestamp":1349955323000},"page":"289-300","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":87,"title":["Portcullis"],"prefix":"10.1145","author":[{"given":"Bryan","family":"Parno","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dan","family":"Wendlandt","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Elaine","family":"Shi","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adrian","family":"Perrig","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Maggs","sequence":"additional","affiliation":[{"name":"Carnegie Mellon University & Akamai Technologies, Pittsburgh, PA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yih-Chun","family":"Hu","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2007,8,27]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Proceedings of ISOC NDSS","author":"Abadi M.","year":"2003","unstructured":"M. Abadi , M. Burrows , M. Manasse , and T. Wobber . Moderately hard, memory-bound functions . In Proceedings of ISOC NDSS , February 2003 . M. Abadi, M. Burrows, M. Manasse, and T. Wobber. Moderately hard, memory-bound functions. In Proceedings of ISOC NDSS, February 2003."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.comcom.2003.08.021"},{"key":"e_1_3_2_1_3_1","volume-title":"Proceedings of Hotnets-II","author":"Anderson Tom","year":"2003","unstructured":"Tom Anderson , Timothy Roscoe , and David Wetherall . Preventing Internet denial-of-service with capabilities . In Proceedings of Hotnets-II , November 2003 . Tom Anderson, Timothy Roscoe, and David Wetherall. Preventing Internet denial-of-service with capabilities. In Proceedings of Hotnets-II, November 2003."},{"key":"e_1_3_2_1_4_1","volume-title":"Proceedings of Workshop on Hot Topics in Networks (HotNets-IV)","author":"Argyraki Katerina","year":"2005","unstructured":"Katerina Argyraki and David Cheriton . Network capabilities : The good, the bad and the ugly . In Proceedings of Workshop on Hot Topics in Networks (HotNets-IV) , November 2005 . Katerina Argyraki and David Cheriton. Network capabilities: The good, the bad and the ugly. In Proceedings of Workshop on Hot Topics in Networks (HotNets-IV), November 2005."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647218.720854"},{"issue":"4","key":"e_1_3_2_1_6_1","volume":"1","author":"Broder A.","year":"2005","unstructured":"A. Broder and M. Mitzenmacher . Network applications of Bloom filters: A survey. Journal of Internet Mathematics , 1 ( 4 ), 2005 . A. Broder and M. Mitzenmacher. Network applications of Bloom filters: A survey. Journal of Internet Mathematics, 1(4), 2005.","journal-title":"Journal of Internet Mathematics"},{"key":"e_1_3_2_1_7_1","unstructured":"CAIDA. Skitter. http:\/\/www.caida.org\/tools\/measurement\/skitter\/. CAIDA. Skitter. http:\/\/www.caida.org\/tools\/measurement\/skitter\/."},{"key":"e_1_3_2_1_8_1","volume-title":"http:\/\/www.cl.cam.ac.uk\/~rnc1\/ Accessed","author":"Clayton Richard","year":"2007","unstructured":"Richard Clayton . http:\/\/www.cl.cam.ac.uk\/~rnc1\/ Accessed May , 2007 . Richard Clayton. http:\/\/www.cl.cam.ac.uk\/~rnc1\/ Accessed May, 2007."},{"key":"e_1_3_2_1_9_1","unstructured":"Team Cymru. The team cymru ip to asn lookup page. http:\/\/www.cymru.com\/BGP\/asnlookup.html. Team Cymru. The team cymru ip to asn lookup page. http:\/\/www.cymru.com\/BGP\/asnlookup.html."},{"key":"e_1_3_2_1_10_1","volume-title":"Proceedings of USENIX Security Symposium","author":"Dean Drew","year":"2001","unstructured":"Drew Dean and Adam Stubblefield . Using client puzzles to protect TLS . In Proceedings of USENIX Security Symposium , 2001 . Drew Dean and Adam Stubblefield. Using client puzzles to protect TLS. In Proceedings of USENIX Security Symposium, 2001."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-45146-4_25"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.5555\/646757.705669"},{"key":"e_1_3_2_1_13_1","volume-title":"Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing. RFC","author":"Ferguson P.","year":"1998","unstructured":"P. Ferguson and D. Senie . Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing. RFC 2267, January 1998 . P. Ferguson and D. Senie. Network ingress filtering: Defeating denial of service attacks which employ IP source address spoofing. RFC 2267, January 1998."},{"key":"e_1_3_2_1_14_1","volume-title":"Proceedings of the Security Protocols Workshop","author":"Gligor V.","year":"2003","unstructured":"V. Gligor . Guaranteeing access in spite of service-flooding attacks . In Proceedings of the Security Protocols Workshop , April 2003 . V. Gligor. Guaranteeing access in spite of service-flooding attacks. In Proceedings of the Security Protocols Workshop, April 2003."},{"key":"e_1_3_2_1_15_1","volume-title":"Fast SHA-1 hash core for ASIC","author":"Limited Helion Technology","unstructured":"Helion Technology Limited . Fast SHA-1 hash core for ASIC . Cambridge , England . Available at http:\/\/www.heliontech.com\/downloads\/sha1_asic_fast_helioncore.pdf. November 2005. Helion Technology Limited. Fast SHA-1 hash core for ASIC. Cambridge, England. Available at http:\/\/www.heliontech.com\/downloads\/sha1_asic_fast_helioncore.pdf. November 2005."},{"key":"e_1_3_2_1_16_1","volume-title":"Fast SHA-1 hash core for Xilinx FPGA","author":"Limited Helion Technology","unstructured":"Helion Technology Limited . Fast SHA-1 hash core for Xilinx FPGA . Cambridge , England . Available at http:\/\/www.heliontech.com\/downloads\/sha1_xilinx_fast_helioncore.pdf. November 2005. Helion Technology Limited. Fast SHA-1 hash core for Xilinx FPGA. Cambridge, England. Available at http:\/\/www.heliontech.com\/downloads\/sha1_xilinx_fast_helioncore.pdf. November 2005."},{"key":"e_1_3_2_1_17_1","volume-title":"Proceedings of ISOC NDSS","author":"Juels A.","year":"1999","unstructured":"A. Juels and J. Brainard . Client puzzles: A cryptographic countermeasure against connection depletion attacks . In Proceedings of ISOC NDSS , 1999 . A. Juels and J. Brainard. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of ISOC NDSS, 1999."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2002.803905"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","DOI":"10.6028\/NIST.FIPS.180-1","volume-title":"Secure hash standard","author":"National Institute of Standards and Technology (NIST) Computer Systems Laboratory.","year":"1995","unstructured":"National Institute of Standards and Technology (NIST) Computer Systems Laboratory. Secure hash standard . 180-1, April 1995 . National Institute of Standards and Technology (NIST) Computer Systems Laboratory. Secure hash standard. 180-1, April 1995."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/972374.972383"},{"key":"e_1_3_2_1_21_1","volume-title":"Proceedings of WEIS","author":"Laurie Ben","year":"2004","unstructured":"Ben Laurie and Richard Clayton . \"Proof-of-work\" proves not to work . In Proceedings of WEIS , May 2004 . Ben Laurie and Richard Clayton. \"Proof-of-work\" proves not to work. In Proceedings of WEIS, May 2004."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IWQoS.2002.1006583"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028790"},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of USENIX WORLDS","author":"Poole Lindsey","year":"2006","unstructured":"Lindsey Poole and Vivek S. Pai . ConfiDNS: Leveraging scale and history to improve DNS security . In Proceedings of USENIX WORLDS , November 2006 . Lindsey Poole and Vivek S. Pai. ConfiDNS: Leveraging scale and history to improve DNS security. In Proceedings of USENIX WORLDS, November 2006."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159913.1159948"},{"key":"e_1_3_2_1_27_1","volume-title":"Proceedings of IEEE Symposium on Security and Privacy","author":"Wang X.","year":"2003","unstructured":"X. Wang and M. Reiter . Defending against denial-of-service attacks with puzzle auctions . In Proceedings of IEEE Symposium on Security and Privacy , May 2003 . X. Wang and M. Reiter. Defending against denial-of-service attacks with puzzle auctions. In Proceedings of IEEE Symposium on Security and Privacy, May 2003."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030118"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1030083.1030117"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/829515.830562"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/SECPRI.2004.1301320"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/1080091.1080120"}],"event":{"name":"SIGCOMM07: ACM SIGCOMM 2007 Conference","location":"Kyoto Japan","acronym":"SIGCOMM07","sponsor":["SIGCOMM ACM Special Interest Group on Data Communication","ACM Association for Computing Machinery"]},"container-title":["Proceedings of the 2007 conference on Applications, technologies, architectures, and protocols for computer communications"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282380.1282413","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1282380.1282413","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:13:51Z","timestamp":1750245231000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1282380.1282413"}},"subtitle":["protecting connection setup from denial-of-capability attacks"],"short-title":[],"issued":{"date-parts":[[2007,8,27]]},"references-count":31,"alternative-id":["10.1145\/1282380.1282413","10.1145\/1282380"],"URL":"https:\/\/doi.org\/10.1145\/1282380.1282413","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/1282427.1282413","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2007,8,27]]},"assertion":[{"value":"2007-08-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}