In this paper we show a novel method for modelling behaviours of security protocols using networks of communicating automata in order to verify them with SAT-based bounded model ch...
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
Even though PDAs in general—but smartcards in particular—can be trusted to keep secrets, because they have meager resources, including them in security protocols is difficult...
We present three voting protocols with unconditional privacy and information-theoretic correctness, without assuming any bound on the number of corrupt voters or voting authorities...
A significant challenge for Peer-to-Peer (P2P) systems is maintaining the correctness and consistency of their global data structures and shared contents as peers independently a...