scholarly journals Future-based Static Analysis of Message Passing Programs

2016 ◽  
Vol 211 ◽  
pp. 65-72 ◽  
Author(s):  
Wytse Oortwijn ◽  
Stefan Blom ◽  
Marieke Huisman
2020 ◽  
Vol 31 (11) ◽  
pp. 2570-2581
Author(s):  
Sina Zangbari Koohi ◽  
Nor Asilah Wati Abdul Hamid ◽  
Mohamed Othman ◽  
Gafurjan Ibragimov

1994 ◽  
Vol 2 (2) ◽  
pp. 50-56 ◽  
Author(s):  
S. Sistare ◽  
D. Allen ◽  
R. Bowker ◽  
K. Jourdenais ◽  
J. Simons ◽  
...  

2007 ◽  
Vol 18 (03) ◽  
pp. 593-618 ◽  
Author(s):  
BENJAMIN AZIZ ◽  
GEOFF HAMILTON

In this paper, we present a process algebra aimed at modelling PKI-based systems. The new language, SPIKY, extends the spi-calculus by adding primitives for the retrieval of certified/uncertified public keys as well as private keys belonging to users of the PKI-based system. SPIKY also formalises the notion of process ownership by PKI users, which is necessary in controlling the semantics of the key retrieval capabilities. We also construct a static analysis for SPIKY that captures the property of term substitutions resulting from message-passing and PKI/cryptographic operations. This analysis is shown to be safe and computable. Finally, we use the analysis to define the term secrecy and peer participation properties for a couple of examples of authentication protocols.


Sign in / Sign up

Export Citation Format

Share Document