14 Hits in 4.6 sec

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting [chapter]

Joël Alwen, Rafail Ostrovsky, Hong-Sheng Zhou, Vassilis Zikas
2015 Lecture Notes in Computer Science  
a universally composable receipt-free e-voting protocol.  ...  In this work we put forward the first universally composable notion of incoercible multi-party computation, which satisfies the above intuition and does not assume collusions among coerced parties or knowledge  ...  Receipt-Free-Incoercible Multi-Party Computation In this section we describe a protocol for IUC realizing any (well-formed [11] ) nparty functionalities F in the presence of semi-honest (i.e. receipt-free  ... 
doi:10.1007/978-3-662-48000-7_37 fatcat:6764qgvnpfarngnhouy4t6cove

Universally Composable Incoercibility [chapter]

Dominique Unruh, Jörn Müller-Quade
2010 Lecture Notes in Computer Science  
We present the UC/c framework, a general definition for secure and incoercible multi-party protocols.  ...  Our framework allows to model arbitrary reactive protocol tasks (by specifying an ideal functionality) and comes with a universal composition theorem.  ...  We thank Yevgeniy Dodis and Daniel Wichs for extensive discussions. We also thank the anonymous reviewers for helpful comments.  ... 
doi:10.1007/978-3-642-14623-7_22 fatcat:ymuv4pydf5c6ncqyfqgf4scfo4

Receipt-Free Universally-Verifiable Voting with Everlasting Privacy [chapter]

Tal Moran, Moni Naor
2006 Lecture Notes in Computer Science  
Our scheme is also the first receipt-free scheme to give "everlasting privacy" for votes: even a computationally unbounded party does not gain any information about individual votes (other than what can  ...  We give a generic voting protocol which we prove to be secure in the Universal Composability model, given that the underlying commitment is universally composable.  ...  An open problem is to allow a complete tally without sacrificing any of the other properties of our scheme (such as receipt-freeness and everlasting privacy).  ... 
doi:10.1007/11818175_22 fatcat:gv6rthvvbrgj5ba6mw56siyycy

Evaluating Security of Voting Schemes in the Universal Composability Framework [chapter]

Jens Groth
2004 Lecture Notes in Computer Science  
Perhaps because of this many papers on electronic voting do not offer any security proof at all. As a solution to this, we suggest evaluating voting schemes in the universal composability framework.  ...  Security properties such as privacy, accuracy and robustness now follow as easy corollaries. We note that some security requirements, for instance incoercibility, are not addressed by our solution.  ...  In particular, universal composability of a voting scheme does not guarantee universal verifiability, incoercibility, receipt-freeness or protection against hackers.  ... 
doi:10.1007/978-3-540-24852-1_4 fatcat:bby3qg77pne6jmwlr7ypi5rcp4

Laocoön: Scalable and Portable Receipt-free E-voting Protocol without Untappable Channels [article]

Shufan Zhang, Hu Xiong
2019 arXiv   pre-print
However, existing receipt-free voting protocols either rely on some impractical assumptions as untappable communication channel, or are burden with heavy voter-side computation and quadratic tallying complexity  ...  To deal with this problem, many voting protocols proposed their solutions with the notion of receipt-freeness.  ...  Since then, researchers commenced the three-decade long study on receipt-freeness. One stream of research leads to incoercible multi-party computation (MPC), e.g.  ... 
arXiv:1905.05562v1 fatcat:yy2lht2ikvc6pmam75o2n2osvu

A Linked-List Approach to Cryptographically Secure Elections Using Instant Runoff Voting [chapter]

Jason Keller, Joe Kilian
2008 Lecture Notes in Computer Science  
Few protocols have been devised for preferential voting systems, in which voters provide a list of rankings of the candidates, and many of those treat ballots as if they were ballots in a 1-out-of-n voting  ...  Most of these protocols focus on 1-out-of-n voting schemes.  ...  It should be noted that incoercibility does not follow from the generic multi-party solutions (though incoercibility can be generalized to this setting [6] ).  ... 
doi:10.1007/978-3-540-89255-7_13 fatcat:jqv2nlwo35dxtc3rwmzdvvnewm

Resource-Restricted Indifferentiability [chapter]

Grégory Demay, Peter Gaži, Martin Hirt, Ueli Maurer
2013 Lecture Notes in Computer Science  
This also implies the impossibility of such domain extension in any multi-party setting with potential individual misbehavior by parties (i.e., no central adversary).  ...  This means that a polynomial blow-up of the adversary's time and memory requirements is considered acceptable.  ...  We would like to thank Thomas Holenstein and Robin Künzler for valuable input and fruitful discussions at the early stages of this work.  ... 
doi:10.1007/978-3-642-38348-9_39 fatcat:hfq6n4fckjbzta3csowp2x65sm

Matters of Coercion-Resistance in Cryptographic Voting Schemes

Carmen Kempka
Furthermore, this work presents a taxonomy for analyzing and comparing a huge variety of voting schemes, and presents practical experiences with the voting scheme Bingo Voting.  ...  This work addresses coercion-resistance in cryptographic voting schemes. It focuses on three particularly challenging cases: write-in candidates, internet elections and delegated voting.  ...  So the adversary is assumed to see the number of messages each party sends. • Müller-Quade and Unruh [UMQ10] introduce the notion of universally composable incoercibility (UC/c), an extention of the  ... 
doi:10.5445/ir/1000041295 fatcat:chj7jfrqizgjpdjlwbpmbhd46e

Security matters:privacy in voting and fairness in digital exchange [article]

Jonker, HL (Hugo), Mauw, S (Sjouke), Baeten, JCM (Jos), Pang, J (Jun)
They raise the idea of receipt-freeness without untappable channels, similar to incoercible multi-party computation without untappable channels.  ...  The (multi-party) computations done for this occur inside a voting booth, which keeps the voter completely private.  ...  This reasoning coupled with the computational power necessary to handle the generation of the state space directed us to limit the scenario thusly.  ... 
doi:10.6100/ir643467 fatcat:vlcfc6brhvbzji4lwq5tlj43ie

Privacy-Oriented Cryptographic Primitives and Protocols for Electronic Voting [article]

Panagiotis M. Grontas, National Technological University Of Athens
Vote counting is also universally verifiable by any interested party.  ...  The evidence generated by PACBS accompanied with standard evidence used in e-voting schemes allows each voter to individually verify that their votes were correctly cast and tallied.  ...  The latter applies not only to voting schemes but to any protocol for secure multi-party computation.  ... 
doi:10.26240/heal.ntua.20947 fatcat:olbut6duufg7hf6zaqa7rhp324

Cryptography in a Quantum World [article]

Stephanie Wehner
2008 arXiv   pre-print
Quantum computing had a profound impact on cryptography.  ...  And, what limitations does entanglement impose on implementing quantum protocols? Finally, can we circumvent some of those limitations using realistic assumptions?  ...  This property is related, but stronger than the notion of incoercibility in secure multi-party protocols [CG96] .  ... 
arXiv:0806.3483v1 fatcat:br4tirmaundxnbvud3cjdoamgy

On Provable Security for Complex Systems

Dirk Achenbach
To this end we study how to model and prove security for concrete applications in three practical domains: computer networks, data outsourcing, and electronic voting.  ...  Computers are ubiquitous. They are critical for a multitude of operations in business, government, and society. Simultaneously they become ever more complex.  ...  EUF-CMA Secure Digital Signatures In our voting scheme, voters use unforgeable signatures to prove their eligibility (see Existential Unforgeability under Chosen-Message Attacks (EUF-CMA), Section 2.4.2  ... 
doi:10.5445/ir/1000052204 fatcat:wgma3o2ahfecdg7m6e43iuyt2q

Electronic voting in the classical and quantum settings: modelling, design and analysis [article]

Nikolaos Lamprou, University Of Edinburgh, Myrto Arapinis, Thomas Zacharias, Aggelos Kiayias
In this thesis, we formalize the requirements for secure STE schemes in the Universal Composability (UC) framework.  ...  All practical e-voting constructions rely on computational assumption to satisfy various properties such as privacy and verifiability.  ...  Her ethics and values will be a life lesson and inspiration for me.  ... 
doi:10.7488/era/1609 fatcat:atqbxn6ghja53e7n53ustdfwq4


The list is very long and, among them, I wish to thank my Supervisor Prof. Nicola Pasini and Prof. Herbert Kitschelt at Duke University for their precious support and advise.  ...  Acknowledgements During the preparation of this dissertation, I benefited from the knowledge of many Professors and colleagues to whom I am particularly grateful.  ...  The second group is composed of countries where ERPs have a middle-to-low vote percentage: i.e. in Wallonia, Greece, and Finland.  ... 
doi:10.13130/biassoni-davide_phd2011-07-06 fatcat:aftid3gigzbbflr57g2ie5npb4