Carles Padró
Orcid: 0000-0002-8644-5929Affiliations:
- Polytechnic University of Catalonia, Barcelona, Spain
According to our database1,
Carles Padró
authored at least 66 papers
between 1995 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
5
6
7
8
1
1
1
1
2
2
3
3
5
1
1
1
3
2
1
6
2
7
1
1
3
3
2
3
1
1
1
1
1
1
1
1
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2024
2021
Des. Codes Cryptogr., 2021
2020
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing.
IEEE Trans. Inf. Theory, 2020
2017
2016
IEEE Trans. Inf. Theory, 2016
2015
SIAM J. Discret. Math., 2015
Des. Codes Cryptogr., 2015
Proceedings of the Theory of Cryptography - 12th Theory of Cryptography Conference, 2015
2014
Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014
2013
IACR Cryptol. ePrint Arch., 2013
Finding lower bounds on the complexity of secret sharing schemes by linear programming.
Discret. Appl. Math., 2013
2012
2011
Des. Codes Cryptogr., 2011
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
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
SIAM J. Discret. Math., 2006
Discret. Appl. Math., 2006
2005
Des. Codes Cryptogr., 2005
2004
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
Improving the trade-off between storage and communication in broadcast encryption schemes.
Discret. Appl. Math., 2004
Electron. J. Comb., 2004
2003
Proceedings of the Information Security, 6th International Conference, 2003
2002
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure.
Inf. Process. Lett., 2002
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
2001
Discret. Math., 2001
2000
IEEE Trans. Inf. Theory, 2000
1999
Des. Codes Cryptogr., 1999
1998
SIAM J. Discret. Math., 1998
1997
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
1995