The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Carles Padró: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

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

  42. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. [Citation Graph (, )][DBLP]


  43. Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. [Citation Graph (, )][DBLP]


  44. Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. [Citation Graph (, )][DBLP]


  45. Matroids Can Be Far from Ideal Secret Sharing. [Citation Graph (, )][DBLP]


  46. Ideal Hierarchical Secret Sharing Schemes. [Citation Graph (, )][DBLP]


  47. Linear Threshold Multisecret Sharing Schemes. [Citation Graph (, )][DBLP]


  48. On the Optimization of Bipartite Secret Sharing Schemes. [Citation Graph (, )][DBLP]


  49. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. [Citation Graph (, )][DBLP]


Search in 0.006secs, Finished in 0.007secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002