A randomized protocol for signing contracts
Communications of the ACM
Limits on the security of coin flips when half the processors are faulty
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Completeness theorems for non-cryptographic fault-tolerant distributed computation
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Multiparty unconditionally secure protocols
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Verifiable secret sharing and multiparty protocols with honest majority
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
SIAM Journal on Computing
Fair distribution protocols or how the players replace fortune
Mathematics of Operations Research
Adaptively secure multi-party computation
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Everything Provable is Provable in Zero-Knowledge
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority
CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Universally Composable Security: A New Paradigm for Cryptographic Protocols
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Beyond nash equilibrium: solution concepts for the 21st century
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Collusion-Free Protocols in the Mediated Model
CRYPTO 2008 Proceedings of the 28th Annual conference on Cryptology: Advances in Cryptology
Fairness with an Honest Minority and a Rational Majority
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Purely Rational Secret Sharing (Extended Abstract)
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
Fair Threshold Decryption with Semi-Trusted Third Parties
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
Bridging game theory and cryptography: recent results and future directions
TCC'08 Proceedings of the 5th conference on Theory of cryptography
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Lower bounds on implementing robust and resilient mediators
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Cryptography and game theory: designing protocols for exchanging information
TCC'08 Proceedings of the 5th conference on Theory of cryptography
Proceedings of the Behavioral and Quantitative Game Theory: Conference on Future Directions
Fair threshold decryption with semi-trusted third parties
International Journal of Applied Cryptography
Scalable rational secret sharing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Unconditionally secure rational secret sharing in standard communication networks
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
On complete primitives for fairness
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Efficient rational secret sharing in standard communication networks
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Rational secret sharing with semi-rational players
International Journal of Grid and Utility Computing
Partial fairness in secure two-party computation
EUROCRYPT'10 Proceedings of the 29th Annual international conference on Theory and Applications of Cryptographic Techniques
Efficient correlated action selection
FC'06 Proceedings of the 10th international conference on Financial Cryptography and Data Security
Rational secret sharing, revisited
SCN'06 Proceedings of the 5th international conference on Security and Cryptography for Networks
Rationality and adversarial behavior in multi-party computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
On combining privacy with guaranteed output delivery in secure multiparty computation
CRYPTO'06 Proceedings of the 26th annual international conference on Advances in Cryptology
Resource fairness and composability of cryptographic protocols
TCC'06 Proceedings of the Third conference on Theory of Cryptography
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Fairness in the presence of semi-rational parties in rational two-party secure computation
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
Secure function evaluation (SFE) enables a group of players, by themselves, to evaluate a function on private inputs as securely as if a trusted third party had done it for them. A completely fair SFE is a protocol in which, conceptually, the function values are learned atomically.We provide a completely fair SFE protocol which is secure for any number of malicious players, using a novel combination of computational and physical channel assumptions.We also show how completely fair SFE has striking applications togame theory. In particular, it enables "cheap-talk" protocol that(a) achieve correlated-equilibrium payoffs in any game, (b) are the first protocols which provably give no additional power to any coalition of players, and (c) are exponentially more efficient than prior counterparts.