Optimal non-perfect uniform secret sharing schemes

Oriol Farràs; Torben Hansen; Tarik Kaced; Carles Padró

doi:10.1007/978-3-662-44381-1_13

Optimal non-perfect uniform secret sharing schemes

Oriol Farràs, Torben Hansen, Tarik Kaced, Carles Padró

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer-Verlag
Pages	217-234
Number of pages	18
Volume	8617 LNCS
Edition	PART 2
ISBN (Print)	9783662443804
DOIs	https://doi.org/10.1007/978-3-662-44381-1_13
Publication status	Published - 2014
Event	34rd Annual International Cryptology Conference, CRYPTO 2014 - Santa Barbara, CA, United States Duration: 17 Aug 2014 → 21 Aug 2014

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Number	PART 2
Volume	8617 LNCS
ISSN (Print)	03029743
ISSN (Electronic)	16113349

Conference

Conference	34rd Annual International Cryptology Conference, CRYPTO 2014
Country/Territory	United States
City	Santa Barbara, CA
Period	17/08/14 → 21/08/14

Keywords

Information Ratio
Non-perfect secret sharing
Polymatroid
Secret sharing

Access to Document

10.1007/978-3-662-44381-1_13

Cite this

Farràs, O., Hansen, T., Kaced, T., & Padró, C. (2014). Optimal non-perfect uniform secret sharing schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (PART 2 ed., Vol. 8617 LNCS, pp. 217-234). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617 LNCS, No. PART 2). Springer-Verlag. https://doi.org/10.1007/978-3-662-44381-1_13

Farràs, Oriol ; Hansen, Torben ; Kaced, Tarik et al. / Optimal non-perfect uniform secret sharing schemes. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8617 LNCS PART 2. ed. Springer-Verlag, 2014. pp. 217-234 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2).

@inproceedings{2ff8f1619f84447284558dd5822207d7,

title = "Optimal non-perfect uniform secret sharing schemes",

keywords = "Information Ratio, Non-perfect secret sharing, Polymatroid, Secret sharing",

author = "Oriol Farr{\`a}s and Torben Hansen and Tarik Kaced and Carles Padr{\'o}",

year = "2014",

doi = "10.1007/978-3-662-44381-1_13",

language = "English",

isbn = "9783662443804",

volume = "8617 LNCS",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer-Verlag",

number = "PART 2",

pages = "217--234",

booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

edition = "PART 2",

note = "34rd Annual International Cryptology Conference, CRYPTO 2014 ; Conference date: 17-08-2014 Through 21-08-2014",

}

Farràs, O, Hansen, T, Kaced, T & Padró, C 2014, Optimal non-perfect uniform secret sharing schemes. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 edn, vol. 8617 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), no. PART 2, vol. 8617 LNCS, Springer-Verlag, pp. 217-234, 34rd Annual International Cryptology Conference, CRYPTO 2014, Santa Barbara, CA, United States, 17/08/14. https://doi.org/10.1007/978-3-662-44381-1_13

Optimal non-perfect uniform secret sharing schemes. / Farràs, Oriol; Hansen, Torben; Kaced, Tarik et al.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 8617 LNCS PART 2. ed. Springer-Verlag, 2014. p. 217-234 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 8617 LNCS, No. PART 2).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Optimal non-perfect uniform secret sharing schemes

AU - Farràs, Oriol

AU - Hansen, Torben

AU - Kaced, Tarik

AU - Padró, Carles

PY - 2014

Y1 - 2014

KW - Information Ratio

KW - Non-perfect secret sharing

KW - Polymatroid

KW - Secret sharing

UR - http://www.scopus.com/inward/record.url?scp=84905395351&partnerID=8YFLogxK

U2 - 10.1007/978-3-662-44381-1_13

DO - 10.1007/978-3-662-44381-1_13

M3 - Conference contribution

AN - SCOPUS:84905395351

SN - 9783662443804

VL - 8617 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 217

EP - 234

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

PB - Springer-Verlag

T2 - 34rd Annual International Cryptology Conference, CRYPTO 2014

Y2 - 17 August 2014 through 21 August 2014

ER -

Farràs O, Hansen T, Kaced T, Padró C. Optimal non-perfect uniform secret sharing schemes. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). PART 2 ed. Vol. 8617 LNCS. Springer-Verlag. 2014. p. 217-234. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); PART 2). doi: 10.1007/978-3-662-44381-1_13

Optimal non-perfect uniform secret sharing schemes

Publication series

Conference

Keywords

Access to Document

Other files and links

Cite this