On fair exchange, fair coins and fair sampling

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8042 LNCS, Issue PART 1, 2013, Pages 259-276

  Agrawal, Shashank ^a   Prabhakaran, Manoj ^a  

^a UNIVERSITY OF ILLINOIS AT URBANA CHAMPAIGN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHEEGER INEQUALITIES; COIN-TOSSING; COMPUTATIONAL ASSUMPTIONS; FAIR EXCHANGE; GRAPH-THEORETIC; MAXIMAL CORRELATION; SAMPLING PROBLEMS; SECURE COMPUTATION;

GRAPH THEORY; TOOLS;

CRYPTOGRAPHY;

EID: 84884484159     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-40041-4_15     Document Type: Conference Paper

References (26)

1. Asharov, G., Lindell, Y., Rabin, T.: A full characterization of functions that imply fair coin tossing and ramifications to fairness. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 243-262. Springer, Heidelberg (2013)
2. Beimel, A., Lindell, Y., Omri, E., Orlov, I.: 1/p-secure multiparty computation without honest majority and the best of both worlds. In: Rogaway, P. (ed.) CRYPTO 2011. LNCS, vol. 6841, pp. 277-296. Springer, Heidelberg (2011)
3. Beimel, A., Omri, E., Orlov, I.: Protocols for multiparty coin toss with dishonest majority. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 538-557. Springer, Heidelberg (2010)
4. Canetti, R.: Universally composable security: A new paradigm for cryptographic protocols. Cryptology ePrint Archive, Report 2000/067 (2005) (revised version of [?])
5. Cheeger, J.: A lower bound for the smallest eigenvalue of the laplacian. Problems in analysis 625, 195-199 (1970)
6. Chung, F.R.K.: Spectral Graph Theory (CBMS Regional Conference Series in Mathematics, No. 92). American Mathematical Society (1996)
7. Chung, F.R.K., Tetali, P.: Isoperimetric inequalities for cartesian products of graphs. Combinatorics, Probability & Computing 7(2), 141-148 (1998)
8. Cleve, R.: Limits on the security of coin flips when half the processors are faulty (extended abstract). In: Hartmanis, J. (ed.) STOC, pp. 364-369. ACM (1986)
9. Cleve, R., Impagliazzo, R.: Martingales, collective coin flipping and discrete control processes (1993) (manuscript), http://www.cpsc.ucalgary.ca/ ~cleve/pubs/martingales.ps
10. Even, S., Yacobi, Y.: Relations among public key signature systems. Technical Report 175, Technion, Haifa, Israel (1980)
11. Gács, P., Körner, J.: Common information is far less than mutual information. Problems of Control and Information Theory 2(2), 149-162 (1973)
12. Gebelein, H.: Das statistische problem der korrelation als variations und eigenwertproblem und sein zusammenhang mit der ausgleichungsrechnung. Zeitschrift für angew. Math. und Mech. 21, 364-379 (1941)
13. Gordon, S.D., Katz, J.: Partial fairness in secure two-party computation. Journal of Cryptology 25(1), 14-40 (2012);
14. Preliminary version in Gilbert, H. (ed.) EUROCRYPT 2010. LNCS, vol. 6110, pp. 157-176. Springer, Heidelberg (2010)
15. Gordon, S.D., Hazay, C., Katz, J., Lindell, Y.: Complete fairness in secure two-party computation. J. ACM 58(6), 24:1-24:37 (2011);
16. Preliminary version in STOC 2008
17. Gordon, D., Ishai, Y., Moran, T., Ostrovsky, R., Sahai, A.: On complete primitives for fairness. In: Micciancio, D. (ed.) TCC 2010. LNCS, vol. 5978, pp. 91-108. Springer, Heidelberg (2010)
18. Gray, R.M., Wyner, A.D.: Source coding for a simple network. Bell System Technical Journal 53, 1681-1721 (1974)
19. Ishai, Y., Ostrovsky, R., Seyalioglu, H.: Identifying cheaters without an honest majority. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 21-38. Springer, Heidelberg (2012)
20. Kilian, J.: More general completeness theorems for secure two-party computation. In: Yao, F.F., Luks, E.M. (eds.) STOC, pp. 316-324. ACM (2000)
21. Kumar, G.: Binary renyi correlation: A simpler proof of Witsenhausen's result and a tighter upper bound (2010) (manuscript), http://www.stanford.edu/ ~gowthamr/research/binary-renyi-correlation.pdf
22. Maji, H.K., Ouppaphan, P., Prabhakaran, M., Rosulek, M.: Exploring the limits of common coins using frontier analysis of protocols. In: Ishai, Y. (ed.) TCC 2011. LNCS, vol. 6597, pp. 486-503. Springer, Heidelberg (2011)
23. Moran, T., Naor, M., Segev, G.: An optimally fair coin toss. In: Reingold, O. (ed.) TCC 2009. LNCS, vol. 5444, pp. 1-18. Springer, Heidelberg (2009)
24. Rényi, A.: On measures of dependence. Acta Math. Hung. 10, 441-451 (1959)
25. Witsenhausen, H.S.: On sequences of pairs of dependent random variables. SIAM Journal of Applied Mathematics 28, 100-113 (1975)
26. Wyner, A.D.: The common information of two dependent random variables. IEEE Transactions on Information Theory 21(2), 163-179 (1975)