Carles Padró

Main Publications

  1. S. Martín, C. Padró, A. Yang. Secret Sharing, Rank Inequalities, and Information Inequalities. IEEE Transactions on Information Theory 62 (2016) 599-609. A previous version of this paper appeared in Advances in Cryptology, Crypto 2013. Lecture Notes in Computer Science 8043 (2013) 277-288. Santa Barbara, California, USA, 2013. Available at Cryptology ePrint Archive
  2. I. Cascudo, R. Cramer, D. Mirandola, C. Padró, C. Xing. On secret sharing with nonlinear product reconstruction. SIAM Journal on Discrete Mathematics 29 (2015) 1114-1131. Available at Cryptology ePrint Archive
  3. R. Cramer, C. Padró, C. Xing. Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. Theory of Cryptography, TCC 2015. Lecture Notes in Computer Science 9014 (2015) 481-501. Warsaw, Poland, 2015. Available at Cryptology ePrint Archive
  4. O. Farràs, C. Padró. Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes. Designs, Codes and Cryptography 74 (2015) 495-510. Available at Cryptology ePrint Archive
  5. O. Farràs, T. Hansen, T. Kaced, C. Padró. Optimal Non-Perfect Uniform Secret Sharing Schemes. Advances in Cryptology, Crypto 2014. Lecture Notes in Computer Science 8617 (2014) 217-234. Santa Barbara, California, USA, 2014. Available at Cryptology ePrint Archive
  6. O. Farràs, C. Padró, C. Xing, A. Yang. Natural Generalizations of Threshold Secret Sharing. IEEE Transactions on Information Theory 60 (2014) 1652-1664. A previous version of this paper appeared in Advances in Cryptology, Asiacrypt 2011, Lecture Notes in Computer Science 7073 (2011) 610-627. Seoul, Korea, 2011. Available at Cryptology ePrint Archive
  7. A. Beimel, A. Ben-Efraim, C. Padró, I. Tyomkin. Multi-linear Secret-Sharing Schemes. Theory of Cryptography, TCC 2014. Lecture Notes in Computer Science 8349 (2014) 394-418. San Diego, California, USA, 2014.
  8. R. Cramer, S. Fehr, C. Padró. Algebraic manipulation detection codes. Science China. Mathematics 56 (2013) 1349-1358.
  9. S. Ball, C. Padró, Z. Weiner, C. Xing. On the representability of the bi-uniform matroid. SIAM Journal on Discrete Mathematics 27 (2013) 1482-1491.
  10. C. Padró, L. Vázquez, A. Yang. Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. Discrete Applied Mathematics 161 (2013) 1072-1084. A previous version of this paper appeared in Ninth Latin American Theoretical Informatics Symposium, LATIN 2010, Lecture Notes in Computer Science 6034 (2010) 344-355. Oaxaca, Mexico, 2010.
  11. O. Farràs, I. Gracia, S. Martín, C. Padró. Linear Threshold Multisecret Sharing Schemes. Information Processing Letters 112 (2012) 667-673. A previous version of this paper appeared in Fourth International Conference on Information Theoretic Security ICITS 2009, Lecture Notes in Computer Science 5973 (2010) 110-126. Shizuoka, Japan, 2009.
  12. O. Farràs, C. Padró. Ideal Hierarchical Secret Sharing Schemes. IEEE Transactions on Information Theory 58 (2012) 3273-3286. A previous version of this paper appeared in Seventh IACR Theory of Cryptography Conference, TCC 2010, Lecture Notes in Computer Science 5978 (2010) 219-236. Zurich, Switzerland, 2010.
  13. O. Farràs, J. Martí-Farré, C. Padró. Ideal Multipartite Secret Sharing Schemes. Journal of Cryptology 25 (2012) 434-463. A previous version of this paper appeared in Advances in Cryptology, Eurocrypt 2007. Lecture Notes in Computer Science 4515 (2007) 448-465. Barcelona, Spain, 2007.
  14. O. Farràs, J.R. Metcalf-Burton, C. Padró, L. Vázquez. On the Optimization of Bipartite Secret Sharing Schemes. Designs, Codes and Cryptography 63 (2012) 255-271. A previous version of this paper appeared in Fourth International Conference on Information Theoretic Security ICITS 2009, Lecture Notes in Computer Science 5973 (2010) 93-109. Shizuoka, Japan, 2009.
  15. J. Martí-Farré, C. Padró, L. Vázquez. Optimal Complexity of Secret Sharing Schemes with Four Minimal Qualified Subsets. Designs, Codes and Cryptography 61 (2011) 167-186.
  16. O. Farràs, C. Padró. Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. International Workshop on Coding and Cryptology IWCC2011, Lecture Notes in Computer Science 6639 (2011) 99-108. Qingdao, China, 2011.
  17. J. Martí-Farré, C. Padró. On Secret Sharing Schemes, Matroids and Polymatroids. Journal of Mathematical Cryptology 4 (2010) 95-120. A previous version of this paper appeared in Fourth IACR Theory of Cryptography Conference TCC 2007, Lecture Notes in Computer Science 4392 (2007) 273-290. Amsterdam, The Netherlands, 2007.
  18. H. Chen, S. Ling, C. Padró, H. Wang, C. Xing. Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. Twelfth IMA International Conference on Cryptography and Coding IMACCC 2009, Lecture Notes in Computer Science 5921 (2009) 263-277. Cirencester, United Kingdom, 2009.
  19. J. Martí-Farré, C. Padró. Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Designs, Codes and Cryptography 52 (2009) 1-14. A previous version of this paper appeared in Fifth Conference on Security and Cryptography for Networks, SCN 2006, Lecture Notes in Computer Science 4116 (2006) 201-215. Maiori, Italy, 2006.
  20. J. Martí-Farré, C. Padró, L. Vázquez. On the Diameter of Matroid Ports. Electronic Journal of Combinatorics 15 (1) (2008) Note 72, 9 pp. (electronic).
  21. 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. IEEE Transactions on Information Theory 54 (2008) 2644-2657. A previous version of this paper appeared in Advances in Cryptology - CRYPTO 2005, Lecture Notes in Computer Science 3621 (2005) 327-343. Santa Barbara, California, USA, 2005.
  22. R. Cramer, Y. Dodis, S. Fehr, C. Padró, D. Wichs. Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. Advances in Cryptology, Eurocrypt 2008, Lecture Notes in Computer Science 4965 (2008) 471-488. Istanbul, Turkey, 2008.
  23. A. Beimel, N. Livne, C. Padró. Matroids Can Be Far From Ideal Secret Sharing. Fifth IACR Theory of Cryptography Conference TCC 2008, Lecture Notes in Computer Science 4948 (2008) 194-212. New York, USA, 2008.
  24. 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. Santa Barbara, California, USA, 2007.
  25. C. Padró, I. Gracia. Representing small identically self-dual matroids by self-dual codes. SIAM Journal on Discrete Mathematics 20 (2006) 1046-1055.
  26. 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.
  27. J. Martí-Farré, C. Padró. Secret sharing schemes with three or four minimal qualified subsets. Designs, Codes and Cryptography 34 (2005) 17-34.
  28. 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).
  29. 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.
  30. C. Blundo, S. Martín, B. Masucci, C. Padró. A Linear Algebraic Approach to Metering Schemes. Designs, Codes and Cryptography 33 (2004) 241-260.
  31. 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 appeared in Information Security Conference ISC'01, Lecture Notes in Computer Science 2200 (2001) 1-17. Malaga, Spain, 2001.
  32. C. Padró, I. Gracia, S. Martín, P. Morillo. Linear broadcast encryption schemes. Discrete Applied Mathematics 128 (2003) 223-238.
  33. C. Blundo, P. D'Arco, C. Padró. A Ramp Model for Distributed Key Distribution Schemes. Discrete Applied Mathematics 128 (2003) 47-64.
  34. 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.
  35. 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.
  36. C. Padró, G. Sáez. On taking cube roots in Zm. Applied Mathematics Letters 15 (2002) 703-708.
  37. C. Padró, I. Gracia, S. Martín, P. Morillo. Linear key predistribution schemes. Designs, Codes and Cryptography 25 (2002) 281-298.
  38. D. Ferrero, C. Padró. Partial line directed hypergraphs. Networks 39 (2002) 61-67.
  39. D. Ferrero, C. Padró. Connectivity and fault-tolerance of hyperdigraphs. Discrete Applied Mathematics 117 (2002) 15-26.
  40. 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.
  41. 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).
  42. D. Ferrero, C. Padró. New bounds on the diameter vulnerability of iterated line digraphs. Discrete Mathematics 233 (2001) 103-113.
  43. 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.
  44. 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.
  45. P. Morillo, C. Padró, G. Sáez, J.L. Villar. Weighted threshold secret sharing schemes. Information Processing Letters 70 (1999) 211-216.
  46. D. Ferrero, C. Padró. Disjoint paths of bounded length in large generalized cycles. Discrete Mathematics 197-198 (1999) 285-298.
  47. 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.
  48. C. Padró. Robust vector space secret sharing schemes. Information Processing Letters 68 (1998) 107-111.
  49. J. Gómez, C. Padró, S. Perennes. Large generalized cycles. Discrete Applied Mathematics 89 (1998) 107-123.
  50. 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.
  51. R. Harbane, C. Padró. Spanners of underlying graphs of iterated line digraphs. Information Processing Letters 62 (1997) 237-244.
  52. R. Harbane, C. Padró. Spanners of de Bruijn and Kautz graphs. Information Processing Letters 62 (1997) 231-236.
  53. C. Padró, P. Morillo. Diameter-vulnerability of iterated line digraphs. Discrete Mathematics 149 (1996) 189-204.
  54. C. Padró, P. Morillo, E. Llobet. Diameter-vulnerability of large bipartite digraphs. Discrete Applied Mathematics 64 (1996) 239-248.
  55. J. Gómez, P. Morillo, C. Padró. Large (d, D, D', s)-bipartite digraphs. Discrete Applied Mathematics 59 (1995) 103-114.

Back to Carles Padró's main page

Last Update: January 17, 2016