Space/time trade-offs in hash coding with allowable errors, Communications of the ACM, vol.13, issue.7, pp.422-426, 1970. ,
DOI : 10.1145/362686.362692
Denial of Service via Algorithmic Complexity Attacks, USENIX Security Symposium, pp.3-3, 2003. ,
Introduction to Algorithms, 2009. ,
SMHasher -Test your hash functions, 2010. ,
A Hash Function for Hash Table Lookup, 1996. ,
SipHash: A Fast Short-Input PRF, Progress in Cryptology -INDOCRYPT 2012, pp.489-508, 2012. ,
DOI : 10.1007/978-3-642-34931-7_28
Recommendation for Applications Using Approved Hash Algorithms National Institute of Standards & Technology, 2012. ,
Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, 2005. ,
DOI : 10.1080/15427951.2004.10129096
Summary cache: a scalable wide-area Web cache sharing protocol, IEEE/ACM Transactions on Networking, vol.8, issue.3, pp.281-293, 2000. ,
DOI : 10.1109/90.851975
Informed content delivery across adaptive overlay networks, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication -ACM SIGCOMM 2002, pp.47-60, 2002. ,
Secure Indexes Cryptology ePrint Archive, Report, vol.216216, 2003. ,
When private set intersection meets big data, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, 2013. ,
DOI : 10.1145/2508859.2516701
URL : http://strathprints.strath.ac.uk/44686/1/https_eprint.iacr.org_2013_515.pdf
On the false-positive rate of Bloom filters, Information Processing Letters, vol.108, issue.4, pp.210-213, 2008. ,
DOI : 10.1016/j.ipl.2008.05.018
False negative problem of counting bloom filter Knowledge and Data Engineering, IEEE Transactions on, vol.22, issue.5, pp.651-664, 2010. ,
Web Crawling, Foundations and Trends?? in Information Retrieval, vol.4, issue.3, pp.175-246, 2010. ,
DOI : 10.1561/1500000017
Stranger danger, Proceedings of the 23rd international conference on World wide web, WWW '14, pp.51-62, 2014. ,
DOI : 10.1145/2566486.2567983
bit.ly/can-do-better, poster presented at Security Privacy Symposium -SPS 2014, 2014. ,
Scalable Bloom Filters, Information Processing Letters, vol.101, issue.6, pp.255-261, 2007. ,
DOI : 10.1016/j.ipl.2006.10.007
Less hashing, same performance: Building a better Bloom filter, Random Structures and Algorithms, vol.32, issue.2, pp.187-218, 2008. ,
DOI : 10.1002/rsa.20208
Squid: The Definitive Guide . O'Reilly Media, 2004. ,
Cache digests, Computer Networks and ISDN Systems, pp.22-23, 1998. ,
DOI : 10.1016/S0169-7552(98)00251-7
Universal classes of hash functions (Extended Abstract), Proceedings of the ninth annual ACM symposium on Theory of computing , STOC '77, pp.106-112, 1977. ,
DOI : 10.1145/800105.803400
Designing and Attacking Port Scan Detection Tools Phrack Magazine, p.13, 1998. ,
Remote Algorithmic Complexity Attacks against Randomized Hash Tables, International Conference on Security and Cryptography -SECRYPT 2007, pp.117-124, 2007. ,
DOI : 10.1016/S1389-1286(99)00112-7
Multiple implementations denial-of-service via hash algorithm collision Open Source Computer Security Incident Response Team, Tech. Rep. oCERT advisory, pp.2011-2014, 2011. ,
On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks, Networking Lecture Notes in Computer Science, vol.7289, issue.1, pp.135-148, 2012. ,
DOI : 10.1007/978-3-642-30045-5_11
A killer adversary for quicksort, Software: Practice and Experience, vol.23, issue.4, pp.341-344, 1999. ,
DOI : 10.1002/(SICI)1097-024X(19990410)29:4<341::AID-SPE237>3.0.CO;2-R
Data Structures with Unpredictable Timing, European Symposium on Research in Computer Security -ESORICS 2009, pp.456-471, 2009. ,
DOI : 10.1214/aoms/1177692631
Adversarial machine learning, Proceedings of the 4th ACM workshop on Security and artificial intelligence, AISec '11, pp.43-58, 2011. ,
DOI : 10.1145/2046684.2046692
Denial of Service through Regular Expressions, USENIX Security Symposium: Work-In-Progress Reports, p.1, 2003. ,
Tolerating Overload Attacks Against Packet Capturing Systems, USENIX Annual Technical Conference, pp.197-202, 2012. ,
Exploiting Unix File-System Races via Algorithmic Complexity Attacks, 2009 30th IEEE Symposium on Security and Privacy, pp.27-41, 2009. ,
DOI : 10.1109/SP.2009.10
A taxonomy of DDoS attack and DDoS defense mechanisms, ACM SIGCOMM Computer Communication Review, vol.34, issue.2, pp.39-53, 2004. ,
DOI : 10.1145/997150.997156
A Covert Timing Channel via Algorithmic Complexity Attacks: Design and Analysis, 2011 IEEE International Conference on Communications (ICC), pp.1-5, 2011. ,
DOI : 10.1109/icc.2011.5962718
New streaming algorithms for fast detection of superspreaders, Network and Distributed System Security Symposium, NDSS 2005, 2005. ,
Path-quality monitoring in the presence of adversaries, International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS 2008, pp.193-204, 2008. ,
Cryptographically Secure Bloom-Filters, Transactions on Data Privacy, vol.2, issue.2, pp.131-139, 2009. ,
Privacy-Enhanced Searches Using Encrypted Bloom Filters, DIMACS/PORTIA Workshop on Privacy-Preserving Data Mining, pp.274-285, 2004. ,
Public-Key Encrypted Bloom Filters with Applications to Supply Chain Integrity, Data and Applications Security and Privacy XXV -25th Annual IFIP WG 11.3 Conference, pp.60-75, 2011. ,
DOI : 10.1007/978-3-642-22348-8_7
BloomCasting: Security in Bloom Filter Based Multicast, Nordic Conference on Secure IT Systems, pp.1-16, 2010. ,
DOI : 10.1145/1151659.1159917
Fast Accumulated Hashing, " in Fast Software Encryption -FSE 1996, ser, Lecture Notes in Computer Science, vol.1039, 1996. ,
Naming Things with Hashes, 2013. ,
DOI : 10.17487/rfc6920
Using the Power of Two Choices to Improve Bloom Filters, Internet Mathematics, vol.4, issue.1, pp.17-33, 2007. ,
DOI : 10.1080/15427951.2007.10129136
Theory and practice of probabilistic counting algorithms (abstract of invited talk), Workshop on Analytic Algorithmics and Combinatorics -ANALC 2004, p.152, 2004. ,
Inovallée 655 avenue de l'Europe Montbonnot 38334 Saint Ismier Cedex Publisher Inria Domaine de Voluceau -Rocquencourt BP 105 -78153 Le Chesnay Cedex inria, pp.249-6399 ,