Jaume Martí-Farré

	2012
21		Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. J. Cryptology 25(3): 434-463 (2012)
	2011
20		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)
	2009
19		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
18		Jaume Martí-Farré, Carles Padró, Leonor Vázquez: On the Diameter of Matroid Ports. Electr. J. Comb. 15(1): (2008)
17		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
16		Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. EUROCRYPT 2007: 448-465
15		Jaume Martí-Farré, Carles Padró: On Secret Sharing Schemes, Matroids and Polymatroids. TCC 2007: 273-290
14		Jaume Martí-Farré: A note on secret sharing schemes with three homogeneous access structure. Inf. Process. Lett. 102(4): 133-137 (2007)
	2006
13		Jaume Martí-Farré, Carles Padró: Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants. SCN 2006: 201-215
12		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)
11		Oriol Farràs, Jaume Martí-Farré, Carles Padró: Ideal Multipartite Secret Sharing Schemes. IACR Cryptology ePrint Archive 2006: 292 (2006)
10		Jaume Martí-Farré, Carles Padró: On Secret Sharing Schemes, Matroids and Polymatroids. IACR Cryptology ePrint Archive 2006: 77 (2006)
	2005
9		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
8		Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. Des. Codes Cryptography 34(1): 17-34 (2005)
	2004
7		Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. Electr. J. Comb. 11(1): (2004)
6		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
5		Jaume Martí-Farré, Carles Padró: Secret sharing schemes on sparse homogeneous access structures with rank three. IACR Cryptology ePrint Archive 2003: 151 (2003)
	2002
4		Jaume Martí-Farré, Carles Padró: Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. SCN 2002: 354-363
3		Jaume Martí-Farré, Carles Padró: Secret sharing schemes on access structures with intersection number equal to one. IACR Cryptology ePrint Archive 2002: 106 (2002)
2		Jaume Martí-Farré, Carles Padró: Secret sharing schemes with three or four minimal qualified subsets. IACR Cryptology ePrint Archive 2002: 50 (2002)
	1999
1		Jaume Martí-Farré: Sets defining minimal vertex covers. Discrete Mathematics 197-198: 555-559 (1999)

Coauthor Index

1	Ronald Cramer	[6] [9] [17]
2	Vanesa Daza	[6] [9] [17]
3	Oriol Farràs	[11] [16] [21]
4	Ignacio Gracia	[6] [9] [17]
5	Gregor Leander	[6] [9] [17]
6	Carles Padró	[2] [3] [4] [5] [6] [7] [8] [9] [10] [11] [12] [13] [15] [16] [17] [18] [19] [20] [21]
7	Jorge Jiménez Urroz	[6] [9] [17]
8	Leonor Vázquez	[18] [20]

Last update Mon Jun 4 20:40:43 2012 CET by the DBLP Team — Data released under the ODC-BY 1.0 license — See also our legal information page