Matches in SemOpenAlex for { <https://semopenalex.org/work/W4285706985> ?p ?o ?g. }
Showing items 1 to 49 of
49
with 100 items per page.
- W4285706985 abstract "Consider the communication efficient secret sharing problem. A dealer wants to share a secret with $n$ parties such that any $kleq n$ parties can reconstruct the secret and any $z<k$ parties eavesdropping on their shares obtain no information about the secret. In addition, a legitimate user contacting any $d$, $kleq d leq n$, parties to decode the secret can do so by reading and downloading the minimum amount of information needed. We are interested in communication efficient secret sharing schemes that tolerate the presence of malicious parties actively corrupting their shares and the data delivered to the users. The knowledge of the malicious parties about the secret is restricted to the shares they obtain. We characterize the capacity, i.e. maximum size of the secret that can be shared. We derive the minimum amount of information needed to to be read and communicated to a legitimate user to decode the secret from $d$ parties, $kleq d leq n$. Error-correcting codes do not achieve capacity in this setting. We construct codes that achieve capacity and achieve minimum read and communication costs for all possible values of $d$. Our codes are based on Staircase codes, previously introduced for communication efficient secret sharing, and on the use of a pairwise hashing scheme used in distributed data storage and network coding settings to detect errors inserted by a limited knowledge adversary." @default.
- W4285706985 created "2022-07-18" @default.
- W4285706985 creator A5021229539 @default.
- W4285706985 creator A5024768934 @default.
- W4285706985 date "2020-02-09" @default.
- W4285706985 modified "2023-09-28" @default.
- W4285706985 title "Communication Efficient Secret Sharing in the Presence of Malicious Adversary" @default.
- W4285706985 doi "https://doi.org/10.48550/arxiv.2002.03374" @default.
- W4285706985 hasPublicationYear "2020" @default.
- W4285706985 type Work @default.
- W4285706985 citedByCount "0" @default.
- W4285706985 crossrefType "posted-content" @default.
- W4285706985 hasAuthorship W4285706985A5021229539 @default.
- W4285706985 hasAuthorship W4285706985A5024768934 @default.
- W4285706985 hasBestOaLocation W42857069851 @default.
- W4285706985 hasConcept C178489894 @default.
- W4285706985 hasConcept C18396474 @default.
- W4285706985 hasConcept C2776788033 @default.
- W4285706985 hasConcept C3087436 @default.
- W4285706985 hasConcept C31258907 @default.
- W4285706985 hasConcept C38652104 @default.
- W4285706985 hasConcept C41008148 @default.
- W4285706985 hasConcept C41065033 @default.
- W4285706985 hasConcept C80444323 @default.
- W4285706985 hasConceptScore W4285706985C178489894 @default.
- W4285706985 hasConceptScore W4285706985C18396474 @default.
- W4285706985 hasConceptScore W4285706985C2776788033 @default.
- W4285706985 hasConceptScore W4285706985C3087436 @default.
- W4285706985 hasConceptScore W4285706985C31258907 @default.
- W4285706985 hasConceptScore W4285706985C38652104 @default.
- W4285706985 hasConceptScore W4285706985C41008148 @default.
- W4285706985 hasConceptScore W4285706985C41065033 @default.
- W4285706985 hasConceptScore W4285706985C80444323 @default.
- W4285706985 hasLocation W42857069851 @default.
- W4285706985 hasOpenAccess W4285706985 @default.
- W4285706985 hasPrimaryLocation W42857069851 @default.
- W4285706985 hasRelatedWork W2141593530 @default.
- W4285706985 hasRelatedWork W2186955778 @default.
- W4285706985 hasRelatedWork W2379384651 @default.
- W4285706985 hasRelatedWork W2506733341 @default.
- W4285706985 hasRelatedWork W2809607206 @default.
- W4285706985 hasRelatedWork W2952521714 @default.
- W4285706985 hasRelatedWork W2975136966 @default.
- W4285706985 hasRelatedWork W3003915831 @default.
- W4285706985 hasRelatedWork W3005418497 @default.
- W4285706985 hasRelatedWork W3138314820 @default.
- W4285706985 isParatext "false" @default.
- W4285706985 isRetracted "false" @default.
- W4285706985 workType "article" @default.