Publications associées à VOTEAGAIN: A scalable coercion-resistant voting system

Robust Sparse Voting

Rachid Guerraoui, Youssef Allouah, Oscar Jean Olivier Villemaud, Le Nguyen Hoang

Many applications, such as content moderation and recommendation, require reviewing and scoring a large number of alternatives. Doing so robustly is however very challenging. Indeed, voters' inputs are inevitably sparse: most alternatives are only scored b ...

2024

Predicting party switching through machine learning and open data

Silvestro Micera, Emanuele Rossi

Parliament dynamics might seem erratic at times. Predicting future voting patterns could support policy design based on the simulation of voting scenarios. The availability of open data on legislative activities and machine learning tools might enable such ...

CELL PRESS2023

Attacks on some post-quantum cryptographic protocols: The case of the Legendre PRF and SIKE

Novak Kaluderovic

Post-quantum cryptography is a branch of cryptography which deals with cryptographic algorithms whose hardness assumptions are not based on problems known to be solvable by a quantum computer, such as the RSA problem, factoring or discrete logarithms. This ...

EPFL2022

On Polar Coding For Finite Blocklength Secret Key Generation Over Wireless Channels

Yanina Yurina Shkel

We consider the problem of secret key generation from correlated Gaussian random variables in the finite blocklength regime. Such keys could be used to encrypt communication in IoT networks, and have provable secrecy guarantees in contrast to classic crypt ...

IEEE2020

Implications of Position in Cryptography

Handan Kilinç Alper

In our daily lives, people or devices frequently need to learn their location for many reasons as some services depend on the absolute location or the proximity. The outcomes of positioning systems can have critical effects e.g., on military, emergency. Th ...

EPFL2018

Efficient Public-Key Distance Bounding Protocol

Serge Vaudenay, Handan Kilinç Alper

Distance bounding protocols become more and more important because they are the most accurate solution to defeat relay attacks. They consist of two parties: a verifier and a prover. The prover shows that (s)he is close enough to the verifier. In some appli ...

Springer-Verlag Berlin2016

Secure Wireless Communications via Cooperative Transmitting

Ninoslav Marina

Information-theoretic secrecy is combined with cryptographic secrecy to create a secret-key exchange protocol for wireless networks. A network of transmitters, which already have cryptographically secured channels between them, cooperate to exchange a secr ...

Hindawi Publishing Corporation2014

Secure and Private Proofs for Location-Based Activity Summaries in Urban Areas

Jean-Pierre Hubaux, Kévin Clément Huguenin, Igor Bilogrevic, Thi Van Anh Pham

Activity-based social networks, where people upload and share information about their location-based activities (e.g., the routes of their activities), are increasingly popular. Such systems, however, raise privacy and security issues: the service provider ...

2014

Bounded Tamper Resilience: How to go beyond the Algebraic Barrier

Sebastian Faust

Related key attacks (RKAs) are powerful cryptanalytic attacks where an adversary can change the secret key and observe the effect of such changes at the output. The state of the art in RKA security protects against an a-priori unbounded number of certain a ...

2013

Statistical and Algebraic Cryptanalysis of Lightweight and Ultra-Lightweight Symmetric Primitives

Pouyan Sepehrdad

Symmetric cryptographic primitives such as block and stream ciphers are the building blocks in many cryptographic protocols. Having such blocks which provide provable security against various types of attacks is often hard. On the other hand, if possible, ...

EPFL2012