default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDCarles Padró
Person information
- affiliation: Polytechnic University of Catalonia, Barcelona, Spain
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j51]László Csirmaz
, Frantisek Matús, Carles Padró:
Bipartite secret sharing and staircases. Discret. Math. 347(5): 113909 (2024)- 2021
- [j50]Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró:
Common information, matroid representation, and secret sharing for matroid ports. Des. Codes Cryptogr. 89(1): 143-166 (2021) - [i26]László Csirmaz, Frantisek Matús, Carles Padró:
Bipartite secret sharing and staircases. CoRR abs/2103.04904 (2021) - 2020
- [j49]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IEEE Trans. Inf. Theory 66(11): 7088-7100 (2020) - [i25]Michael Bamiloshin, Aner Ben-Efraim, Oriol Farràs, Carles Padró:
Common Information, Matroid Representation, and Secret Sharing for Matroid Ports. CoRR abs/2002.08108 (2020)
2010 – 2019
- 2018
- [c27]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. EUROCRYPT (1) 2018: 597-621 - 2017
- [j48]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
On the Information Ratio of Non-perfect Secret Sharing Schemes. Algorithmica 79(4): 987-1013 (2017) - [i24]Oriol Farràs, Tarik Kaced, Sebastià Martín Molleví, Carles Padró:
Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing. IACR Cryptol. ePrint Arch. 2017: 919 (2017) - 2016
- [j47]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities, and Information Inequalities. IEEE Trans. Inf. Theory 62(1): 599-609 (2016) - [i23]Oriol Farràs, Sebastià Martín Molleví, Carles Padró:
A Note on Non-Perfect Secret Sharing. IACR Cryptol. ePrint Arch. 2016: 348 (2016) - 2015
- [j46]Oriol Farràs, Carles Padró:
Extending Brickell-Davenport theorem to non-perfect secret sharing schemes. Des. Codes Cryptogr. 74(2): 495-510 (2015) - [j45]Ignacio Cascudo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On Secret Sharing with Nonlinear Product Reconstruction. SIAM J. Discret. Math. 29(2): 1114-1131 (2015) - [c26]Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model. TCC (1) 2015: 481-501 - 2014
- [j44]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IEEE Trans. Inf. Theory 60(3): 1652-1664 (2014) - [c25]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-perfect Uniform Secret Sharing Schemes. CRYPTO (2) 2014: 217-234 - [c24]Amos Beimel, Aner Ben-Efraim, Carles Padró, Ilya Tyomkin:
Multi-linear Secret-Sharing Schemes. TCC 2014: 394-418 - [e1]Carles Padró:
Information Theoretic Security - 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings. Lecture Notes in Computer Science 8317, Springer 2014, ISBN 978-3-319-04267-1 [contents] - [i22]Ronald Cramer, Carles Padró, Chaoping Xing:
Optimal Algebraic Manipulation Detection Codes. IACR Cryptol. ePrint Arch. 2014: 116 (2014) - [i21]Oriol Farràs, Torben Brandt Hansen, Tarik Kaced, Carles Padró:
Optimal Non-Perfect Uniform Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2014: 124 (2014) - 2013
- [j43]Carles Padró, Leonor Vázquez, An Yang:
Finding lower bounds on the complexity of secret sharing schemes by linear programming. Discret. Appl. Math. 161(7-8): 1072-1084 (2013) - [j42]Simeon Ball, Carles Padró, Zsuzsa Weiner, Chaoping Xing:
On the Representability of the Biuniform Matroid. SIAM J. Discret. Math. 27(3): 1482-1491 (2013) - [c23]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. CRYPTO (2) 2013: 277-288 - [i20]Carles Padró:
Lower Bounds on the Information Ratio of Linear Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2013: 47 (2013) - [i19]Sebastià Martín Molleví, Carles Padró, An Yang:
Secret Sharing, Rank Inequalities and Information Inequalities. IACR Cryptol. ePrint Arch. 2013: 82 (2013) - [i18]Ignacio Cascudo Pueyo, Ronald Cramer, Diego Mirandola, Carles Padró, Chaoping Xing:
On secret sharing with nonlinear product reconstruction. IACR Cryptol. ePrint Arch. 2013: 503 (2013) - 2012
- [j41]Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez:
On the optimization of bipartite secret sharing schemes. Des. Codes Cryptogr. 63(2): 255-271 (2012) - [j40]Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear threshold multisecret sharing schemes. Inf. Process. Lett. 112(17-18): 667-673 (2012) - [j39]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. J. Cryptol. 25(3): 434-463 (2012) - [j38]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. IEEE Trans. Inf. Theory 58(5): 3273-3286 (2012) - [i17]Carles Padró, Leonor Vázquez, An Yang:
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. IACR Cryptol. ePrint Arch. 2012: 464 (2012) - [i16]Oriol Farràs, Carles Padró:
Extending Brickell-Davenport Theorem to Non-Perfect Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2012: 595 (2012) - [i15]Carles Padró:
Lecture Notes in Secret Sharing. IACR Cryptol. ePrint Arch. 2012: 674 (2012) - [i14]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. IACR Cryptol. ePrint Arch. 2012: 680 (2012) - 2011
- [j37]Jaume Martí-Farré, Carles Padró, Leonor Vázquez:
Optimal complexity of secret sharing schemes with four minimal qualified subsets. Des. Codes Cryptogr. 61(2): 167-186 (2011) - [c22]Oriol Farràs, Carles Padró, Chaoping Xing, An Yang:
Natural Generalizations of Threshold Secret Sharing. ASIACRYPT 2011: 610-627 - [c21]Oriol Farràs, Carles Padró:
Ideal Secret Sharing Schemes for Useful Multipartite Access Structures. IWCC 2011: 99-108 - 2010
- [j36]Jaume Martí-Farré, Carles Padró:
On secret sharing schemes, matroids and polymatroids. J. Math. Cryptol. 4(2): 95-120 (2010) - [c20]Carles Padró, Leonor Vázquez:
Finding Lower Bounds on the Complexity of Secret Sharing Schemes by Linear Programming. LATIN 2010: 344-355 - [c19]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. TCC 2010: 219-236
2000 – 2009
- 2009
- [j35]Jaume Martí-Farré, Carles Padró:
Ideal secret sharing schemes whose minimal qualified subsets have at most three participants. Des. Codes Cryptogr. 52(1): 1-14 (2009) - [c18]Oriol Farràs, Jessica Ruth Metcalf-Burton, Carles Padró, Leonor Vázquez:
On the Optimization of Bipartite Secret Sharing Schemes. ICITS 2009: 93-109 - [c17]Oriol Farràs, Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Linear Threshold Multisecret Sharing Schemes. ICITS 2009: 110-126 - [c16]Hao Chen, San Ling, Carles Padró, Huaxiong Wang, Chaoping Xing:
Key Predistribution Schemes and One-Time Broadcast Encryption Schemes from Algebraic Geometry Codes. IMACC 2009: 263-277 - [i13]Oriol Farràs, Carles Padró:
Ideal Hierarchical Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2009: 141 (2009) - 2008
- [j34]Jaume Martí-Farré, Carles Padró, Leonor Vázquez:
On the Diameter of Matroid Ports. Electron. J. Comb. 15(1) (2008) - [j33]Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró:
On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes. IEEE Trans. Inf. Theory 54(6): 2644-2657 (2008) - [c15]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. EUROCRYPT 2008: 471-488 - [c14]Amos Beimel, Noam Livne, Carles Padró:
Matroids Can Be Far from Ideal Secret Sharing. TCC 2008: 194-212 - [i12]Ronald Cramer, Yevgeniy Dodis, Serge Fehr, Carles Padró, Daniel Wichs:
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors. IACR Cryptol. ePrint Arch. 2008: 30 (2008) - 2007
- [c13]Ronald Cramer, Eike Kiltz, Carles Padró:
A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra. CRYPTO 2007: 613-630 - [c12]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. EUROCRYPT 2007: 448-465 - [c11]Jaume Martí-Farré, Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids. TCC 2007: 273-290 - 2006
- [j32]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on access structures with intersection number equal to one. Discret. Appl. Math. 154(3): 552-563 (2006) - [j31]Carles Padró, Ignacio Gracia:
Representing Small Identically Self-Dual Matroids by Self-Dual Codes. SIAM J. Discret. Math. 20(4): 1046-1055 (2006) - [c10]Jaume Martí-Farré, Carles Padró:
Ideal Secret Sharing Schemes Whose Minimal Qualified Subsets Have at Most Three Participants. SCN 2006: 201-215 - [i11]Jaume Martí-Farré, Carles Padró:
On Secret Sharing Schemes, Matroids and Polymatroids. IACR Cryptol. ePrint Arch. 2006: 77 (2006) - [i10]Oriol Farràs, Jaume Martí-Farré, Carles Padró:
Ideal Multipartite Secret Sharing Schemes. IACR Cryptol. ePrint Arch. 2006: 292 (2006) - 2005
- [j30]Jaume Martí-Farré, Carles Padró:
Secret Sharing Schemes with Three or Four Minimal Qualified Subsets. Des. Codes Cryptogr. 34(1): 17-34 (2005) - [c9]Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró:
On Codes, Matroids and Secure Multi-party Computation from Linear Secret Sharing Schemes. CRYPTO 2005: 327-343 - [i9]Carles Padró, Ignacio Gracia:
Representing small identically self-dual matroids by self-dual codes. IACR Cryptol. ePrint Arch. 2005: 376 (2005) - 2004
- [j29]Jaume Martí-Farré, Carles Padró:
Secret Sharing Schemes on Sparse Homogeneous Access Structures with Rank Three. Electron. J. Comb. 11(1) (2004) - [j28]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví:
Improving the trade-off between storage and communication in broadcast encryption schemes. Discret. Appl. Math. 143(1-3): 213-220 (2004) - [j27]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. Des. Codes Cryptogr. 33(3): 241-260 (2004) - [j26]Carlo Blundo, Paolo D'Arco, Vanesa Daza, Carles Padró:
Bounds and constructions for unconditionally secure distributed key distribution schemes for general access structures. Theor. Comput. Sci. 320(2-3): 269-291 (2004) - [j25]Carles Padró, Germán Sáez:
Correction to "Secret Sharing Schemes With Bipartite Access Structure". IEEE Trans. Inf. Theory 50(6): 1373- (2004) - [i8]Ronald Cramer, Vanesa Daza, Ignacio Gracia, Jorge Jiménez Urroz, Gregor Leander, Jaume Martí-Farré, Carles Padró:
On codes, matroids and secure multi-party computation from linear secret sharing schemes. IACR Cryptol. ePrint Arch. 2004: 245 (2004) - 2003
- [j24]Carlo Blundo, Paolo D'Arco, Carles Padró:
A Ramp Model for Distributed Key Distribution Schemes. Discret. Appl. Math. 128(1): 47-64 (2003) - [j23]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear Broadcast Encryption Schemes. Discret. Appl. Math. 128(1): 223-238 (2003) - [c8]Javier Herranz, Carles Padró, Germán Sáez:
Distributed RSA Signature Schemes for General Access Structures. ISC 2003: 122-136 - [i7]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on sparse homogeneous access structures with rank three. IACR Cryptol. ePrint Arch. 2003: 151 (2003) - 2002
- [j22]Carles Padró, Germán Sáez:
Taking cube roots in Zm. Appl. Math. Lett. 15(6): 703-708 (2002) - [j21]Daniela Ferrero, Carles Padró:
Connectivity and fault-tolerance of hyperdigraphs. Discret. Appl. Math. 117(1-3): 15-26 (2002) - [j20]Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. Des. Codes Cryptogr. 25(2): 175-188 (2002) - [j19]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear Key Predistribution Schemes. Des. Codes Cryptogr. 25(3): 281-298 (2002) - [j18]Carles Padró, Germán Sáez:
Lower bounds on the information rate of secret sharing schemes with homogeneous access structure. Inf. Process. Lett. 83(6): 345-351 (2002) - [j17]Daniela Ferrero, Carles Padró:
Partial line directed hypergraphs. Networks 39(2): 61-67 (2002) - [c7]Vanesa Daza, Javier Herranz, Carles Padró, Germán Sáez:
A Distributed and Computationally Secure Key Distribution Scheme. ISC 2002: 342-356 - [c6]Jaume Martí-Farré, Carles Padró:
Secret Sharing Schemes on Access Structures with Intersection Number Equal to One. SCN 2002: 354-363 - [i6]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes with three or four minimal qualified subsets. IACR Cryptol. ePrint Arch. 2002: 50 (2002) - [i5]Vanesa Daza, Javier Herranz, Carles Padró, Germán Sáez:
A Distributed and Computationally Secure Key Distribution Scheme. IACR Cryptol. ePrint Arch. 2002: 69 (2002) - [i4]Jaume Martí-Farré, Carles Padró:
Secret sharing schemes on access structures with intersection number equal to one. IACR Cryptol. ePrint Arch. 2002: 106 (2002) - 2001
- [j16]Daniela Ferrero, Carles Padró:
New bounds on the diameter vulnerability of iterated line digraphs. Discret. Math. 233(1-3): 103-113 (2001) - [j15]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear broadcast encryption schemes. Electron. Notes Discret. Math. 6: 35-44 (2001) - [j14]Carlo Blundo, Paolo D'Arco, Carles Padró:
A Ramp Model for Distributed Key Distribution Schemes. Electron. Notes Discret. Math. 6: 45-54 (2001) - [c5]Carlo Blundo, Paolo D'Arco, Vanesa Daza, Carles Padró:
Bounds and Constructions for Unconditionally Secure Distributed Key Distribution Schemes for General Access Structures. ISC 2001: 1-17 - [i3]Carlo Blundo, Sebastià Martín Molleví, Barbara Masucci, Carles Padró:
A Linear Algebraic Approach to Metering Schemes. IACR Cryptol. ePrint Arch. 2001: 87 (2001) - [i2]Ignacio Gracia, Sebastià Martín Molleví, Carles Padró:
Improving the trade-off between storage and communication in broadcast encryption schemes. IACR Cryptol. ePrint Arch. 2001: 88 (2001) - [i1]Carles Padró, Ignacio Gracia, Sebastià Martín Molleví, Paz Morillo:
Linear broadcast encryption schemes. IACR Cryptol. ePrint Arch. 2001: 89 (2001) - 2000
- [j13]Carles Padró, Germán Sáez:
Secret sharing schemes with bipartite access structure. IEEE Trans. Inf. Theory 46(7): 2596-2604 (2000)
1990 – 1999
- 1999
- [j12]Carles Padró, Germán Sáez, Jorge Luis Villar:
Detection of Cheaters in Vector Space Secret Sharing Schemes. Des. Codes Cryptogr. 16(1): 75-85 (1999) - [j11]Daniela Ferrero, Carles Padró:
Disjoint paths of bounded length in large generalized cycles. Discret. Math. 197-198: 285-298 (1999) - [j10]Paz Morillo, Carles Padró, Germán Sáez, Jorge Luis Villar:
Weighted Threshold Secret Sharing Schemes. Inf. Process. Lett. 70(5): 211-216 (1999) - [c4]Sergio Cabello, Carles Padró, Germán Sáez:
Secret Sharing Schemes with Detection of Cheaters for a General Access Structure. FCT 1999: 185-194 - 1998
- [j9]José Gómez, Carles Padró, Stephane Perennes:
Large Generalized Cycles. Discret. Appl. Math. 89(1-3): 107-123 (1998) - [j8]Carles Padró:
Robust Vector Space Secret Sharing Schemes. Inf. Process. Lett. 68(3): 107-111 (1998) - [j7]Carles Padró, Paz Morillo, Xavier Muñoz:
Fault-Tolerant Fixed Routings in Some Families of Digraphs. SIAM J. Discret. Math. 11(3): 501-509 (1998) - [c3]Carles Padró, Germán Sáez:
Secret Sharing Schemes with Bipartite Access Structure. EUROCRYPT 1998: 500-511 - 1997
- [j6]Rabah Harbane, Carles Padró:
Spanners of de Bruijn and Kautz Graphs. Inf. Process. Lett. 62(5): 231-236 (1997) - [j5]Rabah Harbane, Carles Padró:
Spanners of Underlying Graphs of Iterated Line Digraphs. Inf. Process. Lett. 62(5): 245-250 (1997) - [c2]Daniela Ferrero, Carles Padró:
Fault-Tolerant Routings in Large Generalized Cycles. SCCC 1997: 58-65 - 1996
- [j4]Carles Padró, Paz Morillo, Eduard Llobet Valero:
Diameter-vulnerability of Large Bipartite Digraphs. Discret. Appl. Math. 64(3): 239-248 (1996) - [j3]Carles Padró, Paz Morillo:
Diameter vulnerability of iterated line digraphs. Discret. Math. 149(1-3): 189-204 (1996) - [j2]Carles Padró, Paz Morillo, Miguel Angel Fiol:
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs". IEEE Trans. Computers 45(6): 768 (1996) - [c1]Rabah Harbane, Carles Padró:
Spanners of Underlying Graphs of Iterated Line Digraphs. SIROCCO 1996: 180-194 - 1995
- [j1]José Gómez, Paz Morillo, Carles Padró:
Large (d, D, D', s) - bipartite Digraphs. Discret. Appl. Math. 59(2): 103-114 (1995)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-03-04 22:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
