Sebastià Martín Molleví

According to our database, Sebastià Martín Molleví authored at least 18 papers between 2001 and 2020.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2020

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing.

Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró

IEEE Trans. Inf. Theory, 2020

2016

Secret Sharing, Rank Inequalities, and Information Inequalities.

Sebastià Martín Molleví, Carles Padró, An Yang

IEEE Trans. Inf. Theory, 2016

A Note on Non-Perfect Secret Sharing.

Oriol Farràs, Sebastià Martín Molleví, Carles Padró

IACR Cryptol. ePrint Arch., 2016

2012

Linear threshold multisecret sharing schemes.

Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró

Inf. Process. Lett., 2012

2005

Fujisaki-Okamoto hybrid encryption revisited.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar

Int. J. Inf. Sec., 2005

2004

Evaluating elliptic curve based KEMs in the light of pairings.

David Galindo, Sebastià Martín Molleví, Jorge L. Villar

IACR Cryptol. ePrint Arch., 2004

A Linear Algebraic Approach to Metering Schemes.

Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró

Des. Codes Cryptogr., 2004

Improving the trade-off between storage and communication in broadcast encryption schemes.

Carles Padró, Ignacio Gracia, Sebastià Martín Molleví

Discret. Appl. Math., 2004

A Provably Secure Elliptic Curve Scheme with Fast Encryption.

David Galindo, Sebastià Martín Molleví, Tsuyoshi Takagi, Jorge Luis Villar

Proceedings of the Progress in Cryptology, 2004

2003

Fujisaki-Okamoto IND-CCA hybrid encryption revisited.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar

IACR Cryptol. ePrint Arch., 2003

Linear Broadcast Encryption Schemes.

Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo

Discret. Appl. Math., 2003

A Practical Public Key Cryptosystem from Paillier and Rabin Schemes.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar

Proceedings of the Public Key Cryptography, 2003

An IND-CPA cryptosystem from Demytko's primitive.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar

Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Easy Verifiable Primitives and Practical Public Key Cryptosystems.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar

Proceedings of the Information Security, 6th International Conference, 2003

2002

A semantically secure elliptic curve RSA scheme with small expansion factor.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar

IACR Cryptol. ePrint Arch., 2002

An efficient semantically secure elliptic curve cryptosystem based on KMOV.

David Galindo, Sebastià Martín Molleví, Paz Morillo, Jorge L. Villar

IACR Cryptol. ePrint Arch., 2002

Linear Key Predistribution Schemes.

Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo

Des. Codes Cryptogr., 2002

2001

Computing the order of points on an elliptic curve modulo N is as difficult as factoring N.

Sebastià Martín Molleví, Paz Morillo, Jorge Luis Villar

Appl. Math. Lett., 2001