Skip to main content
SpringerLink
Log in

An Efficient Information Flow Analysis of Recursive Programs Based on a Lattice Model of Security Classes

  • Conference paper
  • First Online:
Information and Communications Security (ICICS 2001)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2229))

Included in the following conference series:

  • 591 Accesses

Abstract

We present an efficient method for analyzing information flow of a recursive program. In our method, security levels of data can be formalized as an arbitrary finite lattice.We prove the correctness of the proposed algorithm and also show that the algorithm can be executed in cubic time in the size of a program. Furthermore, the algorithm is extended so that operations which hide information of their arguments can be appropriately modeled by using a congruence relation. Experimental results by using a protypic system are also presented.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Banâtre, C. Bryce and D. Le Métayer: Compile-time detection of information flow in sequential programs, 3rd ESORICS, LNCS 875, 55–73, 1994.

    Google Scholar 

  2. D. E. Denning: A lattice model of secure information flow, Communications of the ACM, 19(5), 236–243, 1976.

    Article  MATH  MathSciNet  Google Scholar 

  3. D. E. Denning and P. J. Denning: Certification of programs for secure information flow, Communications of the ACM, 20(7), 504–513, 1977.

    Article  MATH  Google Scholar 

  4. N. Heintze and J. G. Riecke: The SLam calculus: Programming with secrecy and integrity, 25thACMSymp. on Principles of Programming Languages, 365–377, 1998.

    Google Scholar 

  5. T. Jensen, D. Le Métayer and T. Thorn: Verification of control flow based security properties, 1999 IEEE Symp. on Security and Privacy, 89–103, 1999.

    Google Scholar 

  6. X. Leroy and F. Rouaix: Security properties of typed appletes, 25th ACM Symp. on Principles of Programming Languages, 391–403, 1998.

    Google Scholar 

  7. J. Mitchell: Foundations of Programming Languages, The MIT Press, 1996.

    Google Scholar 

  8. A. C. Myers: JFLOW: Practical mostly-static information flow control, 26th ACM Symp. on Principles of Progmming Languages, 228–241, 1999.

    Google Scholar 

  9. A. C. Myers and B. Liskov: Complete, safe information flowwith decentralized labels, 1998 IEEE Symp. on Security and Privacy, 186–197.

    Google Scholar 

  10. N. Nitta, Y. Takata and H. Seki: Security verification of programs with stack inspection, 6th ACM Symp. on Access Control Models and Technologies, 31–40, 2001.

    Google Scholar 

  11. P. Ørbæk: Can you trust your data? TAPSOFT’95, LNCS 915, 575–589.

    Google Scholar 

  12. G. Smith and D. Volpano: Secure information flow in a muti-threaded imperative language, 25th ACM Symp. on Principles of Programming Languages, 355–364, 1998.

    Google Scholar 

  13. D. Volpano and G. Smith:A type-based approach to program security, TAPSOFT’97, LNCS 1214, 607–621.

    Google Scholar 

  14. R. Yokomori: Security analysis algorithm for object-oriented programs, Master’s Thesis, Osaka University, 2001.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Graduate School of Information Science, Nara Institute of Science and Technology, 8916-5 Takayama , Ikoma, 630-1010, Nara, Japan

    Shigeta Kuninobu, Yoshiaki Takata & Hiroyuki Seki

  2. Graduate School of Engineering Science, Osaka University, 1-3 Machikaneyama, Toyonaka, 560-8531, Osaka, Japan

    Katsuro Inoue

Authors
  1. Shigeta Kuninobu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yoshiaki Takata
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hiroyuki Seki
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Katsuro Inoue
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Engineering Research Center for Information Security Technology (ERCIST), Chinese Academy of Sciences, P.O. Box 8718, 100080, Beijing, China

    Sihan Qing

  2. NTT Labs, 1-1 Hikarinooka, 239-0847, Yokosuka-shi, Japan

    Tatsuaki Okamoto

  3. Oracle Corporation, 500 Oracle Parkway, 94065, Redwood Shores, CA, USA

    Jianying Zhou

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kuninobu, S., Takata, Y., Seki, H., Inoue, K. (2001). An Efficient Information Flow Analysis of Recursive Programs Based on a Lattice Model of Security Classes. In: Qing, S., Okamoto, T., Zhou, J. (eds) Information and Communications Security. ICICS 2001. Lecture Notes in Computer Science, vol 2229. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45600-7_33

Download citation

  • DOI: https://doi.org/10.1007/3-540-45600-7_33

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42880-0

  • Online ISBN: 978-3-540-45600-1

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation