Scalable mechanisms for rational secret sharing
From MaRDI portal
Publication:2355325
DOI10.1007/s00446-014-0233-4zbMath1333.94053arXiv1205.0581OpenAlexW1995145050MaRDI QIDQ2355325
Mahnush Movahedi, Varsha Dani, Jared Saia
Publication date: 22 July 2015
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1205.0581
Cites Work
- Unnamed Item
- Unnamed Item
- New hash functions and their use in authentication and set equality
- Scalable rational secret sharing
- An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem
- How to share a secret
- Utility Dependence in Correct and Fair Rational Secret Sharing
- Efficient Rational Secret Sharing in Standard Communication Networks
- Rational Secret Sharing, Revisited
- Rational secret sharing and multiparty computation
- Breaking the O ( n 2 ) bit barrier
- Distributed computing meets game theory
- Rationality and Adversarial Behavior in Multi-party Computation
This page was built for publication: Scalable mechanisms for rational secret sharing