Scalable rational secret sharing

DOI10.1145/1993806.1993833MaRDI QIDQ2943397zbMATH OpenOpenAlexFDO

Authors Varsha Dani, Mahnush Movahedi, Yamel Rodriguez, Jared Saia

Publication date 11 September 2015

Published in Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1993806.1993833

zbMATH Keywords

game theorycryptographysecret sharingmultiparty computation

Mathematics Subject Classification ID

Applications of game theory (91A80) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Scalable mechanisms for rational secret sharing
• Rational secret sharing and multiparty computation
• Rational Secret Sharing, Revisited
• Efficient rational secret sharing in standard communication networks
• Purely Rational Secret Sharing (Extended Abstract)
• Scalable Secure Multiparty Computation
• Verifiably multiplicative secret sharing
• Verifiably Multiplicative Secret Sharing
• A rational secret sharing protocol with unconditional security in the synchronous setting

Cites work

• scientific article; zbMATH DE number 795590 (Why is no real title available?)
• Almost-Everywhere Secure Computation
• Broadcasting in dynamic radio networks
• Consensus algorithms with one-bit messages
• Continuous consensus via common knowledge
• Distributed computation in dynamic networks
• Fault Tolerance in Networks of Bounded Degree
• Flooding time in edge-Markovian dynamic graphs
• Gradient clock synchronization in dynamic networks
• How to Explore a Fast-Changing World (Cover Time of a Simple Random Walk on Evolving Graphs)
• Knowledge and common knowledge in a Byzantine environment: Crash failures
• Knowledge and common knowledge in a distributed environment
• Opportunistic information dissemination in mobile ad-hoc networks: the profit of global synchrony
• Optimal gradient clock synchronization in dynamic networks
• Parsimonious flooding in dynamic graphs
• Perfectly secure message transmission
• Programming simultaneous actions using common knowledge
• Reaching Agreement in the Presence of Faults

Cited in

(4)

• Rational secret sharing and multiparty computation
• Scalable mechanisms for rational secret sharing
• Overcoming free riding in multi-party computations -- the anonymous case
• The role of a-priori information in networks of rational agents

This page was built for publication: Scalable rational secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2943397)