Carles Padró

Main Publications

  1. R. Cramer, E. Kiltz, C. Padró. A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. Advances in Cryptology, Crypto 2007. Lecture Notes in Computer Science 4622 (2007) 613-630.
  2. O. Farràs, J. Martí-Farré, C. Padró. Ideal Multipartite Secret Sharing Schemes. Advances in Cryptology, Eurocrypt 2007. Lecture Notes in Computer Science 4515 (2007) 448-465.
  3. J. Martí-Farré, C. Padró. On Secret Sharing Schemes, Matroids and Polymatroids. Fourth IACR Theory of Cryptography Conference TCC 2007, Lecture Notes in Computer Science 4392 (2007) 273-290.
  4. C. Padró, I. Gracia. Representing small identically self-dual matroids by self-dual codes. SIAM Journal on Discrete Mathematics 20 (2006) 1046-1055.
  5. J. Martí-Farré, C. Padró. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Fifth Conference on Security and Cryptography for Networks, SCN 2006, Lecture Notes in Computer Science 4116 (2006) 201-215. Maiori, Italy, 2006.
  6. J. Martí-Farré, C. Padró. Secret sharing schemes on access structures with intersection number equal to one. Discrete Applied Mathematics 154 (2006) 552-563. A previous version of this paper appeared in Third Conference on Security in Communication Networks SCN 2002, Lecture Notes in Computer Science 2576 (2003) 354-363. Amalfi, Italy, 2002.
  7. R. Cramer, V. Daza, I. Gracia, J. Jiménez Urroz, G. Leander, J. Martí-Farré, C. Padró. On codes, matroids and secure multi-party computation from linear secret sharing schemes.  Advances in Cryptology - CRYPTO 2005, Lecture Notes in Computer Science 3621 (2005) 327-343. Santa Barbara, California, USA, 2005.
  8. J. Martí-Farré, C. Padró. Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography 34 (2005) 17-34.
  9. J. Martí-Farré, C. Padró. Secret sharing schemes on sparse homogeneous access structures with rank three. Electronic Journal of Combinatorics 11 (1) (2004) Research Paper 72, 16 pp. (electronic).
  10. I. Gracia, S. Martín, C. Padró. Improving the trade-off between storage and communication in  broadcast encryption schemes. Discrete Applied Mathematics 143 (2004) 213-220.
  11. C. Blundo, S. Martín, B. Masucci, C. Padró. A Linear Algebraic Approach to Metering Schemes. Designs, Codes and Cryptography 33 (2004) 241-260.
  12. C. Blundo, P. D'Arco, V. Daza, C. Padró. Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures. Theoretical Computer Science 320 (2004) 269-291. A previous version of this paper apperared in Information Security Conference ISC'01, Lecture Notes in Computer Science 2200 (2001) 1-17. Malaga, Spain, 2001.
  13. C. Padró, I. Gracia, S. Martín, P. Morillo. Linear broadcast encryption schemes. Discrete Applied Mathematics 128 (2003) 223-238.
  14. C. Blundo, P. D'Arco, C. Padró. A Ramp Model for Distributed Key Distribution Schemes. Discrete Applied Mathematics 128 (2003) 47-64.
  15. J. Herranz, C. Padró, G. Sáez. Distributed RSA signature schemes for general access structures. Information Security Conference (ISC'03), Lecture Notes in Computer Science 2851 (2003) 123-137. Bristol, United Kingdom, 2003.
  16. C. Padró, G. Sáez. Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Information Processing Letters 83 (2002) 345-351.
  17. C. Padró, G. Sáez. On taking cube roots in Zm. Applied Mathematics Letters 15 (2002) 703-708.
  18. C. Padró, I. Gracia, S. Martín, P. Morillo. Linear key predistribution schemes. Designs, Codes and Cryptography 25 (2002) 281-298.
  19. D. Ferrero, C. Padró. Partial line directed hypergraphs. Networks 39 (2002) 61-67.
  20. D. Ferrero, C. Padró. Connectivity and fault-tolerance of hyperdigraphs. Discrete Applied Mathematics 117 (2002) 15-26.
  21. S. Cabello, C. Padró, G. Sáez. Secret sharing schemes with detection of cheaters for a general access structure. Designs, Codes and Cryptography 25 (2002) 175-188. A previous version of this paper appeared in Proceedings of the 12th International Symposium on Fundamentals of Computation Theory, FCT '99, Lecture Notes in Computer Science 1684 (1999) 185-193. Iasi, Romania, 1999.
  22. V. Daza, J. Herranz, C. Padró, G. Sáez. A Distributed and Computationally Secure Key Distribution Scheme. Information Security Conference ISC'02, Lecture Notes in Computer Science 2433 (2002) 342-356. Sao Paulo, Brasil (2002).
  23. D. Ferrero, C. Padró. New bounds on the diameter vulnerability of iterated line digraphs. Discrete Mathematics 233 (2001) 103-113.
  24. C. Padró, G. Sáez. Secret sharing schemes with bipartite access structure. IEEE Transactions on Information Theory 46 (2000) 2596-2605. A previous version of this paper appeared in Advances in Cryptology - EUROCRYPT'98, Lecture Notes in Computer Science 1403 (1998) 500-511. Espoo, Finland, 1998. A short note with some corrections to this paper appeared in IEEE Transactions on Information Theory 50 (2004) 1373.
  25. P. Morillo, C. Padró. Protocols criptogràfics distribuïts, esquemes per compartir secrets (in Catalan). In Les bases matemàtiques de la civilització tecnològica, Aula de Ciència i Cultura 10. Fundació Caixa de Sabadell (1999), pp. 31--39.
  26. P. Morillo, C. Padró, G. Sáez, J.L. Villar. Weighted threshold secret sharing schemes. Information Processing Letters 70 (1999) 211-216.
  27. D. Ferrero, C. Padró.  Disjoint paths of bounded length in large generalized cycles. Discrete Mathematics 197-198 (1999) 285-298.
  28. C. Padró, G. Sáez, J.L. Villar. Detection of cheaters in vector space secret sharing schemes. Designs, Codes and Cryptography 16 (1999) 75-85.
  29. C. Padró. Robust vector space secret sharing schemes. Information Processing Letters 68 (1998) 107-111.
  30. J. Gómez, C. Padró, S. Perennes. Large generalized cycles. Discrete Applied Mathematics 89 (1998) 107-123.
  31. C. Padró, P. Morillo, X. Muñoz. Fault-tolerant fixed routings in some families of digraphs. SIAM Journal on Discrete Mathematics 11 (1998) 501-509.
  32. R. Harbane, C. Padró. Spanners of underlying graphs of iterated line digraphs. Information Processing Letters 62 (1997) 237-244.
  33. R. Harbane, C. Padró. Spanners of de Bruijn and Kautz graphs. Information Processing Letters 62 (1997) 231-236.
  34. C. Padró, P. Morillo. Diameter-vulnerability of iterated line digraphs. Discrete Mathematics 149 (1996) 189-204.
  35. C. Padró, P. Morillo, E. Llobet.  Diameter-vulnerability of large bipartite digraphs. Discrete Applied Mathematics 64 (1996) 239-248.
  36. J. Gómez, P. Morillo, C. Padró. Large $(d, D, D', s)$-bipartite digraphs. Discrete Applied Mathematics 59 (1995)  103-114.
Some of my papers on Graph Theory can be downloaded from the pages of the Research Group on Graph Theory and Combinatorics.

Back to Carles Padró's main page

Last Update: August 15, 2007