sebastia martin mollevi
sebastia martin mollevi
Email verificata su upc.edu - Home page
Titolo
Citata da
Citata da
Anno
A practical public key cryptosystem from Paillier and Rabin schemes
JLV David Galindo, Sebastiá Martýn, Paz Morillo
Public Key Cryptography—PKC 2003, 279-291, 2003
31*2003
Secret sharing, rank inequalities, and information inequalities.
S Martín Molleví, C Padró, A Yang
IEEE Transactions on Information Theory 62 (1), 599-609, 2016
29*2016
Secret Sharing, Rank Inequalities and Information Inequalities
S Martín Molleví, C Padró, A Yang
Advances in Cryptology–CRYPTO 8043, 277-288, 2013
29*2013
Linear broadcast encryption schemes
PM Carles Padró, Ignacio Gracia, Sebastiŕ Martı́n
Discrete Applied Mathematics 128 (1), 223-238, 2003
25*2003
Improving the linear programming technique in the search for lower bounds in secret sharing
O Farrŕs, T Kaced, S Martín, C Padró
Annual International Conference on the Theory and Applications of …, 2018
232018
Linear key predistribution schemes
C Padró, I Gracia, SM Molleví, P Morillo
Designs, Codes and Cryptography 25 (3), 281-298, 2002
212002
Improving the trade-off between storage and communication in broadcast encryption schemes
SM Carles Padró, Ignacio Gracia
Discrete applied mathematics 143 (1), 213-220, 2004
202004
An efficient semantically secure elliptic curve cryptosystem based on KMOV.
D Galindo, SM Molleví, P Morillo, JL Villar
IACR Cryptol. ePrint Arch. 2002, 37, 2002
202002
Fujisaki–Okamoto hybrid encryption revisited
JLV David Galindo, Sebastiŕ Martín, Paz Morillo
International Journal of Information Security 4 (4), 228-241, 2005
112005
A linear algebraic approach to metering schemes
CP Carlo Blundo, Sebastiŕ Martín, Barbara Masucci
Designs, Codes and Cryptography 33 (3), 241-260, 2004
11*2004
Linear threshold multisecret sharing schemes
O Farras, I Gracia, S Martín, C Padró
International Conference on Information Theoretic Security, 110-126, 2009
82009
Computing the order of points on an elliptic curve modulo N is as difficult as factoring N
S Martin, P Morillo, JL Villar
Applied Mathematics Letters 14 (3), 341-346, 2001
72001
Evaluating elliptic curve based KEMs in the light of pairings.
JLV David Galindo, Sebastiŕ Martín Molleví
IACR Cryptology ePrint Archive 2004 (84), 2004
62004
An IND-CPA cryptosystem from Demytko's primitive
JLV David Galindo, Sebastiŕ Martín, Paz Morillo
Information Theory Workshop, 2003. Proceedings. 2003 IEEE, 167-170, 2003
6*2003
A provably secure elliptic curve scheme with fast encryption
D Galindo, S Martín, T Takagi, JL Villar
International Conference on Cryptology in India, 245-259, 2004
52004
Easy verifiable primitives and practical public key cryptosystems
JLV David Galindo, Sebastiŕ Martín, Paz Morillo
Information Security 2851, 69-83, 2003
5*2003
Fujisaki-Okamoto IND-CCA hybrid encryption revisited.
D Galindo, SM Molleví, P Morillo, JL Villar
IACR Cryptol. ePrint Arch. 2003, 107, 2003
52003
Linear threshold multisecret sharing schemes
O Farrŕs, I Gracia, S Martín, C Padró
Information Processing Letters 112 (17-18), 667-673, 2012
42012
Linear threshold multisecret sharing schemes
CP Oriol Farrŕs, Ignacio Gracia, Sebastiŕ Martín
LNCS 5973 (17), 110-126, 2010
4*2010
The security of PSEC-KEM versus ECIES-KEM
JLV David Galindo, Sebastiŕ Martín
Proceedings of the 26th Symposium on Information Theory in the BeNeLux, 17-27, 2005
4*2005
Il sistema al momento non puň eseguire l'operazione. Riprova piů tardi.
Articoli 1–20