J. Aumasson and D. J. Bernstein, SipHash: A Fast Short-Input PRF, Progress in Cryptology -INDOCRYPT 2012, pp.489-508, 2012.
DOI : 10.1007/978-3-642-34931-7_28

URL : http://cr.yp.to/siphash/siphash-20120918.pdf

P. Sérgio-almeida, C. Baquero, N. M. Preguiça, and D. Hutchison, Scalable Bloom Filters, Information Processing Letters, vol.101, issue.6, pp.255-261, 2007.
DOI : 10.1016/j.ipl.2006.10.007

[. Achara, M. Cunche, V. Roca, and A. Francillon, Short paper, Proceedings of the 2014 ACM conference on Security and privacy in wireless & mobile networks, WiSec '14, pp.231-236, 2014.
DOI : 10.1145/2627393.2627399

URL : https://hal.archives-ouvertes.fr/hal-00997716

[. Akhawe and A. P. Felt, Alice in warningland: A largescale field study of browser security warning effectiveness, Proceedings of the 22th USENIX Security Symposium, pp.257-272, 2013.

[. Almuhimedi, A. P. Felt, R. W. Reeder, and S. Consolvo, Your reputation precedes you: History, reputation, and the chrome malware warning, Tenth Symposium on Usable Privacy and Security , SOUPS 2014, pp.113-128, 2014.

S. Mohammad-alaggan, A. Gambs, and . Kermarrec, BLIP: Non-interactive Differentially-Private Similarity Computation on Bloom filters, Stabilization, Safety, and Security of Distributed Systems -14th International Symposium, SSS 2012. Proceedings, pp.202-216, 2012.

S. Mohammad-alaggan, S. Gambs, M. Matwin, and . Tuhin, Sanitization of Call Detail Records via Differentially-Private Bloom Filter, Data and Applications Security and Privacy XXIX -29th Annual IFIP WG 11.3 Working Conference Proceedings, pp.223-230, 2015.

A. Arasu and G. Singh-manku, Approximate counts and quantiles over sliding windows, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04
DOI : 10.1145/1055558.1055598

R. Antonakakis, D. Perdisci, W. Dagon, N. Lee, and . Feamster, Building a Dynamic Reputation System for DNS, 19th USENIX Security Symposium Proceedings, pp.273-290, 2010.

A. Appleby, smhasher -Test your hash functions, 2010.

A. Back, Hashcash -A Denial of Service Counter-Measure, 2002.

D. Brumley and D. Boneh, Remote timing attacks are practical, Proceedings of the 12th USENIX Security Symposium, 2003.
DOI : 10.1016/j.comnet.2005.01.010

URL : http://crypto.stanford.edu/~dabo/papers/ssl-timing.ps

[. Breitinger, H. Baier, and J. Beckingham, Security and implementation analysis of the similarity digest sdhash, First International Baltic Conference on Network Security & Forensics, p.2012

S. Bellovin and W. R. Cheswick, Privacy-Enhanced Searches Using Encrypted Bloom Filters, DIMACS/PORTIA Workshop on Privacy- Preserving Data Mining, pp.274-285, 2004.

[. Bu, J. Cao, A. Chen, and P. P. Lee, A Fast and Compact Method for Unveiling Significant Patterns in High Speed Networks, IEEE INFOCOM 2007, 26th IEEE International Conference on Computer Communications, pp.6-12, 2007.
DOI : 10.1109/INFCOM.2007.220

A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher, Min-Wise Independent Permutations, Journal of Computer and System Sciences, vol.60, issue.3, pp.327-336, 1998.
DOI : 10.1006/jcss.1999.1690

URL : https://doi.org/10.1006/jcss.1999.1690

J. W. Byers, J. Considine, M. Mitzenmacher, and S. Rost, Informed content delivery across adaptive overlay networks, Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication -ACM SIGCOMM 2002, pp.47-60, 2002.
DOI : 10.1145/633025.633031

URL : http://www.eecs.harvard.edu/~michaelm/CS222/informed.pdf

]. Bose, H. Guo, E. Kranakis, A. Maheshwari, P. Morin et al., 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

R. [. Berners-lee, L. Fielding, R. Masinter, and . Editor, Uniform Resource Identifier (URI): Generic Syntax, 2005.
DOI : 10.17487/rfc3986

L. [. Berners-lee, M. Masinter, and . Mccahill, Uniform Resource Locators (URL) RFC 1738, RFC Editor, 1994.
DOI : 10.17487/rfc1738

URL : http://ietfreport.isoc.org/rfc/PDF/rfc-pdf/rfc1738.pdf

H. Burton and . Bloom, Space/Time Trade-offs in Hash Coding with Allowable Errors, Commun. ACM, vol.13, issue.7, pp.422-426, 1970.

A. Broder and M. Mitzenmacher, Network Applications of Bloom Filters: A Survey, Internet Mathematics, vol.1, issue.4, 2005.
DOI : 10.1080/15427951.2004.10129096

D. Bongard, De-anonymizing Users of French Political Forums, 2013.

[. Ben-porat, A. Bremler-barr, H. Levy, and B. Plattner, On the Vulnerability of Hardware Hash Tables to Sophisticated Attacks, Lecture Notes in Computer Science, vol.1, issue.7289, pp.135-148, 2012.
DOI : 10.1007/978-3-642-30045-5_11

URL : https://hal.archives-ouvertes.fr/hal-01531139

D. Bethea and M. K. Reiter, Data Structures with Unpredictable Timing, ESORICS, pp.456-471, 2009.
DOI : 10.1214/aoms/1177692631

URL : http://www.cs.unc.edu/~reiter/papers/2009/ESORICS.pdf

[. Brumley and N. Tuveri, Remote Timing Attacks Are Still Practical, Computer Security -ESORICS 2011 -16th European Symposium on Research in Computer Security Proceedings, pp.355-371, 2011.
DOI : 10.1007/BF02579403

URL : http://eprint.iacr.org/2011/232.pdf

L. Mathieu-cunche, A. Demir, C. Kumar, and . Lauradoux, The Pitfalls of Hashing for Privacy, 2016.

L. Carter, R. Floyd, J. Gill, G. Markowsky, and M. Wegman, Exact and approximate membership testers, Proceedings of the tenth annual ACM symposium on Theory of computing , STOC '78, pp.59-65, 1978.
DOI : 10.1145/800133.804332

[. Cai, Y. Gui, and R. Johnson, 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

URL : http://www.cs.sunysb.edu/~rob/papers/races2.pdf

B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan, Private Information Retrieval, Annual Symposium on Foundations of Computer Science, FOCS 1995, 1995.

B. Chor, N. Gilboa, and M. Naor, Private information retrieval by keywords, 1998.

D. Chaum, Blind Signatures for Untraceable Payments, Advances in Cryptology: Proceedings of CRYPTO '82, pp.199-203, 1982.
DOI : 10.1007/978-1-4757-0602-4_18

Y. Chang, Single Database Private Information Retrieval with Logarithmic Communication, Information Security and Privacy, 2004.
DOI : 10.1007/978-3-540-27800-9_5

URL : http://eprint.iacr.org/2004/036.ps.gz

A. Chen, Y. Jin, and J. Cao, Tracking Long Duration Flows in Network Traffic, 2010 Proceedings IEEE INFOCOM, pp.206-210, 2010.
DOI : 10.1109/INFCOM.2010.5462244

URL : http://www-users.cs.umn.edu/~yjin/papers/infocommini10.pdf

J. Bernard-chazelle, R. Kilian, A. Rubinfeld, and . Tal, The Bloomier Filter: An Efficient Data Structure for Static Support Lookup Tables, Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA '04, pp.30-39, 2004.

M. Cova, C. Kruegel, and G. Vigna, Detection and analysis of drive-by-download attacks and malicious JavaScript code, Proceedings of the 19th international conference on World wide web, WWW '10, pp.281-290, 2010.
DOI : 10.1145/1772690.1772720

H. Thomas, C. E. Cormen, R. L. Leiserson, C. Rivest, and . Stein, Introduction to Algorithms, Third Edition, 2009.

S. Cohen and Y. Matias, Spectral bloom filters, Proceedings of the 2003 ACM SIGMOD international conference on on Management of data , SIGMOD '03, pp.241-252, 2003.
DOI : 10.1145/872757.872787

G. Cormode and S. Muthukrishnan, An improved data stream summary: the count-min sketch and its applications, Journal of Algorithms, vol.55, issue.1, pp.58-75, 2005.
DOI : 10.1016/j.jalgor.2003.12.001

URL : http://dimacs.rutgers.edu/~graham/pubs/papers/cm-latin.pdf

S. Cms99-]-christian-cachin, M. Micali, and . Stadler, Computationally Private Information Retrieval with Polylogarithmic Communication, Advances in Cryptology? EUROCRYPT '99Com15] Common Crawl. Online, 1999.

A. Scott and . Crosby, Denial of Service through Regular Expressions, USENIX Security Symposium: Work-In-Progress Reports, 2003.

L. Carter and M. N. Wegman, 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

A. Scott, D. S. Crosby, and . Wallach, Denial of Service via Algorithmic Complexity Attacks, USENIX Security Symposium, pp.3-3, 2003.

[. Dang, Recommendation for Applications Using Approved Hash Algorithms, 2012.
DOI : 10.6028/nist.sp.800-107r1

A. Das, J. Bonneau, M. Caesar, N. Borisov, and X. Wang, The Tangled Web of Password Reuse, Proceedings 2014 Network and Distributed System Security Symposium, 2014.
DOI : 10.14722/ndss.2014.23357

[. Cristofaro, P. Gasti, and G. Tsudik, Fast and Private Computation of Cardinality of Set Intersection and Union, Cryptology and Network Security, 2012.
DOI : 10.1007/978-3-642-35404-5_17

E. De, C. , and G. Tsudik, Practical Private Set Intersection Protocols with Linear Complexity, Proceedings of the 14th International Conference on Financial Cryptography and Data Security, 2010.

[. Cristofaro and G. Tsudik, Experimenting with Fast Private Set Intersection, Trust and Trustworthy Computing, 2012.
DOI : 10.1007/978-3-642-30921-2_4

[. Dong, L. Chen, and Z. Wen, 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 : https://strathprints.strath.ac.uk/44686/1/https_eprint.iacr.org_2013_515.pdf

]. L. Deu96 and . Deutsch, RFC 1951: DEFLATE compressed data format specification version 1.3, 1996.

[. Dwork, F. Mcsherry, K. Nissim, and A. D. Smith, Calibrating Noise to Sensitivity in Private Data Analysis, Theory of Cryptography , Third Theory of Cryptography Conference Proceedings, pp.265-284, 2006.
DOI : 10.1007/11681878_14

URL : http://repository.cmu.edu/cgi/viewcontent.cgi?article=1139&context=jpc

C. Dwork and M. Naor, Pricing via Processing or Combatting Junk Mail, Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology, CRYPTO '92, pp.139-147, 1993.
DOI : 10.1007/3-540-48071-4_10

URL : http://www.wisdom.weizmann.ac.il/~naor/PAPERS/pvp.pdf

F. Deng and D. Rafiei, Approximately detecting duplicates for streaming data using stable bloom filters, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, pp.25-36, 2006.
DOI : 10.1145/1142473.1142477

URL : http://webdocs.cs.ualberta.ca/~drafiei/papers/DupDetExt.pdf

T. Dana-dachman-soled, M. Malkin, M. Raykova, and . Yung, Efficient Robust Private Set Intersection, Applied Cryptography and Network Security, 2009.
DOI : 10.1109/SFCS.1982.38

C. Dwork, Differential Privacy, 33rd International Colloquium on Automata, Languages and Programming, pp.1-12, 2006.
DOI : 10.1007/11787006_1

S. Egelman, L. F. Cranor, and J. I. Hong, You've been warned, Proceeding of the twenty-sixth annual CHI conference on Human factors in computing systems , CHI '08, pp.1065-1074, 2008.
DOI : 10.1145/1357054.1357219

[. Elahi, G. Danezis, and I. Goldberg, PrivEx, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.1068-1079, 2014.
DOI : 10.1007/978-3-642-03356-8_8

[. Ercal-ozkaya, Routing in Random Ad-Hoc Networkds: Provably Better than Worst-case, 2008.

[. Erlingsson, V. Pihur, and A. Korolova, RAPPOR, Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, CCS '14, pp.1054-1067, 2002.
DOI : 10.1145/1806689.1806794

URL : http://arxiv.org/pdf/1407.6981

S. Egelman and S. E. Schechter, The Importance of Being Earnest [In Security Warnings], Financial Cryptography and Data Security -17th International Conference, FC 2013, pp.52-59, 2013.
DOI : 10.1007/978-3-642-39884-1_5

E. Inc and . Euclid, Analytics -Privacy Statement. Online, Accessed on 15, 2015.

L. Fan, P. Cao, J. Almeida, and A. Z. Broder, 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

[. Freudiger, E. De-cristofaro, and A. E. Brito, Controlled Data Sharing for Collaborative Predictive Blacklisting, Detection of Intrusions and Malware, and Vulnerability Assessment -12th International Conference Proceedings, pp.327-349, 2015.
DOI : 10.1007/978-3-319-20550-2_17

URL : http://arxiv.org/pdf/1502.05337

W. Feller, An Introduction to Probability Theory and Its Applications, 1968.

[. Félegyházi, C. Kreibich, and V. Paxson, On the Potential of Proactive Domain Blacklisting, LEET, 2010.

P. Flajolet, Theory and practice of probabilistic counting algorithms (abstract of invited talk), Workshop on Analytic Algorithmics and Combinatorics -ANALC 2004, 2004.

. Michaelj, K. Freedman, B. Nissim, and . Pinkas, Efficient Private Matching and Set Intersection, Advances in Cryptology -EUROCRYPT 2004, 2004.

M. Greenwald and S. Khanna, Power-conserving computation of order-statistics over sensor networks, Proceedings of the twenty-third ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems , PODS '04, pp.275-285, 2004.
DOI : 10.1145/1055558.1055597

URL : https://repository.upenn.edu/cgi/viewcontent.cgi?article=1206&context=cis_papers

[. Gerbet, A. Kumar, and C. Lauradoux, The Power of Evil Choices in Bloom Filters, 2015 45th Annual IEEE/IFIP International Conference on Dependable Systems and Networks, 2015.
DOI : 10.1109/DSN.2015.21

URL : https://hal.archives-ouvertes.fr/hal-01082158

[. Gerbet, A. Kumar, and C. Lauradoux, A Privacy Analysis of Google and Yandex Safe Browsing, 2016 46th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN), 2016.
DOI : 10.1109/DSN.2016.39

URL : https://hal.archives-ouvertes.fr/hal-01120186

D. Guo, Y. Liu, X. Li, and P. Yang, False negative problem of counting bloom filter. Knowledge and Data Engineering, IEEE Transactions on, vol.22, issue.5, pp.651-664, 2010.

[. Goh, Secure Indexes. Cryptology ePrint Archive, Report, vol.216216, 2003.

W. Solomon and . Golomb, Run-length encodings (Corresp, IEEE Transactions on Information Theory, vol.12, issue.3, 1966.

]. I. Gol07 and . Goldberg, Improving the Robustness of Private Information Retrieval, IEEE Symposium on Security and Privacy, p.7, 2007.

G. Inc, We knew the web was big, 2008.

G. Inc, Google Safe Browsing Service in Mozilla Firefox Version 3, 2012.

D. Goodin, Poorly anonymized logs reveal NYC cab drivers' detailed whereabouts, Accessed, vol.21, pp.7-16, 2014.

. Google, Google Chrome Privacy Notice. https://www.google.com/intl, 2014.

G. Inc, Safe Browsing Lookup API. https://developers.google. com/safe-browsing/lookup_guide, 2015.

C. Gentry and Z. Ramzan, Single-Database Private Information Retrieval with Constant Communication Rate, ICALP, 2005.
DOI : 10.1007/11523468_65

URL : http://cgis.cs.umd.edu/~gasarch/pir/logn.pdf

A. Gervais and R. Shokri, Adish Singla, Srdjan Capkun, and Vincent Lenders Quantifying Web-Search Privacy, ACM SIGSAC Conference on Computer and Communications Security, pp.966-977, 2014.
DOI : 10.1145/2660267.2660367

S. Goldberg, D. Xiao, E. Tromer, B. Barak, and J. Rexford, Path-quality monitoring in the presence of adversaries, International Conference on Measurement and Modeling of Computer Systems, SIGMET- RICS 2008, pp.193-204, 2008.

A. Bernardo, L. A. Huberman, and . Adamic, Internet: Growth dynamics of the World-Wide Web, Nature, vol.401, issue.6749, pp.131-131, 1999.

Y. Huang, D. Evans, and J. Katz, Private Set Intersection: Are Garbled Circuits Better than Custom Protocols, NDSS, 2012.

L. Huang, A. D. Joseph, B. Nelson, I. P. Benjamin, J. D. Rubinstein et al., 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

[. Hazay and Y. Lindell, Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries Uncovering Global Icebergs in Distributed Streams: Results and Implications, Theory of Cryptography, pp.84-110, 2008.

[. Hazay and K. Nissim, Efficient Set Operations in the Presence of Malicious Adversaries, Journal of Cryptology, vol.25, issue.3, p.2012

S. Hohenberger, . Stephena, and . Weis, Honest-Verifier Private Disjointness Testing Without Random Oracles, Privacy Enhancing Technologies, pp.277-294, 2006.
DOI : 10.1007/11957454_16

R. Jenkins, A Hash Function for Hash Table Lookup, 1996.

F. Paul, . Farrell-jr, L. Simson, D. Garfinkel, and . White, Practical applications of bloom filters to the NIST RDS and hard drive triage, Twenty-Fourth Annual Computer Security Applications Conference, pp.8-12, 2008.

R. Jones, R. Kumar, B. Pang, and A. Tomkins, "I know what you did last summer", Proceedings of the sixteenth ACM conference on Conference on information and knowledge management , CIKM '07, pp.909-914, 2007.
DOI : 10.1145/1321440.1321573

[. Jarecki and X. Liu, Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection, Theory of Cryptography, 2009.
DOI : 10.1007/3-540-46766-1_9

A. Juels and R. L. Rivest, Honeywords, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, 2013.
DOI : 10.1145/2508859.2516671

URL : http://dspace.mit.edu/bitstream/1721.1/90627/1/Rivest_Honeywords.pdf

[. Kontaxis, E. Athanasopoulos, G. Portokalidis, and A. D. Keromytis, SAuth, Proceedings of the 2013 ACM SIGSAC conference on Computer & communications security, CCS '13, 2013.
DOI : 10.1145/2508859.2516746

G. Kollios, J. W. Byers, J. Considine, M. Hadjieleftheriou, and F. Li, Robust Aggregation in Sensor Networks, IEEE Data Eng. Bull, vol.28, issue.1, pp.26-32, 2005.

P. D. Kennedy, Google's Safe Browsing Service is Killing Your Privacy. Online, 2014.

[. Kerschbaum, 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

URL : https://hal.archives-ouvertes.fr/hal-01586579

A. Kumar and C. Lauradoux, Private Password Auditing -Short Paper, Technology and Practice of Passwords -International Conference on Passwords, PASSWORDS'14, 2014.
DOI : 10.1007/978-3-319-24192-0_9

URL : https://hal.archives-ouvertes.fr/hal-01119953

A. Kumar and C. Lauradoux, A Survey of Alerting Websites: Risks and Solutions, ICT Systems Security and Privacy Protection -30th IFIP TC 11 International Conference, 2015.
DOI : 10.1007/978-3-319-18467-8_9

URL : https://hal.archives-ouvertes.fr/hal-01199703

A. Kumar, P. Lafourcade, and C. Lauradoux, Short Paper: Performances of cryptographic accumulators, 39th IEEE Conference on Local Computer Networks, pp.8-11, 2014.
DOI : 10.1109/lcn.2014.6925793

URL : http://hal.univ-grenoble-alpes.fr/docs/00/99/94/32/PDF/KLL_LCN14full.pdf

A. Kumar, C. Lauradoux, and P. Lafourcade, Bloom Filters in Adversarial Settings, 2016.

A. Kirsch and M. Mitzenmacher, Less hashing, same performance: Building a better Bloom filter. Random Struct, Algorithms, vol.33, issue.2, pp.187-218, 2008.
DOI : 10.1002/rsa.20208

URL : http://www.eecs.harvard.edu/~michaelm/postscripts/rsa2008.pdf

N. Koblitz, A. J. Menezes, R. Kushilevitz, and . Ostrovsky, Cryptocash, cryptocurrencies, and cryptocontracts. Designs, Codes and Cryptography Replication is Not Needed: Single Database, Computationally-private Information Retrieval, Proceedings of the 38th Annual Symposium on Foundations of Computer Science, 1997. [KS05] Lea Kissner and Dawn Song. Privacy-Preserving Set Operations. In Advances in Cryptology ? CRYPTO 2005, pp.87-102, 2005.
DOI : 10.1007/s10623-015-0148-5

URL : https://link.springer.com/content/pdf/10.1007%2Fs10623-015-0148-5.pdf

A. Klink and J. Wälde, Multiple Implementations Denial-of- Service via Hash Algorithm Collision, 2011.

F. Li, G. Ho, E. Kuan, Y. Niu, L. Ballard et al., Remedying Web Hijacking, Proceedings of the 25th International Conference on World Wide Web, WWW '16, pp.1009-1019, 2016.
DOI : 10.1145/2046707.2046763

[. Lipmaa, An Oblivious Transfer Protocol with Log-Squared Communication, ISC, 2005.
DOI : 10.1007/11556992_23

URL : http://eprint.iacr.org/2004/063.ps.gz

[. Lakshman and P. Malik, Cassandra, ACM SIGOPS Operating Systems Review, vol.44, issue.2, pp.35-40, 2010.
DOI : 10.1145/1773912.1773922

A. Moshchuk, T. Bragin, D. Deville, S. D. Gribble, and H. M. Levy, SpyProxy: Execution-based Detection of Malicious Web Content, Proceedings of the 16th USENIX Security Symposium, 2007.

C. Aguilar-melchor, J. Barrier, L. Fousse, and M. Killijian, XPIRe: Private Information Retrieval for Everyone, IACR Cryptology ePrint Archive, vol.2014, p.1025, 1025.

A. Moshchuk, T. Bragin, S. D. Gribble, and H. M. Levy, A Crawler-based Study of Spyware in the Web, Proceedings of the Network and Distributed System Security Symposium, NDSS 2006, 2006.

. Mcafee, McAfee Site Advisor FAQ. https://kc.mcafee.com/corporate/ index?page=content&id=KB73457, 2015.

. Mcafee, McAfee Site Advisor Live, 2015.

]. M. Mci99 and . Mcilroy, A Killer Adversary for Quicksort, Softw. Pract. Exper, vol.29, issue.4, pp.341-344, 1999.

[. Melis, G. Danezis, and E. Cristofaro, Efficient Private Statistics with Succinct Sketches, Proceedings 2016 Network and Distributed System Security Symposium, 1508.
DOI : 10.14722/ndss.2016.23175

URL : http://arxiv.org/pdf/1508.06110

A. Musa and J. Eriksson, Tracking unmodified smartphones using wi-fi monitors, Proceedings of the 10th ACM Conference on Embedded Network Sensor Systems, SenSys '12, pp.281-294
DOI : 10.1145/2426656.2426685

URL : http://www.cs.uic.edu/~jakob/papers/musa-sensys12.pdf

C. Ralph and . Merkle, A digital signature based on a conventional encryption function, A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology, CRYPTO '87, pp.369-378, 1988.

P. [. Melchor and . Gaborit, A fast private information retrieval protocol, 2008 IEEE International Symposium on Information Theory, 2008.
DOI : 10.1109/ISIT.2008.4595308

URL : https://hal.archives-ouvertes.fr/hal-00335222

. Microsoft, SmartScreen Application Reputationsmartscreen-174-application- reputation-in-ie9.aspx, 2011. [Mic11b] Microsoft. SmartScreen: Authenticode Code Signingauthenticode- code-signing-for-developers-for-file-downloads-buildingsmartscreen-application-reputation .aspx, Mic16] Microsoft. Windows Logo, 2011.

]. J. Mkd-+-02, B. Mogul, F. Krishnamurthy, A. Douglis, Y. Feldmann et al., Delta encoding in HTTP, RFC, vol.3229, 2002.

T. Meskanen, J. Liu, S. Ramezanian, and V. Niemi, Private Membership Test for Bloom Filters, 2015 IEEE Trustcom/BigDataSE/ISPA, pp.515-522, 2015.
DOI : 10.1109/Trustcom.2015.414

]. P. Moc87 and . Mockapetris, Domain names -implementation and specification, RFC 1035 (INTERNET STANDARD), pp.4034-4035, 1183.

[. Melis, A. Pyrgelis, and E. Cristofaro, Building and measuring privacy-preserving predictive blacklists, 1512.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

[. Mirkovic and P. L. Reiher, A taxonomy of DDoS attack and DDoS defense mechanisms, 48th Annual IEEE Symposium on Foundations of Computer Science, pp.39-53, 2004.
DOI : 10.1145/997150.997156

A. J. Menezes, S. A. Vanstone, and P. C. Van-oorschot, Handbook of Applied Cryptography, 1996.
DOI : 10.1201/9781439821916

S. Nakamoto, Bitcoin: A Peer-to-Peer Electronic Cash System. www. bitcoin.org, 2011.

J. Nazario, PhoneyC: A Virtual Client Honeypot, Proceedings of the 2nd USENIX Conference on Large-scale Exploits and Emergent Threats: Botnets, Spyware, Worms, and More, LEET'09, 2009.

[. Nath, P. B. Gibbons, S. Seshan, and Z. R. Anderson, Synopsis Diffusion for Robust Aggregation in Sensor Networks, TOSN, vol.4, issue.2, 2008.
DOI : 10.1145/1340771.1340773

URL : http://www.intel-research.net/Publications/Pittsburgh/101220041304_267.pdf

[. Nojima and Y. Kadobayashi, Cryptographically Secure Bloom- Filters, Transactions on Data Privacy, vol.2, issue.2, pp.131-139, 2009.

N. Nikiforakis, F. Maggi, G. Stringhini, M. Zubair-rafique, W. Joosen et al., Stranger danger, Proceedings of the 23rd international conference on World wide web, WWW '14, pp.51-62, 2014.
DOI : 10.1145/2566486.2567983

A. Narayanan and V. Shmatikov, Fast dictionary attacks on passwords using time-space tradeoff, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, 2005.
DOI : 10.1145/1102120.1102168

URL : http://www.cs.utexas.edu/~shmat/shmat_ccs05pwd.ps

M. Naor and E. Yogev, Bloom Filters in Adversarial Environments, Advances in Cryptology -CRYPTO 2015 -35th Annual Cryptology Conference Proceedings, Part II, pp.565-584, 2015.
DOI : 10.1007/978-3-662-48000-7_28

URL : http://arxiv.org/pdf/1412.8356

K. Nyberg, Fast accumulated hashing, Fast Software Encryption - FSE 1996, 1996.
DOI : 10.1007/3-540-60865-6_45

F. Olumofin and I. Goldberg, Revisiting the Computational Practicality of Private Information Retrieval, Financial Cryptography and Data Security, 2012.
DOI : 10.1109/ISIT.2006.261651

C. Olston and M. Najork, Web Crawling, on online behavioral advertising, pp.175-246, 2010.
DOI : 10.1561/1500000017

V. Paxson and . Bro, Bro: a system for detecting network intruders in real-time, Proceedings of the 7th Conference on USENIX Security Symposium -Volume 7, SSYM'98, pp.3-3, 1998.
DOI : 10.1016/S1389-1286(99)00112-7

A. Peslyak, Designing and Attacking Port Scan Detection Tools Phrack Magazine, 1998.

A. Pfitzmann and M. Köhntopp, Anonymity, Unobservability, and Pseudonymity ??? A Proposal for Terminology, In International Workshop on Design Issues in Anonymity and Unobservability Lecture Notes in Computer Science, pp.1-9, 2000.
DOI : 10.1007/3-540-44702-4_1

[. Provos, P. Mavrommatis, M. Abu-rajab, and F. Monrose, All Your iFRAMEs Point to Us, Proceedings of the 17th Conference on Security Symposium, SS'08, pp.1-15, 2008.

J. M. Pmw-+-09-]-bryan-parno, D. Mccune, D. G. Wendlandt, A. Andersen, and . Perrig, CLAMP: Practical Prevention of Large-Scale Data Leaks, IEEE Symposium on Security and Privacy, 2009.

[. Papadogiannakis, M. Polychronakis, and E. P. Markatos, Tolerating Overload Attacks Against Packet Capturing Systems, USENIX Annual Technical Conference, pp.197-202, 2012.

[. Pagh and F. F. Rodler, Cuckoo hashing, Journal of Algorithms, vol.51, issue.2, pp.122-144, 2004.
DOI : 10.1016/j.jalgor.2003.12.002

N. Bibliography and . Provos, Safe Browsing -Protecting Web Users for 5 Years and Counting, 2012.

A. Pietracaprina, M. Riondato, E. Upfal, and F. Vandin, Mining top-K frequent itemsets through progressive sampling, Data Mining and Knowledge Discovery, vol.13, issue.2, pp.310-326, 2010.
DOI : 10.1017/CBO9780511813603

URL : http://arxiv.org/pdf/1006.5235

F. Putze, P. Sanders, and J. Singler, Cache-, Hash-, and Spaceefficient Bloom Filters, J. Exp. Algorithmics, p.14, 2010.
DOI : 10.1007/978-3-540-72845-0_9

M. Raab and A. Steger, ???Balls into Bins??? ??? A Simple and Tight Analysis, Proceedings of the Second International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM '98, pp.159-170, 1998.
DOI : 10.1007/3-540-49543-6_13

A. Rousskov and D. Wessels, Cache digests, Computer Networks and ISDN Systems, pp.22-23, 1998.
DOI : 10.1016/S0169-7552(98)00251-7

M. Roughan and Y. Zhang, Secure distributed data-mining and its application to large-scale network measurements, ACM SIGCOMM Computer Communication Review, vol.36, issue.1, pp.7-14, 2006.
DOI : 10.1145/1111322.1111326

URL : http://www.cs.utexas.edu/~yzhang/papers/mining-ccr06.pdf

[. Swamidass and P. Baldi, Mathematical Correction for Fingerprint Similarity Measures to Improve Chemical Retrieval, Journal of Chemical Information and Modeling, vol.47, issue.3, pp.952-964, 2007.
DOI : 10.1021/ci600526a

[. Sion and B. Carbunar, On the Practicality of Private Information Retrieval, Proceedings of the Network and Distributed System Security Symposium ? NDSS 2007, 2007.

]. E. Sch05 and . Schultz, Denial-of-Service Attack, Handbook of Information Security, 2005.

[. Sun, L. Cheng, and Y. Zhang, 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

A. Serjantov and G. Danezis, Towards an Information Theoretic Metric for Anonymity, Privacy Enhancing Technologies, Second International Workshop, pp.41-53, 2002.
DOI : 10.1007/3-540-36467-6_4

URL : http://www.cl.cam.ac.uk/users/aas23/papers_aas/set.ps

J. Spiegel and N. Polyzotis, Graph-based synopses for relational selectivity estimation, Proceedings of the 2006 ACM SIGMOD international conference on Management of data , SIGMOD '06, pp.205-216, 2006.
DOI : 10.1145/1142473.1142497

A. Soltani, A. Peterson, and B. Gellman, NSA uses Google cookies to pinpoint targets for hacking. The Washington Post, 2013.

C. E. Särelä, A. Rothenberg, P. Zahemszky, J. Nikander, and . Ott, BloomCasting: Security in Bloom Filter Based Multicast, Nordic Conference on Secure IT Systems, pp.1-16, 2010.

J. Steube, hashcat advanced password recovery, 2016.

O. Salem, S. Vaton, and A. Gravey, A scalable, efficient and informative approach for anomaly-based intrusion detection systems: theory and practice, International Journal of Network Management, vol.3, issue.2, pp.271-293, 2010.
DOI : 10.1002/nem.748

URL : https://hal.archives-ouvertes.fr/hal-00565751

R. B. Tilley, Blackhash software, 2014.

J. Tamrakar, A. Liu, J. Paverd, B. Ekberg, N. Pinkas et al., The Circle Game, Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, ASIA CCS '17
DOI : 10.1109/SP.2015.45

[. Tobin and D. Malone, Hash pile ups: Using collisions to identify unknown hash functions, 2012 7th International Conference on Risks and Security of Internet and Systems (CRiSIS), pp.1-6, 2012.
DOI : 10.1109/CRISIS.2012.6378946

URL : http://www.maths.tcd.ie/~dwmalone/p/crisis2012.pdf

[. Tarkoma, C. E. Rothenberg, and E. Lagerspetz, Theory and Practice of Bloom Filters for Distributed Systems, IEEE Communications Surveys & Tutorials, vol.14, issue.1, pp.131-155, 2006.
DOI : 10.1109/SURV.2011.031611.00024

J. Vaidya and C. Clifton, Secure set intersection cardinality with application to association rule mining, Journal of Computer Security, vol.13, issue.4, pp.593-622, 2005.
DOI : 10.3233/JCS-2005-13401

URL : http://www.cerias.purdue.edu/ssl/techreports-ssl/2005-136.pdf

D. Veditz, Personal Communication, 2015. Security team at Mozilla Firefox

[. Bibliography, D. X. Venkataraman, P. B. Song, A. Gibbons, and . Blum, New streaming algorithms for fast detection of superspreaders, Network and Distributed System Security Symposium, NDSS 2005, 2005.

Y. Wang, D. Beck, X. Jiang, R. Roussev, C. Verbowski et al., Automated Web Patrol with Strider HoneyMonkeys: Finding Web Sites That Exploit Browser Vulnerabilities, NDSS, 2006.

D. Wessels, Squid: The Definitive Guide . O'Reilly Media, WOT15a] WOT Services Ltd. Privacy Policy, 2004.

]. Wot15b and . Ltd, Web of Trust, 2015.

W. [. Yao and . Mao, SMTP Extension for Internationalized Email, RFC, vol.6531, 2012.
DOI : 10.17487/rfc6531

[. Zyskind, O. Nathan, and A. Pentland, Enigma: Decentralized Computation Platform with Guaranteed Privacy

S. Zhang, S. Singh, N. Sen, C. Duffield, and . Lund, Online identification of hierarchical heavy hitters, Proceedings of the 4th ACM SIGCOMM conference on Internet measurement , IMC '04, pp.101-114, 2004.
DOI : 10.1145/1028788.1028802