Výsledky vyhledávání - "Carles Padró"

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Autor: Carles Padró, Tarik Kaced, Oriol Farràs, Sebastià Martín

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

We present a new improvement in the linear programming technique to derive lower bounds on the information ratio of secret sharing schemes. We obtain non-Shannon-type bounds without using information inequalities explicitly. Our new technique makes i

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bde563a0372ca23cd3cbf634c63f99be
https://doi.org/10.1109/tit.2020.3005706

Zobrazit plný text záznamu

Common information, matroid representation, and secret sharing for matroid ports

Autor: Carles Padró, Aner Ben-Efraim, Oriol Farràs, Michael Bamiloshin

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)

Linear information and rank inequalities as, for instance, Ingleton inequality, are useful tools in information theory and matroid theory. Even though many such inequalities have been found, it seems that most of them remain undiscovered. Improved re

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::22ddc591a91c007ad5a138cf15570d81

Zobrazit plný text záznamu

Improving the Linear Programming Technique in the Search for Lower Bounds in Secret Sharing

Autor: Carles Padró, Tarik Kaced, Sebastià Martín, Oriol Farràs

Publikováno v: Advances in Cryptology – EUROCRYPT 2018 ISBN: 9783319783802
EUROCRYPT (1)

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::e49706ab9e3d3a25332f492485a99811
https://doi.org/10.1007/978-3-319-78381-9_22

Zobrazit plný text záznamu

Natural Generalizations of Threshold Secret Sharing

Autor: Oriol Farràs, An Yang, Chaoping Xing, Carles Padró

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

© 2014 IEEE. Personal use of this material is permitted. Permission from IEEE must be obtained for all other uses, in any current or future media, including reprinting/republishing this material for advertising or promotional purposes,creating new c

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6b1310dda115f2fc5a720cea2d6221a
https://doi.org/10.1109/tit.2014.2300113

Zobrazit plný text záznamu

Algebraic manipulation detection codes

Autor: Carles Padró, Serge Fehr, Ronald Cramer

Publikováno v: SCIENCE CHINA Mathematics, 56(7), 1349-1358

Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret sharing. Since its introduction, a num

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9ed9c1b3299af0e96be0369358cf699c
https://doi.org/10.1007/s11425-013-4654-5

Zobrazit plný text záznamu

On the Representability of the Biuniform Matroid

Autor: Chaoping Xing, Carles Padró, Simeon Ball, Zsuzsa Weiner

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
SIAM Journal on Discrete Mathematics
Recercat. Dipósit de la Recerca de Catalunya
Universitat Jaume I

Every biuniform matroid is representable over all sufficiently large fields. But it is not known exactly over which finite fields they are representable, and the existence of efficient methods to find a representation for every given biuniform matroi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::f39622b3c640fef538ebd16f4dac8c80
https://doi.org/10.1137/120886960

Zobrazit plný text záznamu

On the optimization of bipartite secret sharing schemes

Autor: Jessica Ruth Metcalf-Burton, Carles Padró, Oriol Farràs, Leonor Vázquez

Publikováno v: UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname

Optimizing the ratio between the maximum length of the shares and the length of the secret value in secret sharing schemes for general access structures is an extremely difficult and long-standing open problem. In this paper, we study it for bipartit

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::abc71120b92f866193ce230d1e01bb73
https://doi.org/10.1007/s10623-011-9552-7

Zobrazit plný text záznamu

Optimal complexity of secret sharing schemes with four minimal qualified subsets

Autor: Carles Padró, Jaume Martí-Farré, Leonor Vázquez

Publikováno v: Designs, Codes and Cryptography. 61:167-186

The complexity of a secret sharing scheme is defined as the ratio between the maximum length of the shares and the length of the secret. This paper deals with the open problem of optimizing this parameter for secret sharing schemes with general acces

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::8346dce252c90a72c79c5e76f7ca216c
https://doi.org/10.1007/s10623-010-9446-0

Zobrazit plný text záznamu

Ideal secret sharing schemes whose minimal qualified subsets have at most three participants

Autor: Carles Padró, Jaume Martí-Farré

Publikováno v: Designs, Codes and Cryptography. 52:1-14

One of the main open problems in secret sharing is the characterization of the access structures of ideal secret sharing schemes. Brickell and Davenport proved that every one of these ideal access structures is related in a certain way to a unique ma

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::277096b9ffb4ad98dc09a5c62c7f90af
https://doi.org/10.1007/s10623-008-9264-9

Zobrazit plný text záznamu

On Codes, Matroids, and Secure Multiparty Computation From Linear Secret-Sharing Schemes

Autor: Jorge Jiménez Urroz, Carles Padró, Ignacio Gracia, Vanesa Daza, Jaume Martí-Farré, Gregor Leander, Ronald Cramer

Publikováno v: Recercat. Dipósit de la Recerca de Catalunya
instname

Error-correcting codes and matroids have been widely used in the study of ordinary secret sharing schemes. In this paper, the connections between codes, matroids, and a special class of secret sharing schemes, namely, multiplicative linear secret sha

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3c1d96fe53159e7c641ccdd737d78465
https://doi.org/10.1109/tit.2008.921692

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání