Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
158
Analysis of an electronic voting protocol in the applied pi-calculus
- In Proc. 14th European Symposium On Programming (ESOP’05), volume 3444 of LNCS
, 2005
"... Abstract. Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols. The ap ..."
Abstract
-
Cited by 91 (9 self)
- Add to MetaCart
Abstract. Electronic voting promises the possibility of a convenient, efficient and secure facility for recording and tallying votes in an election. Recently highlighted inadequacies of implemented systems have demonstrated the importance of formally verifying the underlying voting protocols
A verifiable secret shuffle and its application to E-Voting
, 2001
"... We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universally verifiable, multi-authority election schemes. The output of the shuffle operation is another sequence of k modular in ..."
Abstract
-
Cited by 217 (0 self)
- Add to MetaCart
is important because it provides a linear size proof of correctness for the output sequence (i.e. a proof that it is of the form claimed) that can be checked by an arbitrary verifiers. The complexity of the protocol improves on that of Furukawa-Sako[16] both measured by number of exponentiations and by overall
The Mondex Challenge: Machine Checked Proofs for an Electronic Purse
, 2006
"... The Mondex case study about the specification and refinement of an electronic purse as defined in [SCJ00] has recently been proposed as a challenge for formal system-supported verification. This paper reports on the successful verification of the major part of the case study using the KIV specificat ..."
Abstract
-
Cited by 25 (9 self)
- Add to MetaCart
of the communication protocol using abstract state machines. Finally the Mondex case study verifies functional correctness assuming a suitable security protocol. Therefore we propose to extend the case study to include the verification of a suitable security protocol.
A Taxonomy of Privacy in Voting Protocols
, 2011
"... Privacy is one of the main issues in electronic voting. We propose a modular family of symbolic privacy notions that allows to assess the level of privacy ensured by a voting protocol. Our definitions are applicable to protocols featuring multiple votes per voter and special attack scenarios such as ..."
Abstract
-
Cited by 12 (5 self)
- Add to MetaCart
Privacy is one of the main issues in electronic voting. We propose a modular family of symbolic privacy notions that allows to assess the level of privacy ensured by a voting protocol. Our definitions are applicable to protocols featuring multiple votes per voter and special attack scenarios
Automated Verification of Remote Electronic Voting Protocols in the Applied Pi-calculus
"... We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this paper, we provide novel definitions that address several important security properties. In particular, we propose a new ..."
Abstract
-
Cited by 69 (5 self)
- Add to MetaCart
We present a general technique for modeling remote electronic voting protocols in the applied pi-calculus and for automatically verifying their security. In the first part of this paper, we provide novel definitions that address several important security properties. In particular, we propose a new
Verifying Properties of Electronic Voting Protocols
- in "Proceedings of the IAVoSS Workshop On Trustworthy Elections (WOTE’06
, 2006
"... In this paper we report on some recent work to formally specify and verify electronic voting protocols. In particular, we use the formalism of the applied pi calculus: the applied pi calculus is a formal language similar to the pi calculus but with useful extensions for modelling cryptographic proto ..."
Abstract
-
Cited by 6 (0 self)
- Add to MetaCart
In this paper we report on some recent work to formally specify and verify electronic voting protocols. In particular, we use the formalism of the applied pi calculus: the applied pi calculus is a formal language similar to the pi calculus but with useful extensions for modelling cryptographic
Du-Vote: Remote Electronic Voting with Untrusted Computers
"... Abstract—Du-Vote is a new remote electronic voting protocol that eliminates the often-required assumption that voters trust general-purpose computers. Trust is distributed in Du-Vote be-tween a simple hardware token issued to the voter, the voter’s computer, and a server run by election authorities. ..."
Abstract
- Add to MetaCart
. Verifiability is guaranteed with high probability even if all these machines are controlled by the adversary, and privacy is guaranteed as long as at least either the voter’s computer, or the server and the hardware token, are not controlled by the adversary. The design of the Du-Vote protocol is presented
An Epistemic Approach to Coercion-Resistance for Electronic Voting Protocols
- In 2009 IEEE Symposium on Security and Privacy (S&P 2009
"... Coercion resistance is an important and one of the most intricate security requirements of electronic voting protocols. Several definitions of coercion resistance have been proposed in the literature, including definitions based on symbolic models. However, existing definitions in such models are ra ..."
Abstract
-
Cited by 25 (5 self)
- Add to MetaCart
Coercion resistance is an important and one of the most intricate security requirements of electronic voting protocols. Several definitions of coercion resistance have been proposed in the literature, including definitions based on symbolic models. However, existing definitions in such models
Coercion-resistance and receipt-freeness in electronic voting
, 2006
"... In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an election protocol is coercion-resistant if a voter A cannot prove to a potential coercer C that she voted in a particular ..."
Abstract
-
Cited by 60 (6 self)
- Add to MetaCart
In this paper we formally study important properties of electronic voting protocols. In particular we are interested in coercion-resistance and receipt-freeness. Intuitively, an election protocol is coercion-resistant if a voter A cannot prove to a potential coercer C that she voted in a particular
Results 1 - 10
of
158
