Sebastià Martín Molleví

Orcid: 0000-0002-9799-6793

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing.
IEEE Trans. Inf. Theory, 2020

2016
Secret Sharing, Rank Inequalities, and Information Inequalities.
IEEE Trans. Inf. Theory, 2016

A Note on Non-Perfect Secret Sharing.
IACR Cryptol. ePrint Arch., 2016

2012
Linear threshold multisecret sharing schemes.
Inf. Process. Lett., 2012

2005
Fujisaki-Okamoto hybrid encryption revisited.
Int. J. Inf. Sec., 2005

2004
Evaluating elliptic curve based KEMs in the light of pairings.
IACR Cryptol. ePrint Arch., 2004

A Linear Algebraic Approach to Metering Schemes.
Des. Codes Cryptogr., 2004

Improving the trade-off between storage and communication in broadcast encryption schemes.
Discret. Appl. Math., 2004

A Provably Secure Elliptic Curve Scheme with Fast Encryption.
Proceedings of the Progress in Cryptology, 2004

2003
Fujisaki-Okamoto IND-CCA hybrid encryption revisited.
IACR Cryptol. ePrint Arch., 2003

A Practical Public Key Cryptosystem from Paillier and Rabin Schemes.
Proceedings of the Public Key Cryptography, 2003

An IND-CPA cryptosystem from Demytko's primitive.
Proceedings of the Proceedings 2003 IEEE Information Theory Workshop, 2003

Easy Verifiable Primitives and Practical Public Key Cryptosystems.
Proceedings of the Information Security, 6th International Conference, 2003

2002
A semantically secure elliptic curve RSA scheme with small expansion factor.
IACR Cryptol. ePrint Arch., 2002

An efficient semantically secure elliptic curve cryptosystem based on KMOV.
IACR Cryptol. ePrint Arch., 2002

Linear Key Predistribution Schemes.
Des. Codes Cryptogr., 2002

2001
Linear broadcast encryption schemes.
Electron. Notes Discret. Math., 2001

Computing the order of points on an elliptic curve modulo N is as difficult as factoring N.
Appl. Math. Lett., 2001


  Loading...