#### Filter Results:

- Full text PDF available (5)

#### Publication Year

2011

2016

- This year (0)
- Last 5 years (7)
- Last 10 years (8)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Alex Escala, Gottfried Herold, Eike Kiltz, Carla Ràfols, Jorge Luis Villar
- Journal of Cryptology
- 2013

We put forward a new algebraic framework to generalize and analyze Diffie–Hellman like decisional assumptions which allows us to argue about security and applications by considering only algebraic properties. Our $$\mathcal {D}_{\ell ,k}\text{- }\textsf {MDDH}$$ D ℓ , k - MDDH Assumption states that it is hard to decide whether a vector in $$\mathbb… (More)

- Alex Escala, Javier Herranz, Paz Morillo
- AFRICACRYPT
- 2011

An attribute-based signature with respect to a signing policy, chosen ad-hoc by the signer, convinces the verifier that the signer holds a subset of attributes satisfying that signing policy. Ideally, the verifier must obtain no other information about the identity of the signer or the attributes he holds. This primitive has many applications in real… (More)

- Alex Escala, Jens Groth
- Public Key Cryptography
- 2013

Groth-Sahai proofs are efficient non-interactive zero-knowledge proofs that have found widespread use in pairingbased cryptography. We propose efficiency improvements of Groth-Sahai proofs in the SXDH setting, which is the one that yields the most efficient non-interactive zero-knowledge proofs. – We replace some of the commitments with ElGamal encryptions,… (More)

- Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols
- Public Key Cryptography
- 2014

- Alex Escala, Javier Herranz, Benoît Libert, Carla Ràfols
- IACR Cryptology ePrint Archive
- 2012

Lossy trapdoor functions, introduced by Peikert and Waters (STOC’08), have received a lot of attention in the last years, because of their wide range of applications in theoretical cryptography. The notion has been recently extended to the identity-based scenario by Bellare et al. (Eurocrypt’12). We provide one more step in this direction, by considering… (More)

- Alex Escala, Sandra Guasch, Javier Herranz, Paz Morillo
- Financial Cryptography Workshops
- 2016

- Pedro Bibiloni, Alex Escala, Paz Morillo
- VOTE-ID
- 2015

One way to build secure electronic voting systems is to use Mix-Nets, which break any correlation between voters and their votes. One of the characteristics of Mix-Net-based eVoting is that ballots are usually decrypted individually and, as a consequence, invalid votes can be detected during the tallying of the election. In particular, this means that the… (More)

- Jordi Cucurull-Juan, Sandra Guasch, Alex Escala, Guillermo Navarro-Arribas, Víctor Acín
- 2014 11th International Conference on Security…
- 2014

Quick Response (QR) codes, used to store machine readable information, have become very commonnowa days and have found many applications in different scenarios. One of such applications is electronic voting systems. Indeed, some electronic voting systems are starting to take advantage of these codes, e.g. to hold the ballots used to vote, or even as a proof… (More)

- ‹
- 1
- ›