5 citations found. Retrieving documents...
M. Dam. Proving trust in systems of second-order processes: Preliminary results. Draft, 1997.

 Home/Search   Document Details and Download   Summary   Related Articles   Check  

This paper is cited in the following contexts:
Secure Implementation of Channel Abstractions - Abadi, Fournet, Gonthier (1998)   (21 citations)  (Correct)

....previously appeared in the literature. This paper represents the confluence of several projects, including the development of secure network objects [34] and of the join calculus [15, 16, 17, 18] and the application of the pi calculus and the spi calculus for reasoning about security protocols [4, 5, 6, 1, 13]. Those projects encountered some of the questions treated here; the join calculus provides a more convenient setting for this study than network object systems or the pi calculus [2, 3] Those projects also produced the work most closely related to that described here, including partial encodings ....

.... of the questions treated here; the join calculus provides a more convenient setting for this study than network object systems or the pi calculus [2, 3] Those projects also produced the work most closely related to that described here, including partial encodings of encryption in the pi calculus [4, 13]. Our translation goes in the direction opposite to those encodings. In the next section we describe the source language and the target language of our translation, and give an informal overview of some of the themes of the paper. In sections 3 and 4, we present our translation, with several ....

M. Dam. Proving trust in systems of second-order processes: Preliminary results. Draft, 1997.


The Game of the Name in Cryptographic Tables - Amadio, Prasad (1999)   (5 citations)  (Correct)

....mentioned above the attacker must be explicitly modelled. A more recent trend has been the use of name passing process calculi for studying cryptographic authentication protocols. Abadi and Gordon have presented the spi calculus [1] an extension of the calculus with cryptographic primitives (see [7] for a related approach using a second order calculus) Principals of a protocol are expressed in a calculus like notation, whereas the attacker is represented implicitly by the process calculus notion of environment . Security properties are modelled in terms of contextual equivalences, in ....

M. Dam. Proving trust in systems of second-order processes: preliminary results. In Proc. HICSS 98, 1998.


Static Analysis of Processes for No Read-Up and No.. - Bodei, Degano, Nielson.. (1999)   (25 citations)  (Correct)

....using the spi calculus, an extension of the calculus devised for writing secure protocols. Venet [27, 28] uses Abstract Interpretation techniques to analyse processes in a fragment of the calculus, with particular attention to the usage of channels. Other papers interesting for this area are [24, 26, 13, 8, 3, 9, 25, 16]. Particularly relevant are Hennessy and Riely s papers [25, 16] who give a type system for D , a variant of the calculus with explicit sites that harbour mobile processes. Cardelli and Gordon [6] propose a type system for the Mobile Ambient calculus ensuring that a well typed mobile ....

M. Dam. Proving trust in systems of second-order processes: Preliminary results. Technical Report LOMAPS-SICS 19, SICS, Sweden, 1997.


Control Flow Analysis for the pi-calculus - Bodei, Degano, Nielson, Nielson (1998)   (3 citations)  (Correct)

....P . The additional label l records the classification level of P , and oe gives information about the directionality of channels. Variants of this property have been studied in a dynamic setting (see, e.g. 6, 7, 10] to cite only a few) Closer to our proposal is the use of type systems made in [1, 15, 17, 8, 2, 5, 16, 20, 4] in order to guarantee security properties. In particular, Abadi s paper [1] studies secrecy of channels and of encrypted messages in the spi calculus. This is a more ambitious goal than ours, because in the calculus there is no notion of encryption. As for the disciplined use of channels, ....

M. Dam. Proving trust in systems of second-order processes: Preliminary results. Technical Report LOMAPS-SICS 19, SICS, Sweden, 1997.


Static Analysis of Processes for No Read-Up and No.. - Bodei, Degano, Nielson.. (1999)   (25 citations)  (Correct)

....using the spi calculus, an extension of the calculus devised for writing secure protocols. Venet [27, 28] uses Abstract Interpretation techniques to analyse processes in a fragment of the calculus, with particular attention to the usage of channels. Other papers interesting for this area are [24, 26, 13, 8, 3, 9, 25, 16]. Particularly relevant are Hennessy and Riely s papers [25, 16] who give a type system for D , a variant of the calculus with explicit sites that harbour mobile processes. Cardelli and Gordon [6] propose a type system for the Mobile Ambient calculus ensuring that a well typed mobile ....

M. Dam. Proving trust in systems of second-order processes: Preliminary results. Technical Report LOMAPS-SICS 19, SICS, Sweden, 1997.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC