skip to main content
10.1145/1998441.1998458acmconferencesArticle/Chapter ViewAbstractPublication PagessacmatConference Proceedingsconference-collections
research-article

Modeling data flow in socio-information networks: a risk estimation approach

Published:15 June 2011Publication History

ABSTRACT

Information leakage via the networks formed by subjects (e.g., Facebook, Twitter) and objects (e.g., blogosphere) - some of whom may be controlled by malicious insiders - often leads to unpredicted access control risks. While it may be impossible to precisely quantify information flows between two entities (e.g., two friends in a social network), this paper presents a first attempt towards leveraging recent advances in modeling socio-information networks to develop a statistical risk estimation paradigm for quantifying such insider threats. In the context of socio-information networks, our models estimate the following likelihoods: prior flow - has a subject $s$ acquired covert access to object o via the networks? posterior flow - if s is granted access to o, what is its impact on information flows between subject s' and object o'? network evolution - how will a newly created social relationship between s and s' influence current risk estimates? Our goal is not to prescribe a one-size-fits-all solution; instead we develop a set of composable network-centric risk estimation operators, with implementations configurable to concrete socio-information networks. The efficacy of our solutions is empirically evaluated using real-life datasets collected from the IBM SmallBlue project and Twitter.

References

  1. Network-centric access control: models and techniques. Georgia Tech Technical Report, GIT-CERCS-10-08, http://www.cercs.gatech.edu/tech-reports/.Google ScholarGoogle Scholar
  2. Teacher fired over Facebook sues district: http://www.cbsatlanta.com/news/21573759/detail.html.Google ScholarGoogle Scholar
  3. D. Aldous and J. A. Fill. Reversible markov chains, 1994.Google ScholarGoogle Scholar
  4. M. Backes, B. Kopf, and A. Rybalchenko. Automatic discovery and quantification of information leaks. In SP, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. D. E. Bell and L. J. LaPadula. Secure computer system: unified exposition and multics interpretation. In MITRE Corporation, 1976.Google ScholarGoogle ScholarCross RefCross Ref
  6. E. Bertino, P. A. Bonatti, and E. Ferrari. Trbac: A temporal role-based access control model. ACM Trans. Inf. Syst. Secur., 4(3):191--233, 2001. Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. D. D. F. Brewer and D. M. J. Nash. The chinese wall security policy. SP, 1989.Google ScholarGoogle Scholar
  8. B. Carminati, E. Ferrari, S. Morasca, and D. Taibi. A probability-based approach to modeling the risk of unauthorized propagation of information in on-line social networks. In CODASPY, 2011. Google ScholarGoogle ScholarDigital LibraryDigital Library
  9. J. R. Challenger, P. Dantzig, A. Iyengar, M. S. Squillante, and L. Zhang. Efficiently serving dynamic data at highly accessed web sites. IEEE/ACM Trans. Netw., 12(2):233-246, 2004. Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. P.-C. Cheng, P. Rohatgi, C. Keser, P. A. Karger, G. M. Wagner, and A. S. Reninger. Fuzzy multi-level security: An experiment on quantified risk-adaptive access control. In IEEE Security and Privacy Symposium, 2007. Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. J. Crampton. Understanding and developing role-based administrative models. In CCS, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  12. D. Easley and J. Kleinberg. Networks, Crowds, and Markets: Reasoning About a Highly Connected World. Cambridge University Press, 2010. Google ScholarGoogle ScholarDigital LibraryDigital Library
  13. J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic efficiency for network flow problems. J. ACM, 19(2):248--264, 1972. Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. D. Ferraiolo and R. Kuhn. Role-based access control. In 15th NIST-NCSC National Computer Security Conference, 1992.Google ScholarGoogle Scholar
  15. D. Fogaras, B. Racz, K. Csalogany, and T. Sarlos. Towards scaling fully personalized pagerank: Algorithms, lower bounds, and experiments. Internet Mathematics, 2(3), 2005.Google ScholarGoogle Scholar
  16. Y. Kanzaki, H. Igaki, M. Nakamura, A. Monden, and K.-i. Matsumoto. Characterizing dynamics of information leakage in security-sensitive software process. In ACSW Frontiers, 2005. Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. J. Leskovec, L. Backstrom, R. Kumar, and A. Tomkins. Microscopic evolution of social networks. In KDD, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. C.-Y. Lin, N. Cao, S. X. Liu, S. Papadimitriou, J. Sun, and X. Yan. Smallblue: Social network analysis for expertise search and collective intelligence. In ICDE, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. S. McCamant and M. D. Ernst. Quantitative information flow as network flow capacity. In PLDI, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  20. I. Molloy, P.-C. Cheng, and P. Rohatgi. Trading in risk: using markets to improve access control. In NSPW, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. H. H. Song, T. W. Cho, V. Dave, Y. Zhang, and L. Qiu. Scalable proximity estimation and link prediction in online social networks. In IMC, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  22. M. Srivatsa, D. Agrawal, and S. Reidt. A metadata calculus for secure information sharing. In CCS, 2009. Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. M. Srivatsa, P. Rohatgi, S. Balfe, and S. Reidt. Securing information flows: A metadata framework. In QoISN, 2008.Google ScholarGoogle ScholarCross RefCross Ref
  24. H. Tong, C. Faloutsos, and J.-Y. Pan. Fast random walk with restart and its applications. In ICDM, 2006. Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. N. Zeldovich, S. Boyd-Wickizer, and D. Mazieres. Securing distributed systems with information flow control. In NSDI, 2008. Google ScholarGoogle ScholarDigital LibraryDigital Library

Index Terms

  1. Modeling data flow in socio-information networks: a risk estimation approach

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        SACMAT '11: Proceedings of the 16th ACM symposium on Access control models and technologies
        June 2011
        196 pages
        ISBN:9781450306881
        DOI:10.1145/1998441

        Copyright © 2011 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 15 June 2011

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • research-article

        Acceptance Rates

        Overall Acceptance Rate177of597submissions,30%

        Upcoming Conference

        SACMAT 2024

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader