Primitives for Authentication in Process Algebras

Bodei, Chiara and Degano, Pierpaolo and Focardi, Riccardo and Priami, Corrado (2001) Primitives for Authentication in Process Algebras. UNSPECIFIED.

Download (297Kb) | Preview


    We extend the P­­-calculus and the spi-­calculus with two primitives that guarantee authentication. They enable us to abstract from various implementations/specifications of authentication, and to obtain idealized protocols which are ``secure by construction''. The main underlying idea, originally proposed in for entity authentication, is to use the locations of processes in order to check who is sending a message (authentication of a party) and who originated a message (message authentication). The theory of local names, developed in for the P­calculus, gives us almost for free both the partner authentication and the message authentication primitives.

    Item Type: Departmental Technical Report
    Department or Research center: Information Engineering and Computer Science
    Subjects: Q Science > QA Mathematics > QA075 Electronic computers. Computer science
    Q Science > Q Science (General)
    Uncontrolled Keywords: Security, Authentication, Secrecy, Operational Semantics, Proved Transition Systems, Distrib­uted Process Algebras
    Additional Information: Appeared in Theoretical Computer Science 283/2
    Report Number: DIT-02-019
    Repository staff approval on: 05 Jul 2002

    Actions (login required)

    View Item