Scalable rational secret sharing

DOI10.1145/1993806.1993833zbMATH Open1321.94105OpenAlexW2001578254MaRDI QIDQ2943397FDOQ2943397

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

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

zbMATH Keywords

game theorycryptographysecret sharingmultiparty computation

Mathematics Subject Classification ID

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

Cites Work

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

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)