On secret sharing schemes, matroids and polymatroids J Martí-Farré, C Padró Theory of Cryptography Conference, 273-290, 2007 | 111 | 2007 |
Ideal multipartite secret sharing schemes O Farras, J Martí-Farré, C Padró Advances in Cryptology-EUROCRYPT 2007: 26th Annual International Conference …, 2007 | 85 | 2007 |
Ideal multipartite secret sharing schemes O Farràs, J Martí-Farré, C Padró Journal of cryptology 25 (3), 434-463, 2012 | 81 | 2012 |
On codes, matroids, and secure multiparty computation from linear secret-sharing schemes R Cramer, V Daza, I Gracia, JJ Urroz, G Leander, J Martí-Farré, C Padró IEEE Transactions on Information Theory 54 (6), 2644-2657, 2008 | 66 | 2008 |
Secret sharing schemes with three or four minimal qualified subsets J Martí-Farré, C Padró Designs, Codes and Cryptography 34, 17-34, 2005 | 58 | 2005 |
Secret sharing schemes on access structures with intersection number equal to one J Martí-Farré, C Padró Discrete Applied Mathematics 154 (3), 552-563, 2006 | 44* | 2006 |
On codes, matroids and secure multi-party computation from linear secret sharing schemes R Cramer, V Daza, I Gracia, JJ Urroz, G Leander, J Martí-Farré, C Padró Advances in Cryptology–CRYPTO 2005: 25th Annual International Cryptology …, 2005 | 36 | 2005 |
Secret sharing schemes on sparse homogeneous access structures with rank three J Martí-Farré, C Padró Cryptology ePrint Archive, 2003 | 30 | 2003 |
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants J Martí-Farré, C Padró Designs, Codes and Cryptography 52, 1-14, 2009 | 23 | 2009 |
Optimal complexity of secret sharing schemes with four minimal qualified subsets J Martí-Farré, C Padró, L Vázquez Designs, Codes and Cryptography 61, 167-186, 2011 | 19 | 2011 |
A note on secret sharing schemes with three homogeneous access structure J Martí-Farré Information processing letters 102 (4), 133-137, 2007 | 10 | 2007 |
From clutters to matroids J Martí-Farré The Electronic Journal of Combinatorics 21 (1), P1. 11, 2014 | 8 | 2014 |
Completion and decomposition of a clutter into representable matroids J Martí-Farré, A de Mier Linear Algebra and its Applications 472, 31-47, 2015 | 7 | 2015 |
Una experiencia docente orientada a incrementar el trabajo personal del estudiante B Otero, J Martí-Farré, E Garriga Valle, A Alonso Maleta, L Prat Viñas Asociación de Enseñantes Universitarios de la Informática (AENUI), 2007 | 6 | 2007 |
Uniform clutters and dominating sets of graphs J Martí-Farré, M Mora, JL Ruiz Discrete Applied Mathematics 263, 220-233, 2019 | 5 | 2019 |
Transformation and decomposition of clutters into matroids J Martí-Farré, A de Mier Advances in Mathematics 312, 286-314, 2017 | 5 | 2017 |
Completion and decomposition of hypergraphs into dominating sets of graphs J Martí-Farré, M Mora, JL Ruiz Electronic Notes in Discrete Mathematics 49, 213-220, 2015 | 5 | 2015 |
Symbolic powers and local cohomology J Martí-Farré Mathematika 42 (1), 182-187, 1995 | 4 | 1995 |
General symbolic powers: A homological point of view J Martí-Farré Communications in Algebra 23 (4), 1567-1577, 1995 | 3 | 1995 |
Layer structure of De Bruijn and Kautz digraphs. An application to deflection routing J Fàbrega, J Martí-Farré, X Muñoz Electronic Notes in Discrete Mathematics 54, 157-162, 2016 | 2 | 2016 |