Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting
Resumo
All voting protocols proposed so far, with the exception of a few, have the property that the privacy of the ballot is only computational. In this paper we outline a new and conceptually simple approach allowing us to construct a protocol in which the privacy of the ballot is unconditional. Our basic idea is to modify the protocol of Fujioka, Okamoto and Ohta[10], which uses blind signatures so that the voter can obtain a valid ballot. However, instead of using a MIX net, we use a new broadcast protocol for anonymously publishing the vote, a non-interactive variation of the Dining Cryptographer Net.
Referências
Bos, J.N.E. Practical Privacy, PhD Thesis, http://citeseer.ist.psu.edu/bos92practical.html.
Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
Chaum, D. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1, 1988, pages 65–75.
Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
Cramer, R., Gennaro, R., Schoenmakers, B., A Secure and Optimally Efficient Multi-Authority Election Scheme. CRYPTO 97 http://citeseer.ist.psu.edu/cramer97secure.html.
Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.Multi-Authority Secret Ballot Elections with Linear Work. EUROCRYPTO 96 http://citeseer.ist.psu.edu/cramer96multiauthority.html.
Crépeau, C., van de Graaf, J. and Tapp, A. Committed Oblivious Transfer and Private Multy-Party Computation CRYPTO’95, Springer, LNCS, vol. 963, 1995, pp.110-123.
Jakobsson,M., Juels, A. and Rivest, R. Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking (published where?).
Moran, T. and Naor, M. Receipt-Free Universally-Verifiable Voting With Everlasting Privacy, CRYPTO 2006.
Fujioka, Okamoto, Ohta A Practical Secret Voting Scheme For Large Scale Elections. (AUSCRYPT ’92). See [link].
Traoré, J., Arditti, D. e Girault, M. Voting protocols— state of the art and e-poll project. [link].
Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
Chaum, D. The Dining Cryptographers Problem: Unconditional Sender and Recipient Untraceability. Journal of Cryptology, 1, 1988, pages 65–75.
Chaum, D. Untraceable electronic mail, return addresses, and digital pseudonyms. Communications of the ACM, 24(2):84-88, 1981.
Cramer, R., Gennaro, R., Schoenmakers, B., A Secure and Optimally Efficient Multi-Authority Election Scheme. CRYPTO 97 http://citeseer.ist.psu.edu/cramer97secure.html.
Cramer, R., Franklin, M., Schoenmakers, B., Yung, M.Multi-Authority Secret Ballot Elections with Linear Work. EUROCRYPTO 96 http://citeseer.ist.psu.edu/cramer96multiauthority.html.
Crépeau, C., van de Graaf, J. and Tapp, A. Committed Oblivious Transfer and Private Multy-Party Computation CRYPTO’95, Springer, LNCS, vol. 963, 1995, pp.110-123.
Jakobsson,M., Juels, A. and Rivest, R. Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking (published where?).
Moran, T. and Naor, M. Receipt-Free Universally-Verifiable Voting With Everlasting Privacy, CRYPTO 2006.
Fujioka, Okamoto, Ohta A Practical Secret Voting Scheme For Large Scale Elections. (AUSCRYPT ’92). See [link].
Traoré, J., Arditti, D. e Girault, M. Voting protocols— state of the art and e-poll project. [link].
Publicado
27/08/2007
Como Citar
VAN DE GRAAF, Jeroen.
Anonymous one-time broadcast using non-interactive dining cryptographer nets with applications to voting. In: SIMPÓSIO BRASILEIRO DE SEGURANÇA DA INFORMAÇÃO E DE SISTEMAS COMPUTACIONAIS (SBSEG), 7. , 2007, Rio de Janeiro.
Anais [...].
Porto Alegre: Sociedade Brasileira de Computação,
2007
.
p. 67-78.
DOI: https://doi.org/10.5753/sbseg.2007.20918.