2008
DOI: 10.3233/jcs-2008-0334
|View full text |Cite
|
Sign up to set email alerts
|

A secure compiler for session abstractions

Abstract: Distributed applications can be structured as parties that exchange messages according to some prearranged communication patterns. These sessions (or contracts, or protocols) simplify distributed programming: when coding a role for a given session, each party just has to follow the intended message flow, under the assumption that the other parties are also compliant.In an adversarial setting, remote parties may not be trusted to play their role. Hence, defensive implementations also have to monitor one another… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
24
0

Year Published

2009
2009
2019
2019

Publication Types

Select...
5
1

Relationship

1
5

Authors

Journals

citations
Cited by 13 publications
(24 citation statements)
references
References 41 publications
0
24
0
Order By: Relevance
“…A similar approach is gaining popularity in the literature on typed process calculi targeted at the specification of distributed protocols and systems (see, e.g., [24,25]). In these papers, the typed calculi provide for idealized specifications which are implemented by translations into low-level, but still typed, cryptographic languages.…”
Section: Communication Modes Translationmentioning
confidence: 99%
“…A similar approach is gaining popularity in the literature on typed process calculi targeted at the specification of distributed protocols and systems (see, e.g., [24,25]). In these papers, the typed calculi provide for idealized specifications which are implemented by translations into low-level, but still typed, cryptographic languages.…”
Section: Communication Modes Translationmentioning
confidence: 99%
“…The works [28,29,30] offer a first answer to these questions (the journal paper [30] merges and extends both [29] and [28]). The proposed language, expressed as a type language with a global graph-like representation (called session graphs), includes messages, roles, and sessions; it does not support parallelism or asynchrony.…”
Section: A Secure Protocol Compilermentioning
confidence: 99%
“…The principle of [30] is to use the session graph specification to generate a cryptographic protocol (and its implementation) that will protect the honest participants against any coalition of compromised peers. The idea is that, in order to ensure that an incoming message is valid with respect to the session graph specification, that message should carry enough trustworthy information to be able to prove that the protocol history was compliant up to that point.…”
Section: A Secure Protocol Compilermentioning
confidence: 99%
“…Early work [8] applies them to security concerns, which includes a type-checker and code generator for ML. A recent implementation extends SJ for MPST [32] and studies type-directed optimisations for the extended language.…”
Section: Related and Future Workmentioning
confidence: 99%