Matches in SemOpenAlex for { <https://semopenalex.org/work/W4297273897> ?p ?o ?g. }
Showing items 1 to 68 of
68
with 100 items per page.
- W4297273897 abstract "We consider the classical secret sharing problem in the case where all agents are selfish but rational. In recent work, Kol and Naor show that, when there are two players, in the non-simultaneous communication model, i.e. when rushing is possible, there is no Nash equilibrium that ensures both players learn the secret. However, they describe a mechanism for this problem, for any number of players, that is an epsilon-Nash equilibrium, in that no player can gain more than epsilon utility by deviating from it. Unfortunately, the Kol and Naor mechanism, and, to the best of our knowledge, all previous mechanisms for this problem require each agent to send O(n) messages in expectation, where n is the number of agents. This may be problematic for some applications of rational secret sharing such as secure multi-party computation and simulation of a mediator. We address this issue by describing mechanisms for rational secret sharing that are designed for large n. Both of our results hold for n > 2, and are Nash equilbria, rather than just epsilon-Nash equilbria. Our first result is a mechanism for n-out-of-n rational secret sharing that is scalable in the sense that it requires each agent to send only an expected O(log n) bits. Moreover, the latency of this mechanism is O(log n) in expectation, compared to O(n) expected latency for the Kol and Naor result. Our second result is a mechanism for a relaxed variant of rational m-out-of-n secret sharing where m = Theta(n). It requires each processor to send O(log n) bits and has O(log n) latency. Both of our mechanisms are non-cryptographic, and are not susceptible to backwards induction." @default.
- W4297273897 created "2022-09-28" @default.
- W4297273897 creator A5039997672 @default.
- W4297273897 creator A5055553753 @default.
- W4297273897 creator A5072429063 @default.
- W4297273897 date "2012-05-02" @default.
- W4297273897 modified "2023-09-23" @default.
- W4297273897 title "Scalable Mechanisms for Rational Secret Sharing" @default.
- W4297273897 doi "https://doi.org/10.48550/arxiv.1205.0581" @default.
- W4297273897 hasPublicationYear "2012" @default.
- W4297273897 type Work @default.
- W4297273897 citedByCount "0" @default.
- W4297273897 crossrefType "posted-content" @default.
- W4297273897 hasAuthorship W4297273897A5039997672 @default.
- W4297273897 hasAuthorship W4297273897A5055553753 @default.
- W4297273897 hasAuthorship W4297273897A5072429063 @default.
- W4297273897 hasBestOaLocation W42972738971 @default.
- W4297273897 hasConcept C11413529 @default.
- W4297273897 hasConcept C118615104 @default.
- W4297273897 hasConcept C144237770 @default.
- W4297273897 hasConcept C177264268 @default.
- W4297273897 hasConcept C178489894 @default.
- W4297273897 hasConcept C18396474 @default.
- W4297273897 hasConcept C199360897 @default.
- W4297273897 hasConcept C3087436 @default.
- W4297273897 hasConcept C33923547 @default.
- W4297273897 hasConcept C38652104 @default.
- W4297273897 hasConcept C41008148 @default.
- W4297273897 hasConcept C45374587 @default.
- W4297273897 hasConcept C46814582 @default.
- W4297273897 hasConcept C48044578 @default.
- W4297273897 hasConcept C77088390 @default.
- W4297273897 hasConcept C80444323 @default.
- W4297273897 hasConcept C85847156 @default.
- W4297273897 hasConceptScore W4297273897C11413529 @default.
- W4297273897 hasConceptScore W4297273897C118615104 @default.
- W4297273897 hasConceptScore W4297273897C144237770 @default.
- W4297273897 hasConceptScore W4297273897C177264268 @default.
- W4297273897 hasConceptScore W4297273897C178489894 @default.
- W4297273897 hasConceptScore W4297273897C18396474 @default.
- W4297273897 hasConceptScore W4297273897C199360897 @default.
- W4297273897 hasConceptScore W4297273897C3087436 @default.
- W4297273897 hasConceptScore W4297273897C33923547 @default.
- W4297273897 hasConceptScore W4297273897C38652104 @default.
- W4297273897 hasConceptScore W4297273897C41008148 @default.
- W4297273897 hasConceptScore W4297273897C45374587 @default.
- W4297273897 hasConceptScore W4297273897C46814582 @default.
- W4297273897 hasConceptScore W4297273897C48044578 @default.
- W4297273897 hasConceptScore W4297273897C77088390 @default.
- W4297273897 hasConceptScore W4297273897C80444323 @default.
- W4297273897 hasConceptScore W4297273897C85847156 @default.
- W4297273897 hasLocation W42972738971 @default.
- W4297273897 hasLocation W42972738972 @default.
- W4297273897 hasOpenAccess W4297273897 @default.
- W4297273897 hasPrimaryLocation W42972738971 @default.
- W4297273897 hasRelatedWork W1492546183 @default.
- W4297273897 hasRelatedWork W1512053738 @default.
- W4297273897 hasRelatedWork W1590869672 @default.
- W4297273897 hasRelatedWork W1795970939 @default.
- W4297273897 hasRelatedWork W2088846649 @default.
- W4297273897 hasRelatedWork W2090150892 @default.
- W4297273897 hasRelatedWork W2137866924 @default.
- W4297273897 hasRelatedWork W2363798811 @default.
- W4297273897 hasRelatedWork W2947405052 @default.
- W4297273897 hasRelatedWork W3085731999 @default.
- W4297273897 isParatext "false" @default.
- W4297273897 isRetracted "false" @default.
- W4297273897 workType "article" @default.