Loss of Votes in NIDC Applying Storage in Parallel Channels

Autores
García, Pablo; Montejano, Germán Antonio; Bast, Silvia Gabriela; Fritz, Estela
Año de publicación
2016
Idioma
inglés
Tipo de recurso
documento de conferencia
Estado
versión publicada
Descripción
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)
Materia
Ciencias Informáticas
Non - Interactive Dining Cryptographers
Nivel de accesibilidad
acceso abierto
Condiciones de uso
http://creativecommons.org/licenses/by-nc-sa/4.0/
Repositorio
SEDICI (UNLP)
Institución
Universidad Nacional de La Plata
OAI Identificador
oai:sedici.unlp.edu.ar:10915/56374
Acceder
id SEDICI_8a0da09c1dadfafae24df3e1140b69ac
oai_identifier_str oai:sedici.unlp.edu.ar:10915/56374
network_acronym_str SEDICI
repository_id_str 1329
network_name_str SEDICI (UNLP)
spelling Loss of Votes in NIDC Applying Storage in Parallel ChannelsGarcía, PabloMontejano, Germán AntonioBast, Silvia GabrielaFritz, EstelaCiencias InformáticasNon - Interactive Dining CryptographersBirthday 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)2016-10info:eu-repo/semantics/conferenceObjectinfo:eu-repo/semantics/publishedVersionObjeto de conferenciahttp://purl.org/coar/resource_type/c_5794info:ar-repo/semantics/documentoDeConferenciaapplication/pdf1135-1144http://sedici.unlp.edu.ar/handle/10915/56374enginfo:eu-repo/semantics/reference/hdl/10915/55718info:eu-repo/semantics/openAccesshttp://creativecommons.org/licenses/by-nc-sa/4.0/Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)reponame:SEDICI (UNLP)instname:Universidad Nacional de La Platainstacron:UNLP2025-09-03T10:38:41Zoai:sedici.unlp.edu.ar:10915/56374Institucionalhttp://sedici.unlp.edu.ar/Universidad públicaNo correspondehttp://sedici.unlp.edu.ar/oai/snrdalira@sedici.unlp.edu.arArgentinaNo correspondeNo correspondeNo correspondeopendoar:13292025-09-03 10:38:41.45SEDICI (UNLP) - Universidad Nacional de La Platafalse
dc.title.none.fl_str_mv Loss of Votes in NIDC Applying Storage in Parallel Channels
title Loss of Votes in NIDC Applying Storage in Parallel Channels
spellingShingle Loss of Votes in NIDC Applying Storage in Parallel Channels
García, Pablo
Ciencias Informáticas
Non - Interactive Dining Cryptographers
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
dc.creator.none.fl_str_mv García, Pablo
Montejano, Germán Antonio
Bast, Silvia Gabriela
Fritz, Estela
author García, Pablo
author_facet García, Pablo
Montejano, Germán Antonio
Bast, Silvia Gabriela
Fritz, Estela
author_role author
author2 Montejano, Germán Antonio
Bast, Silvia Gabriela
Fritz, Estela
author2_role author
author
author
dc.subject.none.fl_str_mv Ciencias Informáticas
Non - Interactive Dining Cryptographers
topic Ciencias Informáticas
Non - Interactive Dining Cryptographers
dc.description.none.fl_txt_mv 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)
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.
publishDate 2016
dc.date.none.fl_str_mv 2016-10
dc.type.none.fl_str_mv info:eu-repo/semantics/conferenceObject
info:eu-repo/semantics/publishedVersion
Objeto de conferencia
http://purl.org/coar/resource_type/c_5794
info:ar-repo/semantics/documentoDeConferencia
format conferenceObject
status_str publishedVersion
dc.identifier.none.fl_str_mv http://sedici.unlp.edu.ar/handle/10915/56374
url http://sedici.unlp.edu.ar/handle/10915/56374
dc.language.none.fl_str_mv eng
language eng
dc.relation.none.fl_str_mv info:eu-repo/semantics/reference/hdl/10915/55718
dc.rights.none.fl_str_mv info:eu-repo/semantics/openAccess
http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
eu_rights_str_mv openAccess
rights_invalid_str_mv http://creativecommons.org/licenses/by-nc-sa/4.0/
Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)
dc.format.none.fl_str_mv application/pdf
1135-1144
dc.source.none.fl_str_mv reponame:SEDICI (UNLP)
instname:Universidad Nacional de La Plata
instacron:UNLP
reponame_str SEDICI (UNLP)
collection SEDICI (UNLP)
instname_str Universidad Nacional de La Plata
instacron_str UNLP
institution UNLP
repository.name.fl_str_mv SEDICI (UNLP) - Universidad Nacional de La Plata
repository.mail.fl_str_mv alira@sedici.unlp.edu.ar
_version_ 1842260246812164096
score 13.13397

Publicaciones similares