Vote-Independence: A Powerful Privacy Notion for Voting Protocols

International audienceRecently an attack on ballot privacy in Helios has been discovered [20], which is essentially based on copying other voter's votes. To capture this and similar attacks, we extend the classical threat model and introduce a new security notion for voting protocols: Vote-Independence. We give a formal definition and analyze its relationship to established privacy properties such as Vote-Privacy, Receipt-Freeness and Coercion-Resistance. In particular we show that even Coercion-Resistant protocols do not necessarily ensure Vote-Independence

DRE-ip : A Verifiable E-Voting Scheme without Tallying Authorities

Nearly all verifiable e-voting schemes require trustworthy authorities to perform the tallying operations. An exception is the DRE-i system which removes this requirement by pre-computing all encrypted ballots before the election using random factors that will later cancel out and allow the public to verify the tally after the election. While the removal of tallying authorities significantly simplifies election management, the pre-computation of ballots necessitates secure ballot storage, as leakage of precomputed ballots endangers voter privacy. In this paper, we address this problem and propose DRE-ip (DRE-i with enhanced privacy). Adopting a different design strategy, DRE-ip is able to encrypt ballots in real time in such a way that the election tally can be publicly verified without decrypting the cast ballots. As a result, DRE-ip achieves end-to-end verifiability without tallying authorities, similar to DRE-i, but with a significantly stronger guarantee on voter privacy. In the event that the voting machine is fully compromised, the assurance on tallying integrity remains intact and the information leakage is limited to the minimum: only the partial tally at the time of compromise is leaked

Versatile Prêt à Voter: Handling Multiple Election Methods with a Unified Interface

A number of end-to-end veri¯able voting schemes have been introduced recently. These schemes aim to allow voters to verify that their votes have contributed in the way they intended to the tally and in addition allow anyone to verify that the tally has been generated correctly. These goals must be achieved while maintaining voter privacy and providing receipt-freeness. However, most of these end-to-end voting schemes are only designed to handle a single election method and the voter interface varies greatly between different schemes. In this paper, we introduce a scheme which handles many of the popular election methods that are currently used around the world. Our scheme not only ensures privacy, receipt-freeness and end-to-end veri¯ability, but also keeps the voter interface simple and consistent between various election methods

Constant-Round Group Key Exchange from the Ring-LWE Assumption

Group key-exchange protocols allow a set of N parties to agree on a shared, secret key by communicating over a public network. A number of solutions to this problem have been proposed over the years, mostly based on variants of Diffie-Hellman (two-party) key exchange. There has been relatively little work, however, looking at candidate post-quantum group key-exchange protocols. Here, we propose a constant-round protocol for unauthenticated group key exchange (i.e., with security against a passive eavesdropper) based on the hardness of the Ring-LWE problem. By applying the Katz-Yung compiler using any post-quantum signature scheme, we obtain a (scalable) protocol for authenticated group key exchange with post-quantum security. Our protocol is constructed by generalizing the Burmester-Desmedt protocol to the Ring-LWE setting, which requires addressing several technical challenges

Security enhanced multi-hop over the air reprogramming with fountain codes

No description supplie

Dielectric and rheological properties of polyaniline organic dispersions

This paper reports the examination of the evolution of polyaniline-organic solvent interactions in the temperature range of 294–353 K. For this purpose, rheological and dielectric investigations have been undertaken for dispersions of plast-doped polyaniline in two different solvents (dichloroacetic acid and formic acid/dichloroacetic acid mixture). Dielectric permittivity has been investigated using the open ended coaxial line method in the frequency range of [100 MHz, 10 GHz]. Dielectric loss spectra of both dispersions showed a relaxation peak which was well fitted by Havriliak-Negami function. The relaxation was attributed to a Maxwell Wagner Sillars relaxation within polyaniline clusters. The difference found between relaxation parameters of the pure solvent and polyaniline dispersions was attributed to the solvent/polyaniline interactions. The relaxation time relative to the PANI/DCAA dispersion followed an Arrhenius law. While a Vogel-Fulcher-Tammann law was found for the relaxation time of PANI/DCAA-FA dispersion. Above a certain temperature, 318 K for PANI/DCAA and 313 K for PANI/DCAA-FA, the rheological parameters of the dispersions changed, thus indicating a morphological change of polyaniline in the dispersion. In the same range of temperature, α and β relaxation parameters undergo significant changes. Those changes in dielectric and rheological parameters seem to be related to a structural change occurring in the polyaniline organic dispersion systems while increasing temperature. An interesting correlation between permittivity and viscosity was obtained