Large (d, D, D', s) - bipartite Digraphs. - José Gómez; Paz Morillo; Carles Padró (Discret. Appl. Math., 1995)

Diameter-vulnerability of Large Bipartite Digraphs. - Carles Padró; Paz Morillo; Eduard Llobet Valero (Discret. Appl. Math., 1996)

Diameter vulnerability of iterated line digraphs. - Carles Padró; Paz Morillo (Discret. Math., 1996)

Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". - Carles Padró; Paz Morillo; Miguel Angel Fiol (IEEE Trans. Computers, 1996)

Fault-Tolerant Routings in Large Generalized Cycles. - Daniela Ferrero; Carles Padró (SCCC, 1997)

Spanners of de Bruijn and Kautz Graphs. - Rabah Harbane; Carles Padró (Inf. Process. Lett., 1997)

Spanners of Underlying Graphs of Iterated Line Digraphs. - Rabah Harbane; Carles Padró (Inf. Process. Lett., 1997)

Large Generalized Cycles. - José Gómez; Carles Padró; Stephane Perennes (Discret. Appl. Math., 1998)

Robust Vector Space Secret Sharing Schemes. - Carles Padró (Inf. Process. Lett., 1998)

Fault-Tolerant Fixed Routings in Some Families of Digraphs. - Carles Padró; Paz Morillo; Xavier Muñoz (SIAM J. Discret. Math., 1998)

Detection of Cheaters in Vector Space Secret Sharing Schemes. - Carles Padró; Germán Sáez; Jorge Luis Villar (Des. Codes Cryptogr., 1999)

Disjoint paths of bounded length in large generalized cycles. - Daniela Ferrero; Carles Padró (Discret. Math., 1999)

Weighted Threshold Secret Sharing Schemes. - Paz Morillo; Carles Padró; Germán Sáez; Jorge Luis Villar (Inf. Process. Lett., 1999)

Secret sharing schemes with bipartite access structure. - Carles Padró; Germán Sáez (IEEE Trans. Inf. Theory, 2000)

New bounds on the diameter vulnerability of iterated line digraphs. - Daniela Ferrero; Carles Padró (Discret. Math., 2001)

Taking cube roots in Zm. - Carles Padró; Germán Sáez (Appl. Math. Lett., 2002)

Connectivity and fault-tolerance of hyperdigraphs. - Daniela Ferrero; Carles Padró (Discret. Appl. Math., 2002)

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. - Sergio Cabello; Carles Padró; Germán Sáez (Des. Codes Cryptogr., 2002)

Linear Key Predistribution Schemes. - Carles Padró; Ignacio Gracia; Sebastià Martín Molleví; Paz Morillo (Des. Codes Cryptogr., 2002)

A Distributed and Computationally Secure Key Distribution Scheme. - Vanesa Daza; Javier Herranz; Carles Padró; Germán Sáez (IACR Cryptol. ePrint Arch., 2002)

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. - Carles Padró; Germán Sáez (Inf. Process. Lett., 2002)

Partial line directed hypergraphs. - Daniela Ferrero; Carles Padró (Networks, 2002)

Distributed RSA Signature Schemes for General Access Structures. - Javier Herranz; Carles Padró; Germán Sáez (ISC, 2003)

A Ramp Model for Distributed Key Distribution Schemes. - Carlo Blundo; Paolo D'Arco; Carles Padró (Discret. Appl. Math., 2003)

Linear Broadcast Encryption Schemes. - Carles Padró; Ignacio Gracia; Sebastià Martín Molleví; Paz Morillo (Discret. Appl. Math., 2003)

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. - Jaume Martí-Farré; Carles Padró (Electron. J. Comb., 2004)

Improving the trade-off between storage and communication in broadcast encryption schemes. - Carles Padró; Ignacio Gracia; Sebastià Martín Molleví (Discret. Appl. Math., 2004)

A Linear Algebraic Approach to Metering Schemes. - Carlo Blundo; Sebastià Martín Molleví; Barbara Masucci; Carles Padró (Des. Codes Cryptogr., 2004)

On codes, matroids and secure multi-party computation from linear secret sharing schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IACR Cryptol. ePrint Arch., 2004)

Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures. - Carlo Blundo; Paolo D'Arco; Vanesa Daza; Carles Padró (Theor. Comput. Sci., 2004)

Correction to "Secret Sharing Schemes With Bipartite Access Structure". - Carles Padró; Germán Sáez (IEEE Trans. Inf. Theory, 2004)

Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. - Jaume Martí-Farré; Carles Padró (Des. Codes Cryptogr., 2005)

Secret sharing schemes on access structures with intersection number equal to one. - Jaume Martí-Farré; Carles Padró (Discret. Appl. Math., 2006)

Representing Small Identically Self-Dual Matroids by Self-Dual Codes. - Carles Padró; Ignacio Gracia (SIAM J. Discret. Math., 2006)

A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. - Ronald Cramer; Eike Kiltz; Carles Padró (CRYPTO, 2007)

Matroids Can Be Far from Ideal Secret Sharing. - Amos Beimel; Noam Livne; Carles Padró (TCC, 2008)

On the Diameter of Matroid Ports. - Jaume Martí-Farré; Carles Padró; Leonor Vázquez (Electron. J. Comb., 2008)

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. - Ronald Cramer; Yevgeniy Dodis; Serge Fehr; Carles Padró; Daniel Wichs (IACR Cryptol. ePrint Arch., 2008)

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. - Ronald Cramer; Vanesa Daza; Ignacio Gracia; Jorge Jiménez Urroz; Gregor Leander; Jaume Martí-Farré; Carles Padró (IEEE Trans. Inf. Theory, 2008)

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. - Hao Chen 095; San Ling; Carles Padró; Huaxiong Wang; Chaoping Xing (IMACC, 2009)

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. - Jaume Martí-Farré; Carles Padró (Des. Codes Cryptogr., 2009)

Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. - Carles Padró; Leonor Vázquez (LATIN, 2010)

On secret sharing schemes, matroids and polymatroids. - Jaume Martí-Farré; Carles Padró (J. Math. Cryptol., 2010)

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. - Oriol Farràs; Carles Padró (IWCC, 2011)

Optimal complexity of secret sharing schemes with four minimal qualified subsets. - Jaume Martí-Farré; Carles Padró; Leonor Vázquez (Des. Codes Cryptogr., 2011)

On the optimization of bipartite secret sharing schemes. - Oriol Farràs; Jessica Ruth Metcalf-Burton; Carles Padró; Leonor Vázquez (Des. Codes Cryptogr., 2012)

Lecture Notes in Secret Sharing. - Carles Padró (IACR Cryptol. ePrint Arch., 2012)

Linear threshold multisecret sharing schemes. - Oriol Farràs; Ignacio Gracia; Sebastià Martín Molleví; Carles Padró (Inf. Process. Lett., 2012)

Ideal Multipartite Secret Sharing Schemes. - Oriol Farràs; Jaume Martí-Farré; Carles Padró (J. Cryptol., 2012)

Ideal Hierarchical Secret Sharing Schemes. - Oriol Farràs; Carles Padró (IEEE Trans. Inf. Theory, 2012)

Finding lower bounds on the complexity of secret sharing schemes by linear programming. - Carles Padró; Leonor Vázquez; An Yang (Discret. Appl. Math., 2013)

Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes. - Carles Padró (IACR Cryptol. ePrint Arch., 2013)

On the Representability of the Biuniform Matroid. - Simeon Ball; Carles Padró; Zsuzsa Weiner; Chaoping Xing (SIAM J. Discret. Math., 2013)

Multi-linear Secret-Sharing Schemes. - Amos Beimel; Aner Ben-Efraim; Carles Padró; Ilya Tyomkin (TCC, 2014)

Optimal Algebraic Manipulation Detection Codes. - Ronald Cramer; Carles Padró; Chaoping Xing (IACR Cryptol. ePrint Arch., 2014)

Optimal Non-Perfect Uniform Secret Sharing Schemes. - Oriol Farràs; Torben Brandt Hansen; Tarik Kaced; Carles Padró (IACR Cryptol. ePrint Arch., 2014)

Natural Generalizations of Threshold Secret Sharing. - Oriol Farràs; Carles Padró; Chaoping Xing; An Yang (IEEE Trans. Inf. Theory, 2014)

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. - Ronald Cramer; Carles Padró; Chaoping Xing (TCC (1), 2015)

Extending Brickell-Davenport theorem to non-perfect secret sharing schemes. - Oriol Farràs; Carles Padró (Des. Codes Cryptogr., 2015)

On Secret Sharing with Nonlinear Product Reconstruction. - Ignacio Cascudo; Ronald Cramer; Diego Mirandola; Carles Padró; Chaoping Xing (SIAM J. Discret. Math., 2015)

A Note on Non-Perfect Secret Sharing. - Oriol Farràs; Sebastià Martín Molleví; Carles Padró (IACR Cryptol. ePrint Arch., 2016)

Secret Sharing, Rank Inequalities, and Information Inequalities. - Sebastià Martín Molleví; Carles Padró; An Yang (IEEE Trans. Inf. Theory, 2016)

On the Information Ratio of Non-perfect Secret Sharing Schemes. - Oriol Farràs; Torben Brandt Hansen; Tarik Kaced; Carles Padró (Algorithmica, 2017)

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. - Oriol Farràs; Tarik Kaced; Sebastià Martín Molleví; Carles Padró (IEEE Trans. Inf. Theory, 2020)

Common information, matroid representation, and secret sharing for matroid ports. - Michael Bamiloshin; Aner Ben-Efraim; Oriol Farràs; Carles Padró (Des. Codes Cryptogr., 2021)

Bipartite secret sharing and staircases. - László Csirmaz; Frantisek Matús; Carles Padró (Discret. Math., 2024)

A note on extension properties and representations of matroids. - Michael Bamiloshin; Oriol Farràs; Carles Padró (Discret. Appl. Math., 2025)

Interaction between skew-representability, tensor products, extension properties, and rank inequalities. - Kristóf Bérczi; Boglárka Gehér; András Imolay; László Lovász 001; Carles Padró; Tamás Schwarcz (CoRR, 2025)