Ponències/Comunicacions de congressos
Recent Submissions
-
Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle
(Springer, 2021)
Conference report
Restricted access - publisher's policyIn an electronic voting procedure, mixing networks are used to ensure anonymity of the casted votes. Each node of the network re-encrypts the input list of ciphertexts and randomly permutes it in a process named shuffle, ... -
Understanding the implications of the future unmanned air traffic growth
(Institute of Electrical and Electronics Engineers (IEEE), 2021)
Conference lecture
Open AccessIn the next years, the unmanned air business is expected to have an average annual growth rate of 14.5 per cent. Last-mile delivery, inspection works and security tasks are the most expected missions that those unmanned ... -
Structure-preserving and re-randomizable RCCA-secure Public Key Encryption and its applications
(Springer, 2019)
Conference report
Restricted access - publisher's policyRe-randomizable RCCA-secure public key encryption (Rand-RCCA PKE) schemes reconcile the property of re-randomizability of the ciphertexts with the need of security against chosen-ciphertexts attacks. In this paper we give ... -
Efficient polynomial delegation under standard assumptions
(Institute of Electrical and Electronics Engineers (IEEE), 2013)
Conference lecture
Restricted access - publisher's policyIn this paper we present a new scheme for verifiable delegation of polynomials in a cloud computing scenario. The security of our scheme is based on a standard assumption, the subgroup membership one. Furthermore, the ... -
Lattice-Based proof of a shuffle
(2019)
Conference report
Open AccessIn this paper we present the first fully post-quantum proof of a shuffle for RLWE encryption schemes. Shuffles are commonly used to construct mixing networks (mix-nets), a key element to ensure anonymity in many applications ... -
RLWE-Based Zero-Knowledge Proofs for Linear and Multiplicative Relations
(Springer International Publishing, 2019)
Conference report
Restricted access - publisher's policyWe present efficient Zero-Knowledge Proofs of Knowledge (ZKPoK) for linear and multiplicative relations among secret messages hidden as Ring Learning With Errors (RLWE) samples. Messages are polynomials in $\mathbb{Z}_q[ ... -
Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems
(Springer, 2017)
Conference lecture
Open AccessIn this paper we provide new algebraic tools to study the relationship between different Matrix Diffie-Hellman (MDDH) Problems, which are recently introduced as a natural generalization of the so-called Linear Problem. ... -
Ideal hierarchical secret sharing schemes
(Springer, 2010)
Conference report
Open AccessHierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention from the invention of secret sharing until nowadays. Several constructions of ideal ... -
Optimal non-perfect uniform secret sharing schemes
(Springer, 2014)
Conference report
Open AccessA secret sharing scheme is non-perfect if some subsets of participants that cannot recover the secret value have partial information about it. The information ratio of a secret sharing scheme is the ratio between the maximum ... -
The Kernel Matrix Diffie-Hellman assumption
(Springer, 2016)
Conference lecture
Open AccessWe put forward a new family of computational assumptions, the Kernel Matrix Diffie-Hellman Assumption. Given some matrix A sampled from some distribution D, the kernel assumption says that it is hard to find “in the exponent” ... -
Small primitive roots and malleability of RSA
(2012)
Conference report
Open AccessIn their paper [9], P. Paillier and J. Villar make a conjectur e about the malleability of an RSA modulus. In this paper we present an ex plicit algo- rithm refuting the conjecture. Concretely we can factorize an RSA ... -
Cifrado homomorfico de clave publica basado en Residuosidad Cuadratica
(2012)
Conference report
Open AccessLos esquemas de cifrado de clave p´ ublica con propiedades homom´orficas tienen muchas utilidades en aplicaciones reales. Entre los esquemas con propiedades homom´orficas aditivas existentes, hay una familia (desde el ...
RSS 1.0