Pasar al contenido principal

CRIPTOGRAFIA AVANZADA PARA AFRONTAR NUEVOS RETOS DE LA SOCIEDAD DIGITAL

MTM2016-77213-R

•
Nombre agencia financiadora Agencia Estatal de Investigación
Acrónimo agencia financiadora AEI
Programa Programa Estatal de I+D+i Orientado a los Retos de la Sociedad
Convocatoria Proyectos I+D+i Retos de Investigación
Año convocatoria 2016
Plan Estatal 2013-2016 Plan Estatal de Investigación Científica y Técnica y de Innovación
Centro beneficiario UNIVERSITAT POLITECNICA DE CATALUNYA

Resultados relacionados

Resultados totales (Incluyendo duplicados): 4
Encontrada(s) 1 página(s)

Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Attacking pairing-free attribute-based encryption schemes

  • Herranz Sotoca, Javier
Combining 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 pairing-free discrete logarithm ones. The purpose of this article is to broadcast this message through a wide (maybe non-cryptographic) audience, specially now that attribute-based encryption is considered as a useful tool to secure real systems like the Internet of Things. Today, only attribute-based encryption schemes that employ tools like bilinear pairings or lattices can provide some real (and provable) level of security. As an example of the fact that this message is still unknown for many people, we revisit a (maybe non exhaustive) list of articles proposing such insecure attribute-based encryption schemes: we recall which of these schemes have already been attacked and we describe attacks for the other ones., Postprint (published version)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Secret sharing schemes for (k, n)-consecutive access structures

  • Herranz Sotoca, Javier
  • Sáez Moreno, Germán
We 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}. We call such access structures, which may naturally appear in real applications involving distributed cryptography, (k, n)- consecutive. We prove that these access structures are only ideal when k = 1, n - 1, n. Actually, we obtain the same result that has been obtained for other families of access structures: being ideal is equivalent to being a vector space access structure and is equivalent to having an optimal information rate strictly bigger than 2 3 . For the non-ideal cases, we give either the exact value of the optimal information rate, for k = n - 2 and k = n - 3, or some bounds on it., Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Artículo científico (JournalArticle)

Improving the linear programming technique in the search for lower bounds in secret sharing

  • Farràs Ventura, Oriol
  • Kaced, Tarik
  • Martín Mollevi, Sebastià
  • Padró Laimon, Carles
We 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. Our new technique makes it possible to determine the optimal information ratio of linear secret sharing schemes for all access structures on $5$ participants and all graph-based access structures on $6$ participants. In addition, new lower bounds are presented also for some small matroid ports and, in particular, the optimal information ratios of the linear secret sharing schemes for the ports of the Vamos matroid are determined., Oriol Farr`as is supported by the Spanish Government through TIN2014-57364-C2-1-R and by the Catalan government through 2017SGR-705. Tarik Kaced acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-16-CE23-0016-01 (project PAMELA). Sebasti`a Mart´ın and Carles Padr´o are supported by Spanish Government through MTM2016-77213-R., Peer Reviewed, Postprint (author's final draft)
Recercat. Dipósit de la Recerca de Catalunya
Publicación Contribución de congreso (ConferenceOutput)

Structure-preserving and re-randomizable RCCA-secure Public Key Encryption and its applications

  • Faonio, Antonio
  • Fiore, Dario
  • Herranz Sotoca, Javier
  • Ràfols, Carla
Re-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 a new construction of a Rand-RCCA PKE scheme that is perfectly rerandomizable. Our construction is structure-preserving, can be instantiated over Type-3 pairing groups, and achieves better computation and communication efficiency than the state of the art perfectly re-randomizable schemes (e.g., Prabhakaran and Rosulek, CRYPTO’07). Next, we revive the Rand-RCCA notion showing new applications where our Rand-RCCA PKE scheme plays a fundamental part: (1) We show how to turn our scheme into a publicly-verifiable Rand-RCCA scheme; (2) We construct a malleable NIZK with a (variant of) simulation soundness that allows for re-randomizability; (3) We propose a new UC-secure Verifiable Mix-Net protocol that is secure in the common reference string model. Thanks to the structure-preserving property, all these applications are efficient. Notably, our Mix-Net protocol is the most efficient universally verifiable Mix-Net (without random oracle) where the CRS is an uniformly random string of size independent of the number of senders. The property is of the essence when such protocols are used in large scale., First and second authors are supported by the Spanish Government through the projects Datamantium (ref. RTC-2016-4930-7), SCUM (RTI2018-102043-B-I00), and ERC2018-092822, and by the Madrid Regional Government under project BLOQUES (ref. S2018/TCS-4339). The work of the third author is partially supported by Spanish Government through project MTM2016-77213-R. The fourth author was supported by a Marie Curie “UPF Fellows” Postdoctoral Grant and by Project RTI2018-102112-B-I00 (AEI/FEDER,UE)., Postprint (author's final draft)