Subscribe

Issue No.03 - May-June (2013 vol.11)

pp: 85-87

Shari Lawrence Pfleeger , Dartmouth College

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MSP.2013.68

ABSTRACT

Results from number theory show us that even in seemingly random sets, we can find order; total disorder is impossible. Ramsey's theorem can help broaden our perspective in cybersecurity by showing us how to use the emergent order to find patterns and to design systems to avoid certain patterns.

INDEX TERMS

Numerical models, Random variables, Computer crime, Pattern recognition, Ramsey's theorem, Numerical models, Random variables, Computer crime, Pattern recognition, anonymization, Numerical models, Random variables, Computer crime, Pattern recognition, pattern-matching

CITATION

Shari Lawrence Pfleeger, "Ramsey theory: Learning about the needle in the haystack",

*IEEE Security & Privacy*, vol.11, no. 3, pp. 85-87, May-June 2013, doi:10.1109/MSP.2013.68REFERENCES

- 1. F.P. Ramsey, "On a Problem of Formal Logic,"
Proc. London Mathematical Soc., vol. s2-30, no. 1, 1929, pp. 264–286.- 2. B.D. McKay and S.P. Radziszowski, "R(4, 5) = 25,"
J. Graph Theory, vol. 19, May 1995, pp. 309–322.- 3. P. Erdős, "Graph Theory and Probability,"
Canadian J. Mathematics, vol. 11, 1959, pp. 34–38.- 4. M. Barbaro and T. Zeller Jr., "A Face Is Exposed for AOL Searcher No. 4417749,"
The New York Times,9 Aug. 2006; http://select.nytimes.com/gstabstract.html?res=F10612FC345B0C7A8CDDA10894DE404482. - 5. R.J. Faudree et al., "Path-Cycle Ramsey Numbers,"
Discrete Mathematics, vol. 10, 1974, pp. 269–277.- 6. V. Rosta, "Ramsey Theory Applications,"
Electronic J. Combinatorics, Dec. 2004; www.emis.ams.org/journals/EJC/Surveysds13.pdf. - 7. L. Backstrom et al., , "Wherefore Art Thou R3579X?: Anonymized Social Networks, Hidden Patterns, and Structural Steganography,"
Proc. 16th Int'l Conf. World Wide Web (WWW 07), IEEE, 2007, pp. 181–190.- 8. K. Liu et al., "Privacy-Preserving Data Analysis on Graphs and Social Networks,"
Next Generation of Data Mining, H. Kargupta et al., eds., CRC Press, 2008, pp. 419–437.- 9. J.M. Kleinberg,, "Challenges in Mining Social Network Data: Processes, Privacy and Paradoxes,"
Proc. 13th ACM SIGKDD Int'l Conf. Knowledge Discovery and Data Mining, ACM, 2007, pp. 4–5.- 10. K. Halunen et al., "Combinatorial Multicollision Attacks on Generalized Iterated Hash Functions,"
Proc. 8th Australasian Conf. Information Security, vol. 105, Australian Computer Soc., 2010, pp. 86–93.- 11. B. Cook et al., "Proving Program Termination,"
Comm. ACM, May 2011, pp. 88–98. |