
Search the dblp DataBase
Jaume MartíFarré:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 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. [Citation Graph (0, 0)][DBLP] CRYPTO, 2005, pp:327343 [Conf]
 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:354363 [Conf]
 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:201215 [Conf]
 Jaume MartíFarré, Carles Padró
On Secret Sharing Schemes, Matroids and Polymatroids. [Citation Graph (0, 0)][DBLP] TCC, 2007, pp:273290 [Conf]
 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:552563 [Journal]
 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:1734 [Journal]
 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:133137 [Journal]
 Oriol Farràs, Jaume MartíFarré, Carles Padró
Ideal Multipartite Secret Sharing Schemes. [Citation Graph (0, 0)][DBLP] EUROCRYPT, 2007, pp:448465 [Conf]
 Jaume MartíFarré
Sets defining minimal vertex covers. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:555559 [Journal]
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. [Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs
