Abstract. We present a symbolic definition that captures some cases of election verifiability for electronic voting protocols. Our definition is given in terms of reachability assertions in the applied pi calculus and is amenable to automated reasoning using the software tool ProVerif. The definition distinguishes three aspects of verifiability, which we call individual, universal, and eligibility verifiability. We demonstrate the applicability of our formalism by analysing the protocols due to Fujioka, Okamoto & Ohta and a variant of the one by Juels, Catalano & Jakobsson (implemented as Civitas by Clarkson, Chong & Myers).

Abstract. Key substitution vulnerable signature schemes are signature schemes that permit an intruder, given a public verification key and a signed message, to compute a pair of signature and verification keys such that the message appears to be signed with the new signature key. Schemes vulnerable to this attack thus permit an active intruder to claim to be the issuer of a signed message. A digital signature scheme is said to be vulnerable to destructive exclusive ownership property (DEO) If it is computationaly feasible for an intruder, given a public verification key and a pair of message and its valid signature relatively to the given public key (m, s), to compute a pair of signature and verification keys and a new message m ′ such that s is a valid signature of m ′ relatively to the new verification key. In this paper, we investigate and solve positively the problem of the decidability of symbolic cryptographic protocol analysis when the signature schemes employed in the concrete realisation have this two properties.

The selection of the most adapted project management method (PMM) can contribute to the success of information technology (IT) projects and hence the company's optimized profitability and operability. Due to many PMMs known for their operational advantages, and with the variety of companies’ strategies and policies, the decision‐making process of selecting the best‐suited PMM can get cumbersome, and some unfounded practices could, consequently, mislead its involved leaders. We propose in this work a methodological approach of decision analysis that allows a structured, reproducible, and group decision support system‐assisted execution. The methodology was fully executed and evaluated with three real case studies of IT projects, and further improvements and research perspectives were identified.