A systematic method for choosing optimal parameters for storage in parallel channels of slots

In many applications, such as e-voting, it is imperative that the privacy reaches a level of unconditional security. In this context, protocols that verify that condition reach maximum interest. Probably, the most interesting of them is Non Interactive Dining cryptographers (NIDC), which relaxes the condition of concurrency online for all participants. NIDC proposes to store the vote on a table of slots, demanding that the selection of the location of each vote is truly random. However, the probability that two votes are accommodated in the same slot (collision) is positive. And if that event occurs, both votes are lost. This paper, after reviewing records which demonstrate that it is preferable to use multiple parallel channels while maintaining the original number of slots, proposes a systematic method to get the optimum for each of the parameters involved values: number of channels, measure them and probability level required for the event "no vote is lost." Additionally, the proposed solutions are enhanced, suggesting a way to work on collisions.