Security and reliability of network protocol implementations are essential for communication services. Most of the approaches for verifying security and reliability, such as forma...
In this paper we present a modeling technique for security protocols using Abstract State Machines [BS03,Gur95] (ASMs). We describe how we model the different agents in the scenar...
Dominik Haneberg, Holger Grandy, Wolfgang Reif, Ge...
ion in PRISM1 Mark Kattenbelt Marta Kwiatkowska Gethin Norman David Parker Oxford University Computing Laboratory, Oxford, UK Modelling and verification of systems such as communi...
Mark Kattenbelt, Marta Z. Kwiatkowska, Gethin Norm...
We propose a zero-knowledge interactive proof based identification and signature scheme. The protocol is based on Euler's totient function and discrete logarithms over the ri...
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...