Rational secret sharing and multiparty computation
- 13 June 2004
- conference paper
- conference paper
- Published by Association for Computing Machinery (ACM) in Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04
- p. 623-632
- https://doi.org/10.1145/1007352.1007447
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Non-cooperative computation: Boolean functions with correctness and exclusivityTheoretical Computer Science, 2005
- Towards a general theory of non-cooperative computationPublished by Association for Computing Machinery (ACM) ,2003
- Distributed algorithmic mechanism designPublished by Association for Computing Machinery (ACM) ,2002
- Practical and provably secure release of a secret and exchange of signaturesJournal of Cryptology, 1995
- Multiparty unconditionally secure protocolsPublished by Association for Computing Machinery (ACM) ,1988
- How to play ANY mental gamePublished by Association for Computing Machinery (ACM) ,1987
- A randomized protocol for signing contractsCommunications of the ACM, 1985
- How to simultaneously exchange a secret bit by flipping a symmetrically-biased coinPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1983
- How to exchange (secret) keysACM Transactions on Computer Systems, 1983
- How to share a secretCommunications of the ACM, 1979