Carles Padró

Orcid: 0000-0002-8644-5929

Affiliations:
  • Polytechnic University of Catalonia, Barcelona, Spain


According to our database1, Carles Padró authored at least 66 papers between 1995 and 2021.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2021
Common information, matroid representation, and secret sharing for matroid ports.
Des. Codes Cryptogr., 2021

Bipartite secret sharing and staircases.
CoRR, 2021

2020
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing.
IEEE Trans. Inf. Theory, 2020

2017
On the Information Ratio of Non-perfect Secret Sharing Schemes.
Algorithmica, 2017

2016
Secret Sharing, Rank Inequalities, and Information Inequalities.
IEEE Trans. Inf. Theory, 2016

A Note on Non-Perfect Secret Sharing.
IACR Cryptol. ePrint Arch., 2016

2015
On Secret Sharing with Nonlinear Product Reconstruction.
SIAM J. Discret. Math., 2015

Extending Brickell-Davenport theorem to non-perfect secret sharing schemes.
Des. Codes Cryptogr., 2015

Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model.
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015

2014
Natural Generalizations of Threshold Secret Sharing.
IEEE Trans. Inf. Theory, 2014

Optimal Non-Perfect Uniform Secret Sharing Schemes.
IACR Cryptol. ePrint Arch., 2014

Optimal Algebraic Manipulation Detection Codes.
IACR Cryptol. ePrint Arch., 2014

Multi-linear Secret-Sharing Schemes.
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

2013
On the Representability of the Biuniform Matroid.
SIAM J. Discret. Math., 2013

Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes.
IACR Cryptol. ePrint Arch., 2013

Finding lower bounds on the complexity of secret sharing schemes by linear programming.
Discret. Appl. Math., 2013

2012
Ideal Hierarchical Secret Sharing Schemes.
IEEE Trans. Inf. Theory, 2012

Ideal Multipartite Secret Sharing Schemes.
J. Cryptol., 2012

Linear threshold multisecret sharing schemes.
Inf. Process. Lett., 2012

Lecture Notes in Secret Sharing.
IACR Cryptol. ePrint Arch., 2012

On the optimization of bipartite secret sharing schemes.
Des. Codes Cryptogr., 2012

2011
Optimal complexity of secret sharing schemes with four minimal qualified subsets.
Des. Codes Cryptogr., 2011

Ideal Secret Sharing Schemes for Useful Multipartite Access Structures.
Proceedings of the Coding and Cryptology - Third International Workshop, 2011

2010
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming.
Proceedings of the LATIN 2010: Theoretical Informatics, 2010

2009
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants.
Des. Codes Cryptogr., 2009

Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes.
Proceedings of the Cryptography and Coding, 2009

2008
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes.
IEEE Trans. Inf. Theory, 2008

Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors.
IACR Cryptol. ePrint Arch., 2008

On the Diameter of Matroid Ports.
Electron. J. Comb., 2008

Matroids Can Be Far from Ideal Secret Sharing.
Proceedings of the Theory of Cryptography, Fifth Theory of Cryptography Conference, 2008

2007
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra.
Proceedings of the Advances in Cryptology, 2007

2006
Representing Small Identically Self-Dual Matroids by Self-Dual Codes.
SIAM J. Discret. Math., 2006

On Secret Sharing Schemes, Matroids and Polymatroids.
IACR Cryptol. ePrint Arch., 2006

Secret sharing schemes on access structures with intersection number equal to one.
Discret. Appl. Math., 2006

2005
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets.
Des. Codes Cryptogr., 2005

2004
Correction to "Secret Sharing Schemes With Bipartite Access Structure".
IEEE Trans. Inf. Theory, 2004

Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures.
Theor. Comput. Sci., 2004

On codes, matroids and secure multi-party computation from linear secret sharing schemes.
IACR Cryptol. ePrint Arch., 2004

A Linear Algebraic Approach to Metering Schemes.
Des. Codes Cryptogr., 2004

Improving the trade-off between storage and communication in broadcast encryption schemes.
Discret. Appl. Math., 2004

Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three.
Electron. J. Comb., 2004

2003
Distributed RSA Signature Schemes for General Access Structures.
Proceedings of the Information Security, 6th International Conference, 2003

2002
Partial line directed hypergraphs.
Networks, 2002

Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
Inf. Process. Lett., 2002

A Distributed and Computationally Secure Key Distribution Scheme.
IACR Cryptol. ePrint Arch., 2002

Linear Key Predistribution Schemes.
Des. Codes Cryptogr., 2002

Secret Sharing Schemes with Detection of Cheaters for a General Access Structure.
Des. Codes Cryptogr., 2002

Connectivity and fault-tolerance of hyperdigraphs.
Discret. Appl. Math., 2002

Taking cube roots in <sup>Zm</sup>.
Appl. Math. Lett., 2002

2001
Linear broadcast encryption schemes.
Electron. Notes Discret. Math., 2001

A Ramp Model for Distributed Key Distribution Schemes.
Electron. Notes Discret. Math., 2001

New bounds on the diameter vulnerability of iterated line digraphs.
Discret. Math., 2001

2000
Secret sharing schemes with bipartite access structure.
IEEE Trans. Inf. Theory, 2000

1999
Weighted Threshold Secret Sharing Schemes.
Inf. Process. Lett., 1999

Disjoint paths of bounded length in large generalized cycles.
Discret. Math., 1999

Detection of Cheaters in Vector Space Secret Sharing Schemes.
Des. Codes Cryptogr., 1999

1998
Fault-Tolerant Fixed Routings in Some Families of Digraphs.
SIAM J. Discret. Math., 1998

Robust Vector Space Secret Sharing Schemes.
Inf. Process. Lett., 1998

Large Generalized Cycles.
Discret. Appl. Math., 1998

1997
Spanners of Underlying Graphs of Iterated Line Digraphs.
Inf. Process. Lett., 1997

Spanners of de Bruijn and Kautz Graphs.
Inf. Process. Lett., 1997

Fault-Tolerant Routings in Large Generalized Cycles.
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997

1996
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs".
IEEE Trans. Computers, 1996

Diameter vulnerability of iterated line digraphs.
Discret. Math., 1996

Diameter-vulnerability of Large Bipartite Digraphs.
Discret. Appl. Math., 1996

1995
Large (d, D, D', s) - bipartite Digraphs.
Discret. Appl. Math., 1995


  Loading...