Paper 2013/442
On Fair Exchange, Fair Coins and Fair Sampling
Shashank Agrawal and Manoj Prabhakaran
Abstract
We study various classical secure computation problems in the context of fairness, and relate them with each other. We also systematically study fair sampling problems (i.e., inputless functionalities) and discover three levels of complexity for them.
Our results include the following:
-Fair exchange cannot be securely reduced to the problem of fair coin-tossing by an r-round protocol, except with an error that is
Metadata
- Available format(s)
- Category
- Foundations
- Publication info
- Published elsewhere. This is the full version of the paper in CRYPTO 2013.
- Keywords
- fairnesssecure computationimpossibilitycommon informationcheeger constant
- Contact author(s)
- sagrawl2 @ illinois edu
- History
- 2013-07-21: revised
- 2013-07-18: received
- See all versions
- Short URL
- https://ia.cr/2013/442
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2013/442, author = {Shashank Agrawal and Manoj Prabhakaran}, title = {On Fair Exchange, Fair Coins and Fair Sampling}, howpublished = {Cryptology {ePrint} Archive, Paper 2013/442}, year = {2013}, url = {https://eprint.iacr.org/2013/442} }