Carles Padro
Carles Padro
Department of Mathematics, Universitat Politècnica de Catalunya
Geverifieerd e-mailadres voor upc.edu - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Detection of algebraic manipulation with applications to robust secret sharing and fuzzy extractors
R Cramer, Y Dodis, S Fehr, C Padró, D Wichs
Annual International Conference on the Theory and Applications of …, 2008
2932008
Secret sharing schemes with bipartite access structure
C Padró, G Sáez
IEEE Transactions on Information Theory 46 (7), 2596-2604, 2000
1312000
Ideal multipartite secret sharing schemes
O Farràs, J Martí-Farré, C Padró
Journal of cryptology 25 (3), 434-463, 2012
129*2012
Ideal hierarchical secret sharing schemes
O Farras, C Padró
IEEE transactions on information theory 58 (5), 3273-3286, 2012
1002012
On secret sharing schemes, matroids and polymatroids
J Martí-Farré, C Padró
Theory of Cryptography Conference, 273-290, 2007
1002007
Secret sharing schemes with detection of cheaters for a general access structure
S Cabello, C Padró, G Sáez
Designs, Codes and Cryptography 25 (2), 175-188, 2002
92*2002
On codes, matroids, and secure multiparty computation from linear secret-sharing schemes
R Cramer, V Daza, I Gracia, JJ Urroz, G Leander, J Martí-Farré, C Padró
IEEE Transactions on Information Theory 54 (6), 2644-2657, 2008
822008
Weighted threshold secret sharing schemes
P Morillo, C Padró, G Sáez, JL Villar
Information processing letters 70 (5), 211-216, 1999
811999
Matroids can be far from ideal secret sharing
A Beimel, N Livne, C Padró
Theory of Cryptography Conference, 194-212, 2008
662008
Detection of cheaters in vector space secret sharing schemes
C Padro, G Sáez, JL Villar
Designs, Codes and cryptography 16 (1), 75-85, 1999
601999
Secret sharing schemes with three or four minimal qualified subsets
J Martí-Farré, C Padró
Designs, Codes and Cryptography 34 (1), 17-34, 2005
552005
On the information ratio of non-perfect secret sharing schemes
O Farras, TB Hansen, T Kaced, C Padró
Algorithmica 79 (4), 987-1013, 2017
43*2017
Finding lower bounds on the complexity of secret sharing schemes by linear programming
C Padró, L Vázquez, A Yang
Discrete applied mathematics 161 (7-8), 1072-1084, 2013
422013
Secret sharing schemes on access structures with intersection number equal to one
J Martí-Farré, C Padró
Discrete Applied Mathematics 154 (3), 552-563, 2006
40*2006
Multi-linear secret-sharing schemes
A Beimel, A Ben-Efraim, C Padró, I Tyomkin
Theory of Cryptography Conference, 394-418, 2014
372014
Natural generalizations of threshold secret sharing
O Farras, C Padró, C Xing, A Yang
IEEE transactions on information theory 60 (3), 1652-1664, 2014
342014
Algebraic manipulation detection codes
R Cramer, S Fehr, C Padró
Science China Mathematics 56 (7), 1349-1358, 2013
342013
A note on secure computation of the Moore-Penrose pseudoinverse and its application to secure linear algebra
R Cramer, E Kiltz, C Padró
Annual International Cryptology Conference, 613-630, 2007
312007
Secret sharing schemes on sparse homogeneous access structures with rank three
J Martí-Farré, C Padró
the electronic journal of combinatorics 11 (1), R72, 2004
302004
Secret sharing, rank inequalities, and information inequalities
S Martin, C Padró, A Yang
IEEE Transactions on Information Theory 62 (1), 599-609, 2015
292015
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20