Dennis Hofheinz, Jörn Müller-Quade, Dominique Unruh  Home/Search
Context
Related
| iacr.org/2006/177.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We consider the cryptographic two-party protocol task of extending a given coin toss. The goal is to generate n common random coins from a single use of an ideal functionality which gives m common random coins to the parties. In the framework of Universal Composability we show the impossibility of securely extending a coin toss for statistical and perfect security. On the other hand, for computational security the existence of a protocol for coin toss extension depends on the number m of... (Update)
Active bibliography (related documents): More All
0.6: On the Necessity of Rewinding in Secure Multiparty.. - Backes, Müller-Quade, Unruh (2006) (Correct)
0.6: On Fairness in Simulatability-based Cryptographic Systems - Backes, Hofheinz.. (2005) (Correct)
0.6: Relations among Statistical Security Notions or Why Exponential.. - Unruh (2005) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ hofheinz-impossibility,
author = "Dennis Hofheinz and Jörn Müller-Quade and Dominique Unruh",
title = "On the (Im-)Possibility of Extending Coin Toss",
url = "citeseer.ist.psu.edu/hofheinz06impossibility.html" }
Citations (may not include all citations):404 Journal of Computer and System Sciences (context) - Goldwasser, Micali - 1984
358 Universal classes of hash functions (context) - Carter, Wegman - 1979
326 Non-malleable cryptography - Dolev, Dwork et al. - 1991
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2000
189 Universally composable security: A new paradigm for cryptogr.. - Canetti - 2001
167 Pseudo-random generation from oneway functions (context) - Impagliazzo, Levin et al. - 1989
149 A hard-core predicate for all one-way functions (context) - Goldreich, Levin - 1989
74 A model for asynchronous reactive systems and its applicatio.. - tzmann, Waidner - 2000
56 Universally composable commitments - Canetti, Fischlin - 2001
53 One-way functions are necessary and su cient for secure sign.. (context) - Rompel - 1990
43 Universally composable two-party and multi-party secure comp.. - Canetti, Lindell et al. - 2002
11 Secure asynchronous reactive systems - Backes, tzmann et al. - 2004
4 Previou version online available httpwww (context) - Goldreich, Cryptography et al. - 2001
4 Previou version online available httpwww (context) - Goldreich, Cryptography et al. - 2004
4 Distributed pseudo-random bit generators a new way to spee.. - Bellare, Garay et al. - 1996
2 On fairness in simulatability-based cryptographic systems - Backes, Hofheinz et al. - 2005
1 Relations among statistical security notions or why exponent.. - Unruh - 2005
1 Multiparty quantum coin ipping (context) - Ambainis, Buhrman et al. - 2004
1 ipping by telephone (context) - Blum - 1981
1 Universal hash families and the leftover hash lemma (context) - Stinson - 2002
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC