Matches in SemOpenAlex for { <https://semopenalex.org/work/W2952881078> ?p ?o ?g. }
- W2952881078 endingPage "2100" @default.
- W2952881078 startingPage "2083" @default.
- W2952881078 abstract "A secret-sharing scheme realizes the forbidden graph access structure determined by a graph <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$G=(V,E)$ </tex-math></inline-formula> if the parties are the vertices of the graph and the subsets that can reconstruct the secret are the pairs of vertices in <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$E$ </tex-math></inline-formula> (i.e., the edges) and the subsets of at least three vertices. Secret-sharing schemes for forbidden graph access structures defined by bipartite graphs are equivalent to conditional disclosure of secrets (CDS) protocols. We study the complexity of realizing a forbidden graph access structure by linear secret-sharing schemes, which are schemes in which the secret can be reconstructed from the shares by a linear mapping. We provide efficient constructions and lower bounds on the share size of linear secret-sharing schemes for sparse and very dense graphs, closing the gap between upper and lower bounds. Given a sparse (resp. very dense) graph with <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$n$ </tex-math></inline-formula> vertices and at most <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$n^{1+beta }$ </tex-math></inline-formula> edges (resp. at least <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$binom {n}{2} - n^{1+beta }$ </tex-math></inline-formula> edges), for some <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$0 leq beta < 1$ </tex-math></inline-formula> , we construct a linear secret-sharing scheme realizing its forbidden graph access structure with total share size <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$tilde {O} (n^{1+beta /2})$ </tex-math></inline-formula> . Furthermore, we construct linear secret-sharing schemes realizing these access structures in which the size of each share is <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$tilde {O} (n^{1/4+beta /4})$ </tex-math></inline-formula> . We also provide constructions achieving different trade-offs between the size of each share and the total share size. We prove that almost all forbidden graph access structures require linear secret-sharing schemes with total share size <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$Omega (n^{3/2})$ </tex-math></inline-formula> ; this shows that the construction of Gay, Kerenidis, and Wee [CRYPTO 2015] is optimal. Furthermore, we show that for every <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$0 leq beta < 1$ </tex-math></inline-formula> there exist a graph with at most <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$n^{1+beta }$ </tex-math></inline-formula> edges and a graph with at least <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$binom {n}{2}-n^{1+beta }$ </tex-math></inline-formula> edges such that the total share size in any linear secret-sharing scheme realizing the associated forbidden graph access structures is <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$Omega (n^{1+beta /2})$ </tex-math></inline-formula> . Finally, we show that for every <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$0 leq beta < 1$ </tex-math></inline-formula> there exist a graph with at most <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$n^{1+beta }$ </tex-math></inline-formula> edges and a graph with at least <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$binom {n}{2}-n^{1+beta }$ </tex-math></inline-formula> edges such that the size of the share of at least one party in any linear secret-sharing scheme realizing these forbidden graph access structures is <inline-formula xmlns:mml=http://www.w3.org/1998/Math/MathML xmlns:xlink=http://www.w3.org/1999/xlink> <tex-math notation=LaTeX>$Omega (n^{1/4+beta /4})$ </tex-math></inline-formula> . This shows that our constructions are optimal (up to poly-logarithmic factors)." @default.
- W2952881078 created "2019-06-27" @default.
- W2952881078 creator A5007447603 @default.
- W2952881078 creator A5013057020 @default.
- W2952881078 creator A5031372016 @default.
- W2952881078 creator A5039489444 @default.
- W2952881078 date "2022-03-01" @default.
- W2952881078 modified "2023-10-17" @default.
- W2952881078 title "Linear Secret-Sharing Schemes for Forbidden Graph Access Structures" @default.
- W2952881078 cites W1860948751 @default.
- W2952881078 cites W1883290937 @default.
- W2952881078 cites W1995726850 @default.
- W2952881078 cites W2003753892 @default.
- W2952881078 cites W2006453614 @default.
- W2952881078 cites W2008001880 @default.
- W2952881078 cites W2031906711 @default.
- W2952881078 cites W2032876011 @default.
- W2952881078 cites W2039559137 @default.
- W2952881078 cites W2049398763 @default.
- W2952881078 cites W2068101455 @default.
- W2952881078 cites W2076645411 @default.
- W2952881078 cites W2080911030 @default.
- W2952881078 cites W2082145193 @default.
- W2952881078 cites W2120551550 @default.
- W2952881078 cites W2121466947 @default.
- W2952881078 cites W2131278486 @default.
- W2952881078 cites W2138001464 @default.
- W2952881078 cites W2141420453 @default.
- W2952881078 cites W2143656893 @default.
- W2952881078 cites W2169672310 @default.
- W2952881078 cites W2201666892 @default.
- W2952881078 cites W2211075457 @default.
- W2952881078 cites W2515129191 @default.
- W2952881078 cites W2753879715 @default.
- W2952881078 cites W2765972321 @default.
- W2952881078 cites W2792527638 @default.
- W2952881078 cites W2804115786 @default.
- W2952881078 cites W2807891686 @default.
- W2952881078 cites W2809318426 @default.
- W2952881078 cites W2899702797 @default.
- W2952881078 cites W2932503745 @default.
- W2952881078 cites W2951483008 @default.
- W2952881078 cites W2970097841 @default.
- W2952881078 cites W3035460207 @default.
- W2952881078 cites W3158616655 @default.
- W2952881078 cites W51265332 @default.
- W2952881078 doi "https://doi.org/10.1109/tit.2021.3132917" @default.
- W2952881078 hasPublicationYear "2022" @default.
- W2952881078 type Work @default.
- W2952881078 sameAs 2952881078 @default.
- W2952881078 citedByCount "0" @default.
- W2952881078 crossrefType "journal-article" @default.
- W2952881078 hasAuthorship W2952881078A5007447603 @default.
- W2952881078 hasAuthorship W2952881078A5013057020 @default.
- W2952881078 hasAuthorship W2952881078A5031372016 @default.
- W2952881078 hasAuthorship W2952881078A5039489444 @default.
- W2952881078 hasConcept C11413529 @default.
- W2952881078 hasConcept C114614502 @default.
- W2952881078 hasConcept C118615104 @default.
- W2952881078 hasConcept C132525143 @default.
- W2952881078 hasConcept C178489894 @default.
- W2952881078 hasConcept C197657726 @default.
- W2952881078 hasConcept C3087436 @default.
- W2952881078 hasConcept C33923547 @default.
- W2952881078 hasConcept C41008148 @default.
- W2952881078 hasConcept C45357846 @default.
- W2952881078 hasConcept C80444323 @default.
- W2952881078 hasConcept C94375191 @default.
- W2952881078 hasConceptScore W2952881078C11413529 @default.
- W2952881078 hasConceptScore W2952881078C114614502 @default.
- W2952881078 hasConceptScore W2952881078C118615104 @default.
- W2952881078 hasConceptScore W2952881078C132525143 @default.
- W2952881078 hasConceptScore W2952881078C178489894 @default.
- W2952881078 hasConceptScore W2952881078C197657726 @default.
- W2952881078 hasConceptScore W2952881078C3087436 @default.
- W2952881078 hasConceptScore W2952881078C33923547 @default.
- W2952881078 hasConceptScore W2952881078C41008148 @default.
- W2952881078 hasConceptScore W2952881078C45357846 @default.
- W2952881078 hasConceptScore W2952881078C80444323 @default.
- W2952881078 hasConceptScore W2952881078C94375191 @default.
- W2952881078 hasFunder F4320322252 @default.
- W2952881078 hasIssue "3" @default.
- W2952881078 hasLocation W29528810781 @default.
- W2952881078 hasOpenAccess W2952881078 @default.
- W2952881078 hasPrimaryLocation W29528810781 @default.
- W2952881078 hasRelatedWork W2158949528 @default.
- W2952881078 hasRelatedWork W2260035625 @default.
- W2952881078 hasRelatedWork W2375312871 @default.
- W2952881078 hasRelatedWork W2952881078 @default.
- W2952881078 hasRelatedWork W2989925696 @default.
- W2952881078 hasRelatedWork W3201366099 @default.
- W2952881078 hasRelatedWork W3205099810 @default.
- W2952881078 hasRelatedWork W3210704652 @default.
- W2952881078 hasRelatedWork W4286978554 @default.
- W2952881078 hasRelatedWork W782850337 @default.
- W2952881078 hasVolume "68" @default.
- W2952881078 isParatext "false" @default.
- W2952881078 isRetracted "false" @default.