| 2012 | ||
|---|---|---|
| j11 | Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. J. Cryptology 25(3): 434-463 (2012) | |
| 2011 | ||
| j10 | Jaume Martí-Farré, Carles Padró, Leonor Vázquez: Optimal complexity of secret sharing schemes with four minimal qualified subsets. Des. Codes Cryptography 61(2): 167-186 (2011) | |
| 2010 | ||
| j9 | Jaume Martí-Farré, Carles Padró: On secret sharing schemes, matroids and polymatroids. J. Mathematical Cryptology 4(2): 95-120 (2010) | |
| 2009 | ||
| j8 | Jaume Martí-Farré, Carles Padró: Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Des. Codes Cryptography 52(1): 1-14 (2009) | |
| 2008 | ||
| j7 | Jaume Martí-Farré, Carles Padró, Leonor Vázquez: On the Diameter of Matroid Ports. Electr. J. Comb. 15(1) (2008) | |
| j6 | Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró: On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. IEEE Transactions on Information Theory 54(6): 2644-2657 (2008) | |
| 2007 | ||
| j5 | Jaume Martí-Farré: A note on secret sharing schemes with three homogeneous access structure. Inf. Process. Lett. 102(4): 133-137 (2007) | |
| c5 | Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. EUROCRYPT 2007: 448-465 | |
| c4 | Jaume Martí-Farré, Carles Padró: On Secret Sharing Schemes, Matroids and Polymatroids. TCC 2007: 273-290 | |
| 2006 | ||
| j4 | Jaume Martí-Farré, Carles Padró: Secret sharing schemes on access structures with intersection number equal to one. Discrete Applied Mathematics 154(3): 552-563 (2006) | |
| c3 | Jaume Martí-Farré, Carles Padró: Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants. SCN 2006: 201-215 | |
| i6 | Jaume Martí-Farré, Carles Padró: On Secret Sharing Schemes, Matroids and Polymatroids. IACR Cryptology ePrint Archive 2006: 77 (2006) | |
| i5 | Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. IACR Cryptology ePrint Archive 2006: 292 (2006) | |
| 2005 | ||
| j3 | Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. Des. Codes Cryptography 34(1): 17-34 (2005) | |
| c2 | Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró: On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. CRYPTO 2005: 327-343 | |
| 2004 | ||
| j2 | Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. Electr. J. Comb. 11(1) (2004) | |
| i4 | Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró: On codes, matroids and secure multi-party computation from linear secret sharing schemes. IACR Cryptology ePrint Archive 2004: 245 (2004) | |
| 2003 | ||
| i3 | Jaume Martí-Farré, Carles Padró: Secret sharing schemes on sparse homogeneous access structures with rank three. IACR Cryptology ePrint Archive 2003: 151 (2003) | |
| 2002 | ||
| c1 | Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. SCN 2002: 354-363 | |
| i2 | Jaume Martí-Farré, Carles Padró: Secret sharing schemes with three or four minimal qualified subsets. IACR Cryptology ePrint Archive 2002: 50 (2002) | |
| i1 | Jaume Martí-Farré, Carles Padró: Secret sharing schemes on access structures with intersection number equal to one. IACR Cryptology ePrint Archive 2002: 106 (2002) | |
| 1999 | ||
| j1 | Jaume Martí-Farré: Sets defining minimal vertex covers. Discrete Mathematics 197-198: 555-559 (1999) | |
| 1 | Ronald Cramer | |
| 2 | Vanesa Daza | |
| 3 | Oriol Farràs | |
| 4 | Ignacio Gracia | |
| 5 | Gregor Leander | |
| 6 | Carles Padró | |
| 7 | Jorge Jiménez Urroz | |
| 8 | Leonor Vázquez |
Data released under the ODC-BY 1.0 license — See also our legal information page