Search the dblp DataBase

Publications of Author

1. 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. [Citation Graph (0, 0)][DBLP]
   CRYPTO, 2005, pp:327-343 [Conf]
   
2. Jaume Martí-Farré, Carles Padró
   Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. [Citation Graph (0, 0)][DBLP]
   SCN, 2002, pp:354-363 [Conf]
   
3. Jaume Martí-Farré, Carles Padró
   Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants. [Citation Graph (0, 0)][DBLP]
   SCN, 2006, pp:201-215 [Conf]
   
4. Jaume Martí-Farré, Carles Padró
   On Secret Sharing Schemes, Matroids and Polymatroids. [Citation Graph (0, 0)][DBLP]
   TCC, 2007, pp:273-290 [Conf]
   
5. Jaume Martí-Farré, Carles Padró
   Secret sharing schemes on access structures with intersection number equal to one. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2006, v:154, n:3, pp:552-563 [Journal]
   
6. Jaume Martí-Farré, Carles Padró
   Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. [Citation Graph (0, 0)][DBLP]
   Des. Codes Cryptography, 2005, v:34, n:1, pp:17-34 [Journal]
   
7. Jaume Martí-Farré
   A note on secret sharing schemes with three homogeneous access structure. [Citation Graph (0, 0)][DBLP]
   Inf. Process. Lett., 2007, v:102, n:4, pp:133-137 [Journal]
   
8. Oriol Farràs, Jaume Martí-Farré, Carles Padró
   Ideal Multipartite Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP]
   EUROCRYPT, 2007, pp:448-465 [Conf]
   
9. Jaume Martí-Farré
   Sets defining minimal vertex covers. [Citation Graph (0, 0)][DBLP]
   Discrete Mathematics, 1999, v:197, n:, pp:555-559 [Journal]
   
10. 
    Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. [Citation Graph (, )][DBLP]