Bounded-width polynomial-size branching programs recognize exactly those languages in NC1
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
Parallel Reducibility for Information-Theoretically Secure Computation
CRYPTO '00 Proceedings of the 20th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '02 Proceedings of the 22nd 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
Rational secret sharing and multiparty computation: extended abstract
STOC '04 Proceedings of the thirty-sixth annual ACM symposium on Theory of computing
(Im)Possibility of Unconditionally Privacy-Preserving Auctions
AAMAS '04 Proceedings of the Third International Joint Conference on Autonomous Agents and Multiagent Systems - Volume 2
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Protocols for secure computations
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
MDPOP: faithful distributed implementation of efficient social choice problems
AAMAS '06 Proceedings of the fifth international joint conference on Autonomous agents and multiagent systems
Games for exchanging information
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Protocol completion incentive problems in cryptographic Vickrey auctions
Electronic Commerce Research
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
M-DPOP: faithful distributed implementation of efficient social choice problems
Journal of Artificial Intelligence Research
On non-cooperative location privacy: a game-theoretic analysis
Proceedings of the 16th ACM conference on Computer and communications security
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
Distributed double spending prevention
Proceedings of the 15th international conference on Security protocols
Scalable rational secret sharing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Towards a game theoretic view of secure computation
EUROCRYPT'11 Proceedings of the 30th Annual international conference on Theory and applications of cryptographic techniques: advances in cryptology
An efficient rational secret sharing scheme based on the Chinese remainder theorem
ACISP'11 Proceedings of the 16th Australasian conference on Information security and privacy
Privacy-preserving data mining: a game-theoretic approach
DBSec'11 Proceedings of the 25th annual IFIP WG 11.3 conference on Data and applications security and privacy
Unconditionally secure rational secret sharing in standard communication networks
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
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
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
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
Byzantine agreement with a rational adversary
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
Universally composable security with local adversaries
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Truthful mechanisms for agents that value privacy
Proceedings of the fourteenth ACM conference on Electronic commerce
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 Computation essentially guarantees that whatever computation n players can do with the help of a trusted party, they can also do by themselves. Fundamentally, however, this notion depends on the honesty of at least some players. We put forward and implement a stronger notion, Rational Secure Computation, that does not depend on player honesty, but solely on player rationality. The key to our implementation is showing that the ballotbox -the venerable device used throughout the world to tally secret votes securely can actually be used to securely compute any function. Our work bridges the fields of Game Theory and Cryptography, and has broad implications for Mechanism Design.