| 2009 |
|---|
| 11 | EE | 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 |
|---|
| 10 | EE | 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 |
|---|
| 9 | EE | Oriol Farràs,
Jaume Martí-Farré,
Carles Padró:
Ideal Multipartite Secret Sharing Schemes.
EUROCRYPT 2007: 448-465 |
| 8 | EE | Jaume Martí-Farré,
Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids.
TCC 2007: 273-290 |
| 7 | EE | Jaume Martí-Farré:
A note on secret sharing schemes with three homogeneous access structure.
Inf. Process. Lett. 102(4): 133-137 (2007) |
| 2006 |
|---|
| 6 | EE | Jaume Martí-Farré,
Carles Padró:
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants.
SCN 2006: 201-215 |
| 5 | EE | 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) |
| 2005 |
|---|
| 4 | EE | 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 |
| 3 | EE | Jaume Martí-Farré,
Carles Padró:
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets.
Des. Codes Cryptography 34(1): 17-34 (2005) |
| 2002 |
|---|
| 2 | EE | Jaume Martí-Farré,
Carles Padró:
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One.
SCN 2002: 354-363 |
| 1999 |
|---|
| 1 | EE | Jaume Martí-Farré:
Sets defining minimal vertex covers.
Discrete Mathematics 197-198: 555-559 (1999) |
