Search
Now showing items 31-40 of 43
Secure Computation (Preliminary Report)
(1991-08)
We define what it means for a network of communicating players to securely compute a function of privately held inputs. Intuitively, we wish to correctly compute its value in a computer manner which protects the privacy ...
Conservative Rationalizability and The Second-Knowledge Mechanism
(2010-12-20)
In mechanism design, the traditional way of modeling the players' incomplete information about their opponents is "assuming a Bayesian." This assumption, however, is very strong and does not hold in many real applications. ...
Mechanism Design With Approximate Player Types
(2011-02-16)
We investigate mechanism design when the players do not exactly know their types, but have instead only partial information about them.
Mechanism Design with Approximate Valuations
(2011-02-16)
In mechanism design, we replace the strong assumption that each player knows his own payoff type EXACTLY with the more realistic assumption that he knows it only APPROXIMATELY. Specifically, we study the classical problem ...
Verifiably Secure Devices
(2007-12-05)
We put forward the notion of a verifiably secure device, in essence a stronger notion of secure computation, and achieve it in the ballot-box model. Verifiably secure devices1. Provide a perfect solution to the problem of ...
Three Round Zero-Knowledge Using a Proof of Knowledge Assumption
(2001-04)
We provide a proof of knowledge assumption that allows us to construct a three round zero-knowledge proof system for any language in NP.
Signing with Partially Adversarial Hashing
(1998-02)
Digital signatures usually utilize one-way hash functions designed by other parties. It is thus possible that such hash functions are adverserially designed so as to enable forging signatures in otherwise secure schemes. ...
Conservative-Bayesian Mechanism Design
(2010-12-20)
Classical Bayesian mechanism design is "centralized," that is, the designer is assumed to know the distribution D from which the players' type profile has been drawn. We instead investigate a very "decentralized" Bayesian ...
A Useful Homomorphic Encryption Method
(2009-06-15)
Possibilistic Beliefs and Higher-Level Rationality
(2014-06-09)
We consider rationality and rationalizability for normal-form games of incomplete information in which the players have possibilistic beliefs about their opponents. In this setting, we prove that the strategies compatible ...