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...
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: | SEDICI (UNLP) de Universidad Nacional de La Plata Ver origen |
id |
I19-R120-10915-56374 |
---|---|
record_format |
dspace |
spelling |
I19-R120-10915-563742019-01-05T20:03:39Z http://sedici.unlp.edu.ar/handle/10915/56374 Loss of Votes in NIDC Applying Storage in Parallel Channels García, Pablo Montejano, Germán Antonio Bast, Silvia Gabriela Fritz, Estela 2016-10 2016 2016-11-03T16:29:07Z en Ciencias Informáticas Non - Interactive Dining Cryptographers 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. V Workshop de Seguridad Informática. Red de Universidades con Carreras en Informática (RedUNCI) Objeto de conferencia Objeto de conferencia http://creativecommons.org/licenses/by-nc-sa/4.0/ Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) application/pdf 1135-1144 |
institution |
Universidad Nacional de La Plata |
institution_str |
I-19 |
repository_str |
R-120 |
collection |
SEDICI (UNLP) |
language |
Inglés |
topic |
Ciencias Informáticas Non - Interactive Dining Cryptographers |
spellingShingle |
Ciencias Informáticas Non - Interactive Dining Cryptographers García, Pablo Montejano, Germán Antonio Bast, Silvia Gabriela Fritz, Estela Loss of Votes in NIDC Applying Storage in Parallel Channels |
topic_facet |
Ciencias Informáticas Non - Interactive Dining Cryptographers |
description |
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. |
format |
Objeto de conferencia Objeto de conferencia |
author |
García, Pablo Montejano, Germán Antonio Bast, Silvia Gabriela Fritz, Estela |
author_facet |
García, Pablo Montejano, Germán Antonio Bast, Silvia Gabriela Fritz, Estela |
author_sort |
García, Pablo |
title |
Loss of Votes in NIDC Applying Storage in Parallel Channels |
title_short |
Loss of Votes in NIDC Applying Storage in Parallel Channels |
title_full |
Loss of Votes in NIDC Applying Storage in Parallel Channels |
title_fullStr |
Loss of Votes in NIDC Applying Storage in Parallel Channels |
title_full_unstemmed |
Loss of Votes in NIDC Applying Storage in Parallel Channels |
title_sort |
loss of votes in nidc applying storage in parallel channels |
publishDate |
2016 |
url |
http://sedici.unlp.edu.ar/handle/10915/56374 |
work_keys_str_mv |
AT garciapablo lossofvotesinnidcapplyingstorageinparallelchannels AT montejanogermanantonio lossofvotesinnidcapplyingstorageinparallelchannels AT bastsilviagabriela lossofvotesinnidcapplyingstorageinparallelchannels AT fritzestela lossofvotesinnidcapplyingstorageinparallelchannels |
_version_ |
1734131519770853376 |