Book Chapter10.1007/3-540-58131-6_55
Cryptographic Protocols and Voting
Valtteri Niemi,Ari Renvall +1 more
- 10 Jun 1994
- pp 307-317
22
TL;DR: Three protocols related to computer voting are presented, one of which is an efficient ANDOS protocol which is based on a natural cryptographic assumption and the other two protocols attack a difficult problem in computer voting: buying of votes.
read more
Abstract: Three protocols related to computer voting are presented. First protocol is an efficient ANDOS protocol which is based on a natural cryptographic assumption. The other two protocols attack a difficult problem in computer voting: buying of votes. We manage to solve this problem but our protocols are impractical in large-scale elections.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
•Journal Article
A new and efficient all-or-nothing disclosure of secrets protocol
TL;DR: A new protocol which achieves the same functionality, but which is much more efficient and can easily be implemented is presented, which involves a novel use of computational zero-knowledge techniques combined with semantic security.
171
A New Efficient All-Or-Nothing Disclosure of Secrets Protocol
Julien P. Stern
- 18 Oct 1998
TL;DR: A new protocol which achieves the same functionality, but which is much more efficient and can easily be implemented and which is especially efficient when a large number of secrets is involved and it can be used in various applications.
Efficient k -out-of- n oblivious transfer schemes with adaptive and non-adaptive queries
Cheng-Kang Chu,Wen-Guey Tzeng +1 more
- 23 Jan 2005
TL;DR: Two-round k-out-of-n oblivious transfer schemes, in which R sends O(k) messages to S, and S sends O (n) messages back to R, which are the most efficient ones in terms of the communication cost, in both rounds and the number of messages.
Efficient 1-out-of-n oblivious transfer schemes with universally usable parameters
TL;DR: This work proposes efficient and secure (string) oblivious transfer (OT/sup 1//sub n/) schemes for any n/spl ges/2 and presents a method of transforming any (single-database) PIR protocol into a symmetric PIR Protocol by slightly increasing the communication cost only.
Efficient 1-Out-n Oblivious Transfer Schemes
Wen-Guey Tzeng
- 12 Feb 2002
TL;DR: An efficient (string) OTn1 scheme for any n ?
References
Untraceable electronic mail, return addresses, and digital pseudonyms
TL;DR: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system.
Untraceable Electronic Mail, Return Address and Digital Pseudonyms
David Chaum
- 01 Jan 1981
Abstract: A technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication - in spite of an unsecured underlying telecommunication system. The technique does not require a universally trusted authority. One correspondent can remain anonymous to a second, while allowing the second to respond via an untraceable return address. The technique can also be used to form rosters of untraceable digital pseudonyms from selected applications. Applicants retain the exclusive ability to form digital signatures corresponding to their pseudonyms. Elections in which any interested party can verify that the ballots have been properly counted are possible if anonymously mailed ballots are signed with pseudonyms from a roster of registered voters. Another use allows an individual to correspond with a record-keeping organization under a unique pseudonym, which appears in a roster of acceptable clients.
3K
Untraceable Electronic Mail, Return Addresses and Digital Pseudonyms.
David Chaum
- 01 Jan 2003
TL;DR: In this article, a technique based on public key cryptography is presented that allows an electronic mail system to hide who a participant communicates with as well as the content of the communication -in spite of an unsecured underlying telecommunication system.
2.8K
•Dissertation
Verifiable secret-ballot elections
Josh Benaloh
- 01 Jan 1987
TL;DR: This thesis describes a practical scheme for conducting secret-ballot elections in which the outcome of an election is verifiable by all participants and even by non-participating observers.
Related Papers (5)
Gilles Brassard,Claude Crépeau,Jean-Marc Robert +2 more
- 01 Jan 1987
Atsushi Fujioka,Tatsuaki Okamoto,Kazuo Ohta +2 more
- 13 Dec 1992