2009 |
48 | 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 |
47 | EE | Ronald Cramer,
Yevgeniy Dodis,
Serge Fehr,
Carles Padró,
Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
EUROCRYPT 2008: 471-488 |
46 | EE | Amos Beimel,
Noam Livne,
Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing.
TCC 2008: 194-212 |
45 | 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 |
44 | EE | Ronald Cramer,
Eike Kiltz,
Carles Padró:
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
CRYPTO 2007: 613-630 |
43 | EE | Oriol Farràs,
Jaume Martí-Farré,
Carles Padró:
Ideal Multipartite Secret Sharing Schemes.
EUROCRYPT 2007: 448-465 |
42 | EE | Jaume Martí-Farré,
Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids.
TCC 2007: 273-290 |
2006 |
41 | EE | Jaume Martí-Farré,
Carles Padró:
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants.
SCN 2006: 201-215 |
40 | 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) |
39 | EE | Carles Padró,
Ignacio Gracia:
Representing Small Identically Self-Dual Matroids by Self-Dual Codes.
SIAM J. Discrete Math. 20(4): 1046-1055 (2006) |
2005 |
38 | 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 |
37 | EE | Jaume Martí-Farré,
Carles Padró:
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets.
Des. Codes Cryptography 34(1): 17-34 (2005) |
2004 |
36 | EE | Carlo Blundo,
Sebastià Martín Molleví,
Barbara Masucci,
Carles Padró:
A Linear Algebraic Approach to Metering Schemes.
Des. Codes Cryptography 33(3): 241-260 (2004) |
35 | EE | Carles Padró,
Ignacio Gracia,
Sebastià Martín Molleví:
Improving the trade-off between storage and communication in broadcast encryption schemes.
Discrete Applied Mathematics 143(1-3): 213-220 (2004) |
34 | | Carles Padró,
Germán Sáez:
Correction to "Secret Sharing Schemes With Bipartite Access Structure".
IEEE Transactions on Information Theory 50(6): 1373- (2004) |
33 | EE | Carlo Blundo,
Paolo D'Arco,
Vanesa Daza,
Carles Padró:
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures.
Theor. Comput. Sci. 320(2-3): 269-291 (2004) |
2003 |
32 | EE | Javier Herranz,
Carles Padró,
Germán Sáez:
Distributed RSA Signature Schemes for General Access Structures.
ISC 2003: 122-136 |
31 | EE | Carles Padró,
Ignacio Gracia,
Sebastià Martín Molleví,
Paz Morillo:
Linear Broadcast Encryption Schemes.
Discrete Applied Mathematics 128(1): 223-238 (2003) |
30 | EE | Carlo Blundo,
Paolo D'Arco,
Carles Padró:
A Ramp Model for Distributed Key Distribution Schemes.
Discrete Applied Mathematics 128(1): 47-64 (2003) |
2002 |
29 | EE | Vanesa Daza,
Javier Herranz,
Carles Padró,
Germán Sáez:
A Distributed and Computationally Secure Key Distribution Scheme.
ISC 2002: 342-356 |
28 | EE | Jaume Martí-Farré,
Carles Padró:
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One.
SCN 2002: 354-363 |
27 | EE | Carles Padró,
Germán Sáez:
Taking cube roots in Zm.
Appl. Math. Lett. 15(6): 703-708 (2002) |
26 | | Sergio Cabello,
Carles Padró,
Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Des. Codes Cryptography 25(2): 175-188 (2002) |
25 | | Carles Padró,
Ignacio Gracia,
Sebastià Martín Molleví,
Paz Morillo:
Linear Key Predistribution Schemes.
Des. Codes Cryptography 25(3): 281-298 (2002) |
24 | | Daniela Ferrero,
Carles Padró:
Connectivity and fault-tolerance of hyperdigraphs.
Discrete Applied Mathematics 117(1-3): 15-26 (2002) |
23 | EE | Carles Padró,
Germán Sáez:
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
Inf. Process. Lett. 83(6): 345-351 (2002) |
22 | EE | Daniela Ferrero,
Carles Padró:
Partial line directed hypergraphs.
Networks 39(2): 61-67 (2002) |
2001 |
21 | EE | Carlo Blundo,
Paolo D'Arco,
Vanesa Daza,
Carles Padró:
Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures.
ISC 2001: 1-17 |
20 | EE | Daniela Ferrero,
Carles Padró:
New bounds on the diameter vulnerability of iterated line digraphs.
Discrete Mathematics 233(1-3): 103-113 (2001) |
19 | EE | Carles Padró,
Ignacio Gracia,
Sebastià Martín Molleví,
Paz Morillo:
Linear broadcast encryption schemes.
Electronic Notes in Discrete Mathematics 6: 35-44 (2001) |
18 | EE | Carlo Blundo,
Paolo D'Arco,
Carles Padró:
A Ramp Model for Distributed Key Distribution Schemes.
Electronic Notes in Discrete Mathematics 6: 45-54 (2001) |
2000 |
17 | | Carles Padró,
Germán Sáez:
Secret sharing schemes with bipartite access structure.
IEEE Transactions on Information Theory 46(7): 2596-2604 (2000) |
1999 |
16 | EE | Sergio Cabello,
Carles Padró,
Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
FCT 1999: 185-194 |
15 | | Carles Padró,
Germán Sáez,
Jorge Luis Villar:
Detection of Cheaters in Vector Space Secret Sharing Schemes.
Des. Codes Cryptography 16(1): 75-85 (1999) |
14 | EE | Daniela Ferrero,
Carles Padró:
Disjoint paths of bounded length in large generalized cycles.
Discrete Mathematics 197-198: 285-298 (1999) |
13 | EE | Paz Morillo,
Carles Padró,
Germán Sáez,
Jorge Luis Villar:
Weighted Threshold Secret Sharing Schemes.
Inf. Process. Lett. 70(5): 211-216 (1999) |
1998 |
12 | EE | Carles Padró,
Germán Sáez:
Secret Sharing Schemes with Bipartite Access Structure.
EUROCRYPT 1998: 500-511 |
11 | EE | José Gómez,
Carles Padró,
Stephane Perennes:
Large Generalized Cycles.
Discrete Applied Mathematics 89(1-3): 107-123 (1998) |
10 | EE | Carles Padró:
Robust Vector Space Secret Sharing Schemes.
Inf. Process. Lett. 68(3): 107-111 (1998) |
9 | EE | Carles Padró,
Paz Morillo,
Xavier Muñoz:
Fault-Tolerant Fixed Routings in Some Families of Digraphs.
SIAM J. Discrete Math. 11(3): 501-509 (1998) |
1997 |
8 | EE | Daniela Ferrero,
Carles Padró:
Fault-Tolerant Routings in Large Generalized Cycles.
SCCC 1997: 58-65 |
7 | EE | Rabah Harbane,
Carles Padró:
Spanners of de Bruijn and Kautz Graphs.
Inf. Process. Lett. 62(5): 231-236 (1997) |
6 | EE | Rabah Harbane,
Carles Padró:
Spanners of Underlying Graphs of Iterated Line Digraphs.
Inf. Process. Lett. 62(5): 245-250 (1997) |
1996 |
5 | | Rabah Harbane,
Carles Padró:
Spanners of Underlying Graphs of Iterated Line Digraphs.
SIROCCO 1996: 180-194 |
4 | EE | Carles Padró,
Paz Morillo,
Eduard Llobet Valero:
Diameter-vulnerability of Large Bipartite Digraphs.
Discrete Applied Mathematics 64(3): 239-248 (1996) |
3 | EE | Carles Padró,
Paz Morillo:
Diameter vulnerability of iterated line digraphs.
Discrete Mathematics 149(1-3): 189-204 (1996) |
2 | | Carles Padró,
Paz Morillo,
Miguel Angel Fiol:
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".
IEEE Trans. Computers 45(6): 768 (1996) |
1995 |
1 | EE | José Gómez,
Paz Morillo,
Carles Padró:
Large (d, D, D', s) - bipartite Digraphs.
Discrete Applied Mathematics 59(2): 103-114 (1995) |