A randomized protocol for signing contracts
Communications of the ACM
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
Controlled gradual disclosure schemes for random bits and their applications
CRYPTO '89 Proceedings on Advances in cryptology
Reasoning about knowledge
ACM Transactions on Computer Systems (TOCS)
Communications of the ACM
Distributed algorithmic mechanism design: recent results and future directions
DIALM '02 Proceedings of the 6th international workshop on Discrete algorithms and methods for mobile computing and communications
Towards a general theory of non-cooperative computation
Proceedings of the 9th conference on Theoretical aspects of rationality and knowledge
Foundations of Cryptography: Volume 2, Basic Applications
Foundations of Cryptography: Volume 2, Basic Applications
Non-cooperative computation: boolean functions with correctness and exclusivity
Theoretical Computer Science - Game theory meets theoretical computer science
Sequential information elicitation in multi-agent systems
UAI '04 Proceedings of the 20th conference on Uncertainty in artificial intelligence
Rational Secure Computation and Ideal Mechanism Design
FOCS '05 Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Towards Automated Design of Multi-party Rational Exchange Security Protocols
WI-IATW '07 Proceedings of the 2007 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Workshops
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
SDM '08 Proceedings of the 5th VLDB workshop on Secure Data Management
Cloaking games in location based services
Proceedings of the 2008 ACM workshop on Secure web services
TCC '09 Proceedings of the 6th Theory of Cryptography Conference on Theory of Cryptography
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
K-SNCC: group deviations in subsidized non-cooperative computing
Proceedings of the 12th Conference on Theoretical Aspects of Rationality and Knowledge
Sequential-simultaneous information elicitation in multi-agent systems
IJCAI'05 Proceedings of the 19th international joint conference on Artificial intelligence
On non-cooperative location privacy: a game-theoretic analysis
Proceedings of the 16th ACM conference on Computer and communications security
Approximate strong equilibrium in job scheduling games
Journal of Artificial Intelligence Research
On the tradeoff between trust and privacy in wireless ad hoc networks
Proceedings of the third ACM conference on Wireless network security
K-NCC: stability against group deviations in non-cooperative computation
WINE'07 Proceedings of the 3rd international conference on Internet and network economics
Rational secret sharing with repeated games
ISPEC'08 Proceedings of the 4th international conference on Information security practice and experience
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
Brief announcement: collusion free protocol for rational secret sharing
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
It's on me! the benefit of altruism in BAR environment
DISC'10 Proceedings of the 24th international conference on Distributed computing
RatFish: a file sharing protocol provably secure against rational users
ESORICS'10 Proceedings of the 15th European conference on Research in computer security
Tracking games in mobile networks
GameSec'10 Proceedings of the First international conference on Decision and game theory for security
REBIVE: a reliable private data aggregation scheme for wireless sensor networks
Proceedings of the 2011 ACM Symposium on Applied Computing
PDA: Privacy-Preserving Data Aggregation for Information Collection
ACM Transactions on Sensor Networks (TOSN)
Scalable rational secret sharing
Proceedings of the 30th annual ACM SIGACT-SIGOPS symposium on Principles of distributed computing
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
Preserving privacy in wireless sensor networks using reliable data aggregation
ACM SIGAPP Applied Computing Review
Unconditionally secure rational secret sharing in standard communication networks
ICISC'10 Proceedings of the 13th international conference on Information security and cryptology
Rational distance-bounding protocols over noisy channel
Proceedings of the 4th international conference on Security of information and networks
Ideal secret sharing schemes with share selectability
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Efficient rational secret sharing in standard communication networks
TCC'10 Proceedings of the 7th international conference on Theory of Cryptography
Repeated rational secret sharing, revisited
International Journal of Grid and Utility Computing
Rational secret sharing with semi-rational players
International Journal of Grid and Utility Computing
On correctness and privacy in distributed mechanisms
AMEC'05 Proceedings of the 2005 international conference on Agent-Mediated Electronic Commerce: designing Trading Agents and Mechanisms
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
Efficient secure computation with garbled circuits
ICISS'11 Proceedings of the 7th international conference on Information Systems Security
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Fair computation with rational players
EUROCRYPT'12 Proceedings of the 31st Annual international conference on Theory and Applications of Cryptographic Techniques
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
A game-theoretic perspective on oblivious transfer
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Byzantine agreement with a rational adversary
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
Hourglass schemes: how to prove that cloud files are encrypted
Proceedings of the 2012 ACM conference on Computer and communications security
Sequential rationality in cryptographic protocols
ACM Transactions on Economics and Computation - Inaugural Issue
On the (non-)equivalence of UC security notions
ProvSec'12 Proceedings of the 6th international conference on Provable Security
Public-Key encryption with lazy parties
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Application and analysis of multidimensional negative surveys in participatory sensing applications
Pervasive and Mobile Computing
Game theory meets network security and privacy
ACM Computing Surveys (CSUR)
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 |
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.