Article

P-congruences as non-interference for the pi-calculus

Authors:

Sabina RossiAuthors Info & Claims

FMSE '06: Proceedings of the fourth ACM workshop on Formal methods in security

Pages 13 - 22

https://doi.org/10.1145/1180337.1180339

Published: 03 November 2006 Publication History

Abstract

We introduce a notion of noninterference for a typed version of the π-calculus where types are used to assign secrecy levels to channels. Noninterference is expressed in terms of a partial congruence(p-congruence, for short). We provide a proof technique in the form of a bisimulation-like partial equivalence relation that is a binary relation which is symmetric and transitive but not reflexive.We show that the noninterference property is compositional with respect to most of the operators of the language leading to efficient proof techniques for the verification and the construction of (compositional) secure systems.In order to allow downgrading of sensitive information, we extend the π-calculus with declassification primitives and we study a property which scales to noninterference when downgrading is not permitted.

References

[1]

A. Bossi, C. Piazza, and S. Rossi. Modelling Downgrading in Information Flow Security. In Proc. of the 17th IEEE Computer Security Foundations Workshop (CSFW'04), pages 187--201. IEEE Computer Society Press, 2004.]]

Digital Library

[2]

S. Crafa and S. Rossi. Controlling Information Release in the π-calculus. Technical Report 14, Dipartimento di Matematica Pura e Applicata, Università DI Padova, Italy, 2005. http://www.math.unipd.it/~crafa/TR-14-05. ps.gz.]]

[3]

S. Crafa and S. Rossi. A Theory of Noninterference for the π-calculus. In Proceedings of the International Symposium on Trustworthy Global Computing (TGC'05), volume 3705 of LNCS, pages 2--18. Springer-Verlag, 2005.]]

Digital Library

[4]

R. Focardi and R. Gorrieri. A Classification of Security Properties for Process Algebras. Journal of Computer Security, 3(1):5--33, 1994/1995.]]

[5]

R. Focardi and S. Rossi. Information Flow Security in Dynamic Contexts. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'02), pages 307--319. IEEE Computer Society Press, 2002.]]

Digital Library

[6]

J. A. Goguen and J. Meseguer. Security Policies and Security Models. In Proc. of the IEEE Symposium on Security and Privacy (SSP'82), pages 11--20. IEEE Computer Society Press, 1982.]]

[7]

A. D. Gordon and A. S. A. Jeffrey. Secrecy despite compromise: Types, cryptography, and the pi-calculus. In Proc. of the 16th International Conference on Concurrency Theory, (CONCUR'05), volume 3653 of LNCS, pages 186--201. Springer-Verlag, 2005.]]

Digital Library

[8]

M. Hennessy. The security picalculus and non-interference. Journal of Logic and Algebraic Programming, 63(1):3--34, 2004.]]

[9]

M. Hennessy and J. Rathke. Typed Behavioural Equivalences for Processes in the Presence of Subtyping. Mathematical Structures in Computer Science, 14(5):651--684, 2004.]]

Digital Library

[10]

M. Hennessy and J. Riely. Information Flow vs. Resource Access in the Asynchronous Pi-calculus. ACM Transactions on Programming Languages and Systems (TOPLAS), 24(5):566--591, 2002.]]

Digital Library

[11]

K. Honda, V. Vasconcelos, and N. Yoshida. Secure Information Flow as Typed Process Behaviour. In Proc. of European Symposium on Programming (ESOP'00), volume 1782 of LNCS, pages 180--199. Springer-Verlag, 2000.]]

Digital Library

[12]

K. Honda and N. Yoshida. On Reduction-based Process Semantics. Theoretical Computer Science, 152(2):437--486, 1995.]]

Digital Library

[13]

K. Honda and N. Yoshida. A Uniform Type Structure for Secure Information Flow. In Proc. of ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages (POPL'02), pages 81--92. ACM Press, 2002.]]

Digital Library

[14]

N. Kobayashi Type-Based Information Flow Analysis for the Pi-Calculus. Acta Informatica, 42(4--5):291--347, 2005.]]

Digital Library

[15]

F. Pottier. A simple view of type-secure information flow in the π-calculus. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'02), pages 320--330. IEEE Computer Society Press, 2002.]]

Digital Library

[16]

P. Ryan and S. Schneider. Process Algebra and Non-Interference. Journal of Computer Security, 9(1/2):75--103, 2001.]]

Digital Library

[17]

A. Sabelfeld and A. C. Myers. Language-Based Information-Flow Security. IEEE Journal on Selected Areas in Communication, 21(1):5--19, 2003.]]

Digital Library

[18]

A. Sabelfeld and D. Sands. A Per Model of Secure Information Flow in Sequential Programs. In Proc. of European Symposium on Programming (ESOP'99), volume 1576 of LNCS, pages 40--58. Springer-Verlag, 1999.]]

Digital Library

[19]

A. Sabelfeld and D. Sands. Probabilistic Noninterference for Multi-threaded Programs. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'00), pages 200--215. IEEE Computer Society Press, 2000.]]

Digital Library

[20]

A. Sabelfeld and D. Sands. Dimensions and principles of declassification. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'05), pages 255--269. IEEE Computer Society Press, 2005.]]

Digital Library

[21]

D. Sangiorgi and D. Walker. The pi calculus: A theory of mobile processes. Cambridge, 2001.]]

Digital Library

[22]

N. Yoshida, K. Honda, and M. Berger. Linearity and Bisimulation. In Proc. of the International Conference on Foundations of Software Science and Computation Structures (FoSSaCS'02), volume 2303 of LNCS, pages 417--434. Springer-Verlag, 2002.]]

Digital Library

[23]

S. Zdancewic and A. C. Myers. Observational Determinism for Concurrent Program Security. In Proc. of the IEEE Computer Security Foundations Workshop (CSFW'03), pages 29--45. IEEE Computer Society Press, 2003.]]

Cited By

Derakhshan FBalzer SJia LGorla D(2021)Session logical relations for noninterferenceProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470654(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470654
Hillston JPiazza CRossi S(2018)Persistent Stochastic Non-InterferenceElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.276.6276(53-68)Online publication date: 24-Aug-2018
https://doi.org/10.4204/EPTCS.276.6
Crafa SMio MMiculan MPiazza CRossi S(2008)PicNIc - Pi-calculus non-interference checker2008 8th International Conference on Application of Concurrency to System Design10.1109/ACSD.2008.4574592(33-38)Online publication date: Jun-2008
https://doi.org/10.1109/ACSD.2008.4574592

Recommendations

Security policies for downgrading
CCS '04: Proceedings of the 11th ACM conference on Computer and communications security

A long-standing problem in information security is how to specify and enforce expressive security policies that control information flow while also permitting information release (i.e., declassification) where appropriate. This paper presents security ...
Localized delimited release: combining the what and where dimensions of information release
PLAS '07: Proceedings of the 2007 workshop on Programming languages and analysis for security

Information release (or declassification) policies are the key challenge for language-based information security. Although much progress has been made, different approaches to information release tend to address different aspects of information release. ...
Expressive Declassification Policies and Modular Static Enforcement
SP '08: Proceedings of the 2008 IEEE Symposium on Security and Privacy

This paper provides a way to specify expressive declassification policies, in particular, when, what, and where policies that include conditions under which downgrading is allowed. Secondly, an end-to-end semantic property is introduced, based on a ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

FMSE '06: Proceedings of the fourth ACM workshop on Formal methods in security

November 2006

84 pages

ISBN:1595935509

DOI:10.1145/1180337

General Chair:
Marianne Winslett
UIUC
,
Program Chairs:
Andrew D. Gordon
Microsoft Research, UK
,
David Sands
Chalmers University of Technology, Sweden

Copyright © 2006 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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 03 November 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

CCS06

Sponsor:

CCS06: 13th ACM Conference on Computer and Communications Security 2006

November 3, 2006

Virginia, Alexandria, USA

Upcoming Conference

CCS '25

Sponsor:
sigsac

ACM SIGSAC Conference on Computer and Communications Security

October 13 - 17, 2025

Taipei , Taiwan

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
182
Total Downloads

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

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Derakhshan FBalzer SJia LGorla D(2021)Session logical relations for noninterferenceProceedings of the 36th Annual ACM/IEEE Symposium on Logic in Computer Science10.1109/LICS52264.2021.9470654(1-14)Online publication date: 29-Jun-2021
https://dl.acm.org/doi/10.1109/LICS52264.2021.9470654
Hillston JPiazza CRossi S(2018)Persistent Stochastic Non-InterferenceElectronic Proceedings in Theoretical Computer Science10.4204/EPTCS.276.6276(53-68)Online publication date: 24-Aug-2018
https://doi.org/10.4204/EPTCS.276.6
Crafa SMio MMiculan MPiazza CRossi S(2008)PicNIc - Pi-calculus non-interference checker2008 8th International Conference on Application of Concurrency to System Design10.1109/ACSD.2008.4574592(33-38)Online publication date: Jun-2008
https://doi.org/10.1109/ACSD.2008.4574592

View Options

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten