A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Formalising Receipt-Freeness
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
Receipt-freeness -p. 8/19 Formalising Receipt-freeness -p. 9/19 Formalising Receipt-freeness -p. 9/19 Formalising Receipt-freeness -p. 9/19 Formalising Receipt-freeness -p. 9/19 Hugo Jonker, Malice, March ...
-p. 17/19 Formalising Receipt-freeness -p. 17/19 Formalising Receipt-freeness -p. 17/19 Formalising Receipt-freeness -p. 17/19 Formalising Receipt-freeness -p. 17/19 Hugo Jonker, Malice, March 16, 2006 ...
So receipts are themselves authentication terms) Although this does not capture the entire notion of receipts, it turns out to be strong enough in the examined cases. ...
doi:10.1007/11836810_34
fatcat:ruxtfixnjfcg5ai4dvwjcn5bwy
Verifying Privacy-Type Properties of Electronic Voting Protocols: A Taster
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
We particularly focus on anonymity properties, namely vote-privacy and receipt-freeness. ...
However, protocols that were designed to satisfy privacy or receipt-freeness may not do so in the presence of corrupt officials. ...
Receipt-Freeness Similarly to privacy, receipt-freeness may be formalised as an observational equivalence. ...
doi:10.1007/978-3-642-12980-3_18
fatcat:6g6q4udfvjhupopsslpoii4htm
Analysis of a Receipt-Free Auction Protocol in the Applied Pi Calculus
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
These properties are formalised as observational equivalences in the applied π calculus. We analyse the receipt-free auction protocol by Abe and Suzuki. ...
We formally study two privacy-type properties for online auction protocols: bidding-price-secrecy and receipt-freeness. ...
In voting, receipt-freeness can be formalised as an observational equivalence [11] . ...
doi:10.1007/978-3-642-19751-2_15
fatcat:rh5asfxnife2bcd3lbmzmcbyvi
Anonymity in Voting Revisited
[chapter]
2010
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
Some of the combinations, including weak and strong receiptfreeness, are formalised in epistemic logic. ...
In the next section, we formalise the notions of strong and weak privacy and receipt-freeness in an epistemic framework. ...
We use this framework as the basis for our definitions of privacy and receipt-freeness. Their definitions are based on a formalisation of runs in protocols. ...
doi:10.1007/978-3-642-12980-3_13
fatcat:bw2n2hra6rgkbpfbyvkgvc6hhy
Verifying privacy-type properties of electronic voting protocols
2009
Journal of Computer Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
However, protocols that were designed to satisfy receipt-freeness or coercion-resistance may not do so in the presence of corrupt officials. ...
We study three privacy-type properties of electronic voting protocols: in increasing order of strength, they are vote-privacy, receipt-freeness, and coercionresistance. ...
Receipt-Freeness Similarly to privacy, receipt-freeness may be formalised as an observational equivalence. We also formalise receipt-freeness using observational equivalence. ...
doi:10.3233/jcs-2009-0340
fatcat:y72xjzgtrzcevg7nfjvudwjaoi
Challenges in eHealth: From Enabling to Enforcing Privacy
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
[35] formalised receipt-freeness in online auction. ...
[29] developed their formalisation of receipt-freeness and coercion-resistance based on observational equivalences in the applied pi calculus [30] . ...
doi:10.1007/978-3-642-32355-3_12
fatcat:dco3j6pharelzjlsbljuzdvdiu
Formal modelling and analysis of receipt-free auction protocols in applied pi
2017
Computers & security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We formally study two privacy-type properties for e-auction protocols: bidding-pricesecrecy and receipt-freeness. ...
These properties are formalised as observational equivalences in the applied pi calculus. ...
In voting, receipt-freeness can be formalised as an observational equivalence [15] . ...
doi:10.1016/j.cose.2016.09.002
fatcat:pegmcayafrhljnlfeflqe6arme
A Formal Framework for Modelling Coercion Resistance and Receipt Freeness
[chapter]
2012
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Coercion resistance and receipt freeness are critical properties for any voting system. ...
We give here a general framework for specifying different coercion resistance and receipt freeness properties using the process algebra CSP. ...
against a coercer who can interact in this way, whereas receipt freeness does not. ...
doi:10.1007/978-3-642-32759-9_19
fatcat:ffslkxbugjfi7lthnedsyvchvy
Formal Analysis of an E-Health Protocol
[article]
2018
arXiv
pre-print
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In this paper, we first identify and formalise several new but important privacy properties on enforcing doctor privacy. ...
However, the formalisation of receipt-freeness differs from receipt-freeness, due to the domain requirement that only part of the doctor's process needs to share information with the adversary. ...
The cooperation between the bribed doctor and the adversary is formalised in the same way as in receipt-freeness in e-voting. ...
arXiv:1808.08403v1
fatcat:r7sko43xs5ejhiaqmfuhrkhb7y
Expressing Receipt-Freeness and Coercion-Resistance in Logics of Strategic Ability
2016
Proceedings of the 1st International Workshop on AI for Privacy and Security - PrAISe '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We argue that the notions of receipt-freeness and coercion resistance are underpinned by existence (or nonexistence) of a suitable strategy for some participants of the voting process. ...
[9] This paper introduced the notion of receipt freeness. ...
Receipt-freeness and coercion resistance. In 1994, Benolah and Tuinstra [9] introduced receipt freeness as a required property for avoiding coercion in e-voting systems. Later Michels et al. ...
doi:10.1145/2970030.2970039
dblp:conf/ecai/TabatabaeiJR16
fatcat:rcldf3qbnbcvldd65h4ijar3we
Measuring Voter-Controlled Privacy
2009
2009 International Conference on Availability, Reliability and Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In voting, the notion of receipt-freeness has been proposed to express that a voter cannot gain any information to prove that she has voted in a certain way. ...
The quantification enables the framework to capture receipts that reduce, but not nullify, the privacy of the voter. This has not been identified and dealt with by other formal approaches. ...
Given this definition of privacy, receipt-freeness is a measure of the voter's privacy as follows. Definition 11 (receipt-freeness). ...
doi:10.1109/ares.2009.81
dblp:conf/IEEEares/JonkerMP09
fatcat:uvvaqvvo6zhfdg7mlvoql2fchq
Privacy and verifiability in voting systems: Methods, developments and trends
2013
Computer Science Review
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Unlike HS00, Lee and Kim did not aim to provide a generic construction for receipt-freeness, but seek to incorporate receipt-freeness into CGS97. ...
Figure 13 : 13 MBC01 extensions to ensure receipt-freeness in CGS97.
• ALBD04: receipt-freeness (RF), individual and universal verifiability (IV, UV). ...
doi:10.1016/j.cosrev.2013.08.002
fatcat:fjqritngvnej3owtqnmhbuckqa
Game-based verification of contract signing protocols with minimal messages
2012
Innovations in Systems and Software Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The abuse-freeness attack leads us to a revision of the methodology to con-struct an MRT protocol. ...
We discover an attack on fairness in a published MRT protocol with three signers and a general attack on abuse-freeness for all MRT protocols. For both attacks, we present solutions. ...
The formalisation of abuse-freeness in ATL is more involved. ...
doi:10.1007/s11334-012-0180-9
fatcat:ok5gjatynfgorazquntmbydnou
A formal framework for quantifying voter-controlled privacy
2009
Journal of Algorithms
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
The quantification allows our framework to capture receipts that reduce, but not nullify, the privacy of the voter. ...
Receipt-freeness Receipt-freeness, as introduced by Benaloh and Tuinstra [1] , captures ways for a voter to reduce the privacy of how she voted. ...
Receipt-freeness aims to prevent vote buying, even when a voter chooses to renounce her privacy. ...
doi:10.1016/j.jalgor.2009.02.007
fatcat:kon6avfi2bcdjic4ha24z4rn7i
Electronic Voting: How Logic Can Help
[chapter]
2014
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Stronger than vote privacy is receipt-freeness: a voter should not be able to prove how she voted, even if she is willing to. ...
Even stronger than receipt-freeness is coercion resistance: even if a voter is temporarily under the control of a coercer, she should be able to cast the vote of her choice. ...
doi:10.1007/978-3-319-08587-6_2
fatcat:nhfqfkkrazbdna5n7g4qi6jhyq
« Previous
Showing results 1 — 15 out of 75 results