On the Black-Box Complexity of Optimally-Fair Coin Tossing - researchr publication authors

researchr

You are not signed in
Sign in
Sign up

Dana Dachman-Soled, Yehuda Lindell, Mohammad Mahmoody, Tal Malkin. On the Black-Box Complexity of Optimally-Fair Coin Tossing. In Yuval Ishai, editor, Theory of Cryptography - 8th Theory of Cryptography Conference, TCC 2011, Providence, RI, USA, March 28-30, 2011. Proceedings. Volume 6597 of Lecture Notes in Computer Science, pages 450-467, Springer, 2011. [doi]

This author has not been identified. Look up 'Dana Dachman-Soled' in GoogleThis author has not been identified. Look up 'Yehuda Lindell' in GoogleThis author has not been identified. Look up 'Mohammad Mahmoody' in GoogleThis author has not been identified. Look up 'Tal Malkin' in Google

runs on WebDSL