Javier Herranz
YOU?
Author Swipe
View article: (k, n)-Consecutive access structures
(k, n)-Consecutive access structures Open
We consider access structures over a set of n participants, defined by a parameter k with $$1 \le k \le n$$ in the following way: a subset is authorized if it contains at least k consecutive participants. Depending on whether we con…
View article: On remote electronic voting with both coercion resistance and cast-as-intended verifiability
On remote electronic voting with both coercion resistance and cast-as-intended verifiability Open
In this work, we study two essential but apparently contradictory properties of electronic voting systems: coercion resistance (CR) and cast-as-intended verifiability (CAI). Informally, the CR property ensures that a voter cannot prove to …
View article: Ideal Homogeneous Access Structures Constructed from Graphs
Ideal Homogeneous Access Structures Constructed from Graphs Open
Starting from a new relation between graphs and secret sharing schemes introduced by Xiao, Liu and Zhang, we show a method to construct more general ideal homogeneous access structures. The method has some advantages: it efficiently gives …
View article: Attacking Pairing-Free Attribute-Based Encryption Schemes
Attacking Pairing-Free Attribute-Based Encryption Schemes Open
Combining several results that have been published in the last years, it is known that it is impossible to design simple and secure attribute-based encryption schemes that work in (classical) settings like the RSA or the pairing-free discr…