Upload resources

Upload your works to SEDICI to increase its visibility and improve its impact

 

Loss of Votes in NIDC Applying Storage in Parallel Channels

Document type: Objeto de conferencia

Abstract

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.

Notes

V Workshop de Seguridad Informática.

General information

Exposure date: octubre 2016
Issue date: 2016
Document language: English
Event: XXII Congreso Argentino de Ciencias de la Computación (CACIC 2016).
Origin: Red de Universidades con Carreras en Informática (RedUNCI)
Pages: 1135-1144
xmlui.dri2xhtml.METS-1.0.item-dc-subject: Non - Interactive Dining Cryptographers
Subjects: Ciencias Informáticas

Related documents

Download Files

Thumbnail
Documento completo
Download file (829.4Kb) - PDF
 
Created: 3 de noviembre de 2016
Available since: 3 de noviembre de 2016
Please, use one of this identificators(URI) for cite o linking this item:
  • http://sedici.unlp.edu.ar/handle/10915/56374

    • This item appears in the following Collection(s)

    Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) Except where otherwise noted, this item's license is described as Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)