Articles de revista
Recent Submissions
-
R-LWE-Based distributed key generation and threshold decryption
(Multidisciplinary Digital Publishing Institute (MDPI), 2022-02-25)
Article
Open AccessEver since the appearance of quantum computers, prime factoring and discrete logarithm based cryptography has been put in question, giving birth to the so called post-quantum cryptography. The most prominent field in ... -
Common information, matroid representation, and secret sharing for matroid ports
(2020-09-28)
Article
Open AccessLinear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them ... -
Improving the linear programming technique in the search for lower bounds in secret sharing
(2020-11)
Article
Open AccessWe present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. ... -
Attacking pairing-free attribute-based encryption schemes
(Institute of Electrical and Electronics Engineers (IEEE), 2020)
Article
Open AccessCombining 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 ... -
Mixed integration of CDIO skills into telecommunication engineering curricula
(2010)
Article
Open AccessSpain has been intensively involved in designing engineering curricula for the last two years and next academic year all engineering schools will be deploying all bachelor programs adapted to the EHEA and to the Spanish ... -
Secret sharing schemes for (k, n)-consecutive access structures
(Springer, 2018-09-01)
Article
Restricted access - publisher's policyWe consider access structures over a set P of n participants, defined by a parameter k with 1 = k = n in the following way: a subset is authorized if it contains participants i, i + 1,...,i + k - 1, for some i ¿ {1,...,n-k+1}. ... -
On the information ratio of non-perfect secret sharing schemes
(2017-12-01)
Article
Open AccessA secret sharing scheme is non-perfect if some subsets of players 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 ... -
An algebraic framework for Diffie-Hellman assumptions
(2017-01)
Article
Open AccessWe put forward a new algebraic framework to generalize and analyze Di e-Hellman like Decisional Assumptions which allows us to argue about security and applications by considering only algebraic properties. Our D`;k-MDDH ... -
Equivalences and black-box separations of Matrix Diffie-Hellman problems
(2017-02)
Article
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. ... -
Attribute-based encryption implies identity-based encryption
(2017-11-01)
Article
Open AccessIn this study, the author formally proves that designing attribute-based encryption schemes cannot be easier than designing identity-based encryption schemes. In more detail, they show how an attribute-based encryption ... -
On the optimization of bipartite secret sharing schemes
(2012-05-01)
Article
Open AccessOptimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this ... -
Ideal hierarchical secret sharing schemes
(2012-01-24)
Article
Open AccessHierarchical secret sharing is among the most natural generalizations of threshold secret sharing, and it has attracted a lot of attention since the invention of secret sharing until nowadays. Several constructions of ideal ...
RSS 1.0