Storage Optimization for Non Interactive Dining Cryptographers (NIDC)

In many applications, such as e-voting, it is imperative that the privacy scope unconditional security levels, i.e. that it is protected regardless of the resources and the time available to attack. In this context, protocols that verify that condition reach maximum interest. Probably, the most interesting of them is Non Interactive Dining cryptographers (NIDC), that relaxes the condition of concurrency online for all participants. This paper proposes a new technique, based in parallel channels, to optimize the storage of the votes in the model NIDC.