Conference Paper

Encoding cryptographic primitives in a calculus with polyadic synchronization.

Conference: International Conference on Theoretical and Mathematical Foundations of Computer Science, TMFCS-08, Orlando, Florida, USA, July 7-10, 2008
Source: DBLP

ABSTRACT We thoroughly study the behavioral theory of epi, a -calculus extended with polyadic synchronization. We show that the nat- ural contextual equivalence, barbed congruence, coincides with early bisimilarity, which is thus its co-inductive characterization. Moreover, we relate early bisimilarity with the other usual notions, ground, late and open, obtaining a lattice of equivalence relations that clarifies the relashionship among the "standard" bisimilarities. Furthermore, we apply the theory developed to obtain an ex- pressiveness result: epi extended with (symmetrical) key encryp- tion primitives may be fully abstractly encoded in the original epi calculus. The proposed encoding is sound and complete with re- spect to barbed congruence. Therefore, cryptographic epi (crypto- epi) gets behavioral theory for free, what contrasts with other pro- cess languages with cryptographic constructs that usually require a big effort to develop such theory. Therefore, it is thus possible to use crypto-epi to analyze and to verify properties of security protocols using equational reasoning. To illustrate this claim, we prove the correctness of a protocol of secure message exchange.

0 Bookmarks
 · 
49 Views
  • Source
    [Show abstract] [Hide abstract]
    ABSTRACT: We thoroughly study the behavioural theory of epi, a π-calculus extended with polyadic synchronisation. We show that the natural contextual equivalence, barbed congruence, coincides with early bisimilarity, which is thus its co-inductive characterisation. Moreover, we relate early bisimilarity with the other usual notions, ground, late and open, obtaining a lattice of equivalence relations that clarifies the relationship among the “standard” bisimilarities. Furthermore, we apply the theory developed to obtain an expressiveness result: epi extended with key encryption primitives may be fully abstractly encoded in the original epi calculus. The proposed encoding is sound and complete with respect to barbed congruence; hence, cryptographic epi (crypto-epi) gets behavioural theory for free, which contrasts with other process languages with cryptographic constructs that usually require a big effort to develop such theory. Therefore, it is possible to use crypto-epi to analyse and to verify properties of security protocols using equational reasoning. To illustrate this claim, we prove compliance with symmetric and asymmetric cryptographic system laws, and the correctness of a protocol of secure message exchange.
    Journal of Automated Reasoning 01/2011; 46:293-323. · 0.57 Impact Factor

Full-text (2 Sources)

Download
17 Downloads
Available from
May 20, 2014