Ponències/Comunicacions de congressos
Recent Submissions
-
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 ... -
Firmas digitales con verificación distribuida en el modelo de seguridad estándar
(2012)
Conference report
Open AccessLas firmas digitales con verificaci´on distribuida protegen en cierta manera el nivel de anonimato o privacidad del firmante, ya que un subconjunto autorizado de usuarios deben colaboran para verificar la (in)validez ... -
On method-specific record linkage for risk assessment
(2007)
Conference report
Open AccessNowadays, the need for privacy motivates the use of methods that permit us to protect a microdata file both minimizing the disclosure risk and preserving the statistical utility. Nevertheless, research is usually focused ... -
Anonymous subscription schemes : a flexible fonstruction for on-line services access
(IEEE Press. Institute of Electrical and Electronics Engineers, 2010)
Conference report
Restricted access - publisher's policyIn traditional e-cash systems, the tradeoff between anonymity and fraud-detection is solved by hiding the identity of the user into the e-coin, and providing an additional triggering mechanism that opens this identity in ... -
A fair and abuse-free contract signing protocol from Boneh-Boyen signature
(Springer Verlag, 2010)
Conference report
Restricted access - publisher's policyA fair contract signing protocol is used to enable two mistrusted parties to exchange two signatures on a given contract, in such a way that either both of them get the other party’s signature, or none of them gets anything. ...
RSS 1.0