article

Arrows for secure information flow

Authors:

Steve ZdancewicAuthors Info & Claims

Theoretical Computer Science, Volume 411, Issue 19

Pages 1974 - 1994

Published: 01 April 2010 Publication History

Abstract

This paper presents an embedded security sublanguage for enforcing information-flow policies in the standard Haskell programming language. The sublanguage provides useful information-flow control mechanisms including dynamic security lattices, run-time code privileges and declassification all without modifying the base language. This design avoids the redundant work of producing new languages, lowers the threshold for adopting security-typed languages, and also provides great flexibility and modularity for using security-policy frameworks. The embedded security sublanguage is designed using a standard combinator interface called arrows. Computations constructed in the sublanguage have static and explicit control-flow components, making it possible to implement information-flow control using static-analysis techniques at run time, while providing strong security guarantees. This paper presents a formal proof that our embedded sublanguage provides noninterference, a concrete Haskell implementation and an example application demonstrating the proposed techniques.

References

[1]

M. Abadi, A. Banerjee, N. Heintze, J. Riecke, A core calculus of dependency, in: Proc. 26th ACM Symp. on Principles of Programming Languages, POPL, San Antonio, TX, 1999, pp. 147-160.

Digital Library

[2]

Chapman, R. and Hilton, A., Enforcing security and safety models with an information flow analysis tool. ACM SIGAda Ada Letters. vXXIV i4. 39-46.

[3]

Hughes, J., Generalising monads to arrows. Science of Computer Programming. v37. 67-111.

[4]

P. Li, S. Zdancewic, Encoding information flow in Haskell, in: Proceedings of the 19th IEEE Computer Security Foundations Workshop, CSFW¿06, 2006.

[5]

S. Liang, P. Hudak, M. Jones, Monad transformers and modular interpreters, in: Proceedings of the 22nd ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 1995, pp. 333-343.

[6]

A.C. Myers, JFlow: Practical mostly-static information flow control, in: Proc. 26th ACM Symp. on Principles of Programming Languages, POPL, San Antonio, TX, 1999, pp. 228-241.

[7]

Myers, A.C. and Liskov, B., Protecting privacy using the decentralized label model. ACM Transactions on Software Engineering and Methodology. v9 i4. 410-442.

[8]

A.C. Myers, N. Nystrom, L. Zheng, S. Zdancewic, Jif: Java information flow, software release. Located at http://www.cs.cornell.edu/jif, 2001.

[9]

Paterson, R., A new notation for arrows. In: International Conference on Functional Programming, ACM Press. pp. 229-240.

[10]

Paterson, R., Arrows and computation. In: Gibbons, J., de Moor, O. (Eds.), The Fun of Programming, Palgrave. pp. 201-222.

[11]

S. Peyton Jones, L. Augustsson, D. Barton, Haskell 98 language and libraries (the revised report), 2002. http://www.haskell.org/report.

[12]

F. Pottier, V. Simonet, Information flow inference for ML, in: Proc. 29th ACM Symp. on Principles of Programming Languages, POPL, Portland, OR, 2002.

Digital Library

[13]

Sabelfeld, A. and Myers, A.C., Language-based information-flow security. IEEE Journal on Selected Areas in Communications. v21 i1. 5-19.

[14]

A. Sabelfeld, D. Sands, Dimensions and principles of declassification, in: Proceedings of the 18th IEEE Computer Security Foundations Workshop, CSFW-05, 2005, pp. 255-269.

[15]

V. Simonet, Flow Caml in a nutshell. in: Hutton, G. (Ed.), Proceedings of the first APPSEM-II Workshop, Nottingham, United Kingdom, 2003, pp. 152-165.

[16]

S. Tse, S. Zdancewic, Run-time principals in information-flow type systems, in: Proc. IEEE Symposium on Security and Privacy, 2004.

[17]

S. Tse, S. Zdancewic, Translating dependency into parametricity, in: ACM International Conference on Functional Programming, 2004.

[18]

P. Wadler, Monads for functional programming, in: Proceedings of the Marktoberdorf Summer School on Program Design Calculi, 1992.

[19]

L. Zheng, A.C. Myers, Dynamic security labels and noninterference, in: Proceedings of the Second Workshop on Formal Aspects in Security and Trust, FAST2004, 2004.

Cited By

Lobo-Vesga ERusso AGaboardi M(2021)A Programming Language for Data Privacy with Accuracy EstimationsACM Transactions on Programming Languages and Systems10.1145/345209643:2(1-42)Online publication date: 8-Jun-2021
https://dl.acm.org/doi/10.1145/3452096
Parker JVazou NHicks M(2019)LWeb: information flow security for multi-tier web applicationsProceedings of the ACM on Programming Languages10.1145/32903883:POPL(1-30)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290388
Schmitz TAlgehed MFlanagan CRusso ALie DMannan MBackes MWang X(2018)Faceted Secure Multi ExecutionProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security10.1145/3243734.3243806(1617-1634)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3243734.3243806
Show More Cited By

Arrows for secure information flow
1. Security and privacy
  1. Systems security

Recommendations

Layout-sensitive language extensibility with SugarHaskell
Haskell '12: Proceedings of the 2012 Haskell Symposium

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
Layout-sensitive language extensibility with SugarHaskell
Haskell '12

Programmers need convenient syntax to write elegant and concise programs. Consequently, the Haskell standard provides syntactic sugar for some scenarios (e.g., do notation for monadic code), authors of Haskell compilers provide syntactic sugar for more ...
LWeb: information flow security for multi-tier web applications

This paper presents LWeb, a framework for enforcing label-based, information flow policies in database-using web applications. In a nutshell, LWeb marries the LIO Haskell IFC enforcement library with the Yesod web programming framework. The ...

Comments

Information & Contributors

Information

Published In

cover image Theoretical Computer Science

Theoretical Computer Science Volume 411, Issue 19

April, 2010

96 pages

ISSN:0304-3975

Issue’s Table of Contents

Copyright © Elsevier B.V. © 2010.

Publisher

Elsevier Science Publishers Ltd.

United Kingdom

Publication History

Published: 01 April 2010

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

17
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 16 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

Lobo-Vesga ERusso AGaboardi M(2021)A Programming Language for Data Privacy with Accuracy EstimationsACM Transactions on Programming Languages and Systems10.1145/345209643:2(1-42)Online publication date: 8-Jun-2021
https://dl.acm.org/doi/10.1145/3452096
Parker JVazou NHicks M(2019)LWeb: information flow security for multi-tier web applicationsProceedings of the ACM on Programming Languages10.1145/32903883:POPL(1-30)Online publication date: 2-Jan-2019
https://dl.acm.org/doi/10.1145/3290388
Schmitz TAlgehed MFlanagan CRusso ALie DMannan MBackes MWang X(2018)Faceted Secure Multi ExecutionProceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security10.1145/3243734.3243806(1617-1634)Online publication date: 15-Oct-2018
https://dl.acm.org/doi/10.1145/3243734.3243806
Broberg Nvan Delft BSands DMurray TSabelfeld ABauer L(2017)Paragon – Practical programming with information flow controlJournal of Computer Security10.3233/JCS-1579125:4-5(323-365)Online publication date: 1-Jan-2017
https://dl.acm.org/doi/10.3233/JCS-15791
Vassena MRusso AMurray TStefan D(2016)On Formalizing Information-Flow Control LibrariesProceedings of the 2016 ACM Workshop on Programming Languages and Analysis for Security10.1145/2993600.2993608(15-28)Online publication date: 24-Oct-2016
https://dl.acm.org/doi/10.1145/2993600.2993608
Heule SStefan DYang EMitchell JRusso A(2015)IFC InsideProceedings of the 4th International Conference on Principles of Security and Trust - Volume 903610.1007/978-3-662-46666-7_2(11-31)Online publication date: 11-Apr-2015
https://dl.acm.org/doi/10.1007/978-3-662-46666-7_2
Larmuseau APatrignani MClarke D(2015)A High-Level Model for an Assembly Language Attacker by Means of ReflectionProceedings of the First International Symposium on Dependable Software Engineering: Theories, Tools, and Applications - Volume 940910.1007/978-3-319-25942-0_11(168-182)Online publication date: 4-Nov-2015
https://dl.acm.org/doi/10.1007/978-3-319-25942-0_11
Hassan DSabry ALazarus RKfoury ABeal J(2013)Encoding secure information flow with restricted delegation and revocation in HaskellProceedings of the 1st annual workshop on Functional programming concepts in domain-specific languages10.1145/2505351.2505354(11-18)Online publication date: 22-Sep-2013
https://dl.acm.org/doi/10.1145/2505351.2505354
Nanevski ABanerjee AGarg D(2013)Dependent Type Theory for Verification of Information Flow and Access Control PoliciesACM Transactions on Programming Languages and Systems10.1145/2491522.249152335:2(1-41)Online publication date: 1-Jul-2013
https://dl.acm.org/doi/10.1145/2491522.2491523
Buiras PLevy AStefan DRusso AMazières D(2013)A Library for Removing Cache-Based Attacks in Concurrent Information Flow Systems8th International Symposium on Trustworthy Global Computing - Volume 835810.1007/978-3-319-05119-2_12(199-216)Online publication date: 30-Aug-2013
https://dl.acm.org/doi/10.1007/978-3-319-05119-2_12
Show More Cited By

View Options

View options

Media

Figures

Other

Tables

View Issue’s Table of Contents