Loss of Votes in NIDC Applying Storage in Parallel Channels
Birthday Paradox states that in a group of 23 people, the probability that there are at least two who share the same birthday is very close to 1 2 . This assertion is unacceptable for any scheme that proposes a vote storage method based on a vector of slots whose position is chosen at random. In thi...
Guardado en:
| Autores principales: | García, Pablo, Montejano, Germán Antonio, Bast, Silvia Gabriela, Fritz, Estela |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/56374 |
| Aporte de: |
Ejemplares similares
-
Optimización de un esquema “Ocuppancy Problem” orientado a E - Voting
por: Graaf, Jeroen van de, et al.
Publicado: (2013) -
Anonimato en sistemas de voto electrónico
por: Graaf, Jeroen van de, et al.
Publicado: (2014) -
Efficient Votes Storage in a Non-Interactive Dining Cryptographers (NIDC) Protocol
por: García, Pablo, et al.
Publicado: (2017) -
Implementación de canales paralelos en un protocolo Non Interactive Dining Cryptographers
por: Garcia, Pablo, et al.
Publicado: (2014) -
Cryptographic algorithms for communicating results from distributed electronic voting systems
por: Villagarcía Wanza, Horacio A.
Publicado: (2005)