Optimal complexity of secret sharing schemes with four minimal qualified subsets.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/dcc/Marti-FarrePV11
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/dcc/Marti-FarrePV11
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Carles_Padr%E2%88%9A%E2%89%A5
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jaume_Mart%E2%88%9A%E2%89%A0-Farr%E2%88%9A%C2%A9
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Leonor_V%E2%88%9A%C2%B0zquez
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1007%2Fs10623-010-9446-0
>
foaf:
homepage
<
https://doi.org/10.1007/s10623-010-9446-0
>
dc:
identifier
DBLP journals/dcc/Marti-FarrePV11
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1007%2Fs10623-010-9446-0
(xsd:string)
dcterms:
issued
2011
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/dcc
>
rdfs:
label
Optimal complexity of secret sharing schemes with four minimal qualified subsets.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Carles_Padr%E2%88%9A%E2%89%A5
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jaume_Mart%E2%88%9A%E2%89%A0-Farr%E2%88%9A%C2%A9
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Leonor_V%E2%88%9A%C2%B0zquez
>
swrc:
number
2
(xsd:string)
swrc:
pages
167-186
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/dcc/Marti-FarrePV11/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/dcc/Marti-FarrePV11
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/dcc/dcc61.html#Marti-FarrePV11
>
rdfs:
seeAlso
<
https://doi.org/10.1007/s10623-010-9446-0
>
dc:
title
Optimal complexity of secret sharing schemes with four minimal qualified subsets.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
61
(xsd:string)