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: | , , , |
|---|---|
| Formato: | Objeto de conferencia |
| Lenguaje: | Inglés |
| Publicado: |
2016
|
| Materias: | |
| Acceso en línea: | http://sedici.unlp.edu.ar/handle/10915/56374 |
| Aporte de: |
| Sumario: | 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 this situation, it may produce collisions.
A collision occurs when two or more votes are stored in the same slot.
It produces the loss of the coincident votes. This is the original model of the Non - Interactive Dining Cryptographers (NIDC) protocol.
The actual paper shows new achieved results obtained by analyzing the behaviour of a storage technique based on parallel channels. This scheme consists of replicating each vote in Q parallel channels, keeping the total number of slots (T) without variation. |
|---|