Rational secret sharing and multiparty computation: extended abstract
By Joseph Y. Halpern, Vanessa Teague. Symposium on the Theory of Computing, 2004
354 citations recorded by the source corpus.
We consider the problems of secret sharing and multiparty computation, assuming that agents prefer to get the secret (resp., function value) to not getting it, and secondarily, prefer that as few as possible of the other agents get it. We show that, under these assumptions, neither secret sharing nor multiparty function computation is possible using a mechanism that has a fixed running time. However, we show that both are possible using randomized mechanisms with constant expected running time.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/a6c82f6bcf58ab91362e15e302cce5d88737d09e
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Iddo Bentov
- Ranjit Kumaresan
- Brent Waters
- Amit Sahai
- Dan Boneh
- Jonathan Katz
- Ran Canetti
- David E. Evans
In Computational Theory and Mathematics
- Brent Waters
- Amit Sahai
- Ran Canetti
- Jonathan Katz
- Yael Tauman Kalai
- Iddo Bentov
- Dan Boneh
- David E. Evans
Citations in the corpus
- Theory of Cryptography (2014, background): “As has been clarified in several previous works [19,27,37,21], there is a strong connection between MBPF obfuscators and SKE schemes.”
- Game theory meets network security and privacy (2013, methodology): “2009] Incomp. information static game Pseudonym change protocol 6.2 Economics of Privacy [Acquisti et al. 2003] Repeated game Identify anonymity parameters 6.3 Trust vs. Privacy [Raya et al. 2010] Dynamic incomplete information game Incentive to build trust 6.4 Tor Path Selection [Zhang et al. 201”
- Efficient Secure Computation with Garbled Circuits (2011, background): “Protocols that remain fair in the presence of adversaries with the above utilities were first considered in the context of rational secret sharing [20, 24, 40].”
- How to Use Bitcoin to Design Fair Protocols (2014, background): “More directly related to secure computation are the works of [75, 57, 58, 55, 60, 88, 71].”
- Secure Multiparty Computations on Bitcoin (2014, methodology): “V for more details) that do not require the deposits, providing a more formal framework to analyze the deposit-based technique (this can probably be done using the tools from the “rational cryptography” literature [31], [1], [28]).”