R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....(see, e.g. 10, 11, 12, 13, 14] # This work has been partially supported by MURST Progetto TOSCA, Progetto AI, TS CFA and Progetto Metodi formali per la Sicurezza . We here slightly extend the spi calculus [3, 15] a concurrent language with cryptographic primitives, based on the # calculus [17]. We give this calculus certain kinds of semantics, exploiting the built in mechanisms for authentication, introduced in [18] Our mechanisms enable us to abstract from the various implementations specifications of authentication, and to obtain idealized protocols which are secure by ....

....calculus for modelling concurrent and mobile agents. Then, we shall introduce the extensions necessary for dealing with our authentication primitives. The Spi Calculus In this section we intuitively recall a simplified version of the spi calculus [3, 15] This calculus extends the # calculus [17], with cryptographic primitives. Here, terms can be names or variables and can also be structured as encryptions . An encryption represents the ciphertext obtained by encrypting M 1 , M k under the key N , using a shared key cryptosystem such as DES [21] Most of the processes ....

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

....2 The Spi Calculus Syntax. In this section we intuitively recall a simplified version of the spi calculus [1, 2] In the full calculus, terms can also be pairs, zero and successors of terms. Extending our proposal to the full calculus is easy. Our version of the calculus extends the calculus [24], with cryptographic primitives. Here, terms can be names, variables and can also be structured as pairs (M 1 ; M 2 ) or encryptions fM 1 ; M k gN . An encryption fM 1 ; M k gN represents the ciphertext obtained by encrypting M 1 ; M k under the key N , using a shared key ....

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

....and their properties. The formalisms we will use are among others: the CO OPN2 [2] formalism, an extension of CO OPN [3] which uses high level algebraic Petri Nets, where tokens are not simple algebraic terms but whole Petri Nets, realizing in that way the mobility of processes; the r calculus [6] derived from ccs and enabling to model mobile processes; the Actors [1] model, which is very similar to messenger as messenger can be seen as actors; and the PoLIS [4] programming model of distributed systems with communication based on a shared dataspace. The second focus of our further work is ....

R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes I and II. Journal of Information and computation, 100(1):1-40,41-77, 1992.

....calculus. Section 3 intuitively presents our authentication primitives, formally defined in the Appendix. Section 4 introduces our notion of correct implementation and gives some examples. 2 The Calculus Syntax. In this section we intuitively recall a summation free version of the calculus [19], extended with encryption decryption primitives (indented in the following syntax definitions) Here, terms can be names or variables and can also be structured as encryptions fM 1 ; M k g N . An encryption fM 1 ; M k g N represents the ciphertext obtained by encrypting M 1 ; ....

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

....and to obtain idealized protocols which are secure by construction . Our protocols, or rather their specifications can then be seen as a reference for proving the correctness of real protocols . The essence of concurrent and mobile computation can be studied in a pure form using the calculus [24], a foundational calculus based on the notion of naming. Systems are specified as expressions called processes. These are obtained by combining, via a few operators (parallel composition, nondeterministic choice, declarations) the basic actions of sending and of receiving names between processes ....

....Section 5 is devoted to partner authentication. In Section 6 we survey the spi calculus and in Section 7 we enrich it with the relative address mechanism. Sections 8 and 9 are about the message authentication primitive. 2 The calculus In this section we briefly recall the monadic calculus [24], a model of concurrent communicating processes based on the notion of naming. Our presentation slightly differs from the usual ones and it will make it easier to introduce later on the spi calculus The main difference from standard presentation relies in the introduction of the new syntactic ....

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

....the notion of observational equivalence is simpler: indeed testing bisimulation amounts to verifying the behaviours of processes at intermediate steps of computation rather than just the input output relation. Then, as pointed out in [6] there are various notions of bisimulation (see for example [17], 18] 22] and there is no consensus on which is the proper one. On the other side, the calculus of multiplicities of [8] does not seem of independent interest, while syatems similar to the concurrent calculus have been studied in different papers [7] 20] 21] 2] 11] 12] As a ....

R. Milner, J. Parrow, D. Walker, "A Calculus of Mobile Processes, I and II", Inform. Comp. 100(1), 1992,1-77. 9

....following the approach and using the tools mentioned above. Additionally, our built in authentication mechanism suggests a further proof technique, that we shall briefly discuss in the conclusions. The essence of concurrent and mobile computation can be studied in a pure form using the calculus [12], a foundational calculus based on the notion of naming. Systems are specified as expressions of the calculus, called processes. These are obtained by combining via a few operators (parallel composition, nondeterministic choice, declarations) the basic actions of sending and of receiving names ....

....proposed in [1] We shall not present it in detail. We only show in Sect. 5 the needed extensions to model in our framework the primitives for encryption and decryption and we show on an example how an attack is revealed. 2. The calculus In this section we briefly recall the calculus [12], a model of concurrent communicating processes based on the notion of naming. We give only its intuitive semantics; the formal semantics of the calculus is in Appendix A. 2 Definition 2.1 (syntax) Let N be a countable, infinite set of names ranged over by a; b; x; y; and let be ....

[Article contains additional citation context not shown here]

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

....change during the execution, since different communication Categorical logic of names and abstraction 3 channels that may be received can open different computation paths, or preempt them. This is the idea of a mobile process. The corresponding generalisation of the calculus is the calculus (Milner et al. 1992). The main difference is that a function is applied to its input sequentially, while a mobile process can communicate with any of the processes running in parallel with it, provided that there is a common communication channel. The function application has been generalised to the communication, ....

R. Milner et al. (1992) A calculus of mobile processes I and II. Inform. and Comput. 100, 1--77.

....through a survey of existing theories can be found in [10] where we present paradigms and formalisms related to one or more of these features. This helps us to position the messenger paradigm among other existing paradigms. Messengers as mobile processes are investigated with calculus [16]; messengers as distributed concurrent processes are compared to actors; messengers as coordinated processes are compared to the PoliS paradigm; messengers as collaborative agents are investigated with temporal logic for agents. We also explain informally how two formalisms can be applied to ....

R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes I and II. Journal of Information and computation, 100(1):1--40,41--77, 1992.

....and their properties. The formalisms we will use are among others: the co opn2 [2] formalism, an extension of co opn [3] which uses high level algebraic Petri Nets, where tokens are not simple algebraic terms but whole Petri Nets, realizing in that way the mobility of processes; the calculus [6] derived from ccs and enabling to model mobile processes; the Actors [1] model, which is very similar to messenger as messenger can be seen as actors; and the PoliS [4] programming model of distributed systems with communication based on a shared dataspace. The second focus of our further work is ....

R. Milner, J. Parrow, and D. Walker. A Calculus of Mobile Processes I and II. Journal of Information and computation, 100(1):1--40,41--77, 1992.

No context found.

R. Milner, J. Parrow, and D. Walker. "A Calculus of Mobile Processes (I and II)". Information and Computation, 100(1):1--77, 1992.

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