Ponències/Comunicacions de congressos
Enviaments recents
-
Equivalences and Black-Box Separations of Matrix Diffie-Hellman Problems
(Springer, 2017)
Comunicació de congrés
Accés obertIn 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)
Text en actes de congrés
Accés obertHierarchical 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)
Text en actes de congrés
Accés obertA 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)
Comunicació de congrés
Accés obertWe 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)
Text en actes de congrés
Accés obertIn 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)
Text en actes de congrés
Accés obertLos 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)
Text en actes de congrés
Accés obertLas 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)
Text en actes de congrés
Accés obertNowadays, 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)
Text en actes de congrés
Accés restringit per política de l'editorialIn 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)
Text en actes de congrés
Accés restringit per política de l'editorialA 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. ... -
A cryptographic solution for private distributed simple meeting scheduling
(IOS Press, 2009)
Text en actes de congrés
Accés obertMeeting scheduling is a suitable application for distributed computation motivated by its privacy requirements. Previous work on this problem have considered some cryptographic and conceptually clear approach to solve a ... -
Attribute selection in multivariate microaggregation
(2008)
Text en actes de congrés
Accés restringit per política de l'editorialMicroaggregation is one of the most employed microdata protection methods. The idea is to build clusters of at least k original records, and then replace them with the centroid of the cluster. When the number of attributes ...
RSS 1.0