Abstract
In a recent paper Mohassel and Franklin study the efficiency of secure two-party computation in the presence of malicious behavior. Their aim is to make classical solutions to this problem, such as zero-knowledge compilation, more efficient. The authors provide several schemes which are the most efficient to date. We propose a modification to their main scheme using expanders. Our modification asymptotically improves at least one measure of efficiency of all known schemes. We also point out an error, and improve the analysis of one of their schemes.
Chapter PDF
Similar content being viewed by others
References
Alon, N.: Eigenvalues and expanders. Combinatorica 6, 86–96 (1986)
Alon, N., Bruck, J., Naor, J., Naor, M., Roth, R.: Construction of asymptotically good, low-rate error-correcting codes through pseudo-random graphs. IEEE Transactions on Information Theory 38, 509–516 (1992)
Alon, N., Milman, V.D.: Eigenvalues, expanders, and superconcentrators. In: FOCS (1984)
Alon, N., Spencer, J.: The Probabilistic Method (2000)
Beaver, D.: Correlated pseudorandomness and the complexity of private computations. In: STOC (1996)
Capalbo, M., Reingold, O., Vadhan, S., Wigderson, A.: Randomness conductors and constant-degree lossless expanders. In: STOC (2002)
Chung, F.: Spectral Graph Theory. CBMS Lecture Notes. AMS Publications, New York (1997)
Chung, F., Lu, L.: Concentration inequalities and martingale inequalities - a survey. Internet Mathematics (to appear)
Diestel, R.: Graph Theory. Springer, Heidelberg (2005)
Dinur, I.: The PCP Theorem by Gap Amplification. In: STOC (2006)
Even, S., Goldreich, O., Lempel, A.: A randomized protocol for signing contracts. Communications of the ACM (1985)
Feller, W.: Stirling’s Formula. In: An Introduction to Probability Theory and its Applications vol. 1, 3rd edn., pp. 50–53. Wiley, New York (1968)
Friedman, J.: A Proof of Alon’s Second Eigenvalue Conjecture. In: STOC (2003)
Gabber, O., Galil, Z.: Explicit constructions of linear-sized superconcentrators. JCSS 22(3), 407–420 (1981)
Goldreich, O., Micali, S., Rackoff, C.: Proofs that yield nothing but their validity or all languages in NP have zero-knowledge proofs. In: FOCS (1986)
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: STOC (1987)
Goldreich, O.: Foundations of cryptography - volume 2 (2004)
Ishai, Y., Kilian, J., Nissim, K., Petrank, E.: Extending oblivious transfers efficiently. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 145–161. Springer, Heidelberg (2003)
Kilian, J., Petrank, E.: An efficient noniteractive zero-knowledge proof system for NP with general assumptions. Journal of Cryptology 11, 1–27 (1998)
Kiraz, M., Schoenmakers, B.: A protocol issue for the malicious case of Yao’s garbled circuit construction. In: The 27th Symposium on information theory in the BENELUX, WIC (2006)
Lindell, Y., Pinkas, B.: A proof of Yao’s protocol for secure two-party computation. Cryptology ePrint Archive, Report 2004/175 (2004)
Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. Eurocrypt 2007, to appear in these proceedings(2007)
Lubotzky, A., Phillips, R., Sarnak, P.: Explicit expanders and the Ramanujan conjectures. In: STOC (1986), See also: Lubotzky, A., Phillips, R., Sarnak, P.: Ramanujan graphs. Combinatorica 8, 261–277 (1988)
Malkhi, D., Nisan, N., Pinkas, B., Sella, Y.: Fairplay - a secure two-party computation system. In: Usenix (2004)
Margulis, G.A.: Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and superconcentrators. Problemy Peredachi Informatsii 24, 51–60 (1988), English translation in Problems of Information Transmission 24, 39–46 (1988)
Mohassel, P., Franklin, M.K.: Efficiency tradeoffs for malicious two-party computation. In: Yung, M., Dodis, Y., Kiayias, A., Malkin, T.G. (eds.) PKC 2006. LNCS, vol. 3958, pp. 458–473. Springer, Heidelberg (2006)
Naor, M., Pinkas, B.: Efficient oblivious transfer. In: SODA (2001)
Pinkas, B.: Fair secure two-party computation. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, Springer, Heidelberg (2003)
Rabin, M.: How to exchange secrets by oblivious transfer. Technical Report Tech., Memo. TR-81, Aiken Computation Laboratory, Harvard University (1981)
Robbins, H.: A remark of Stirling’s Formula. Amer. Math. Monthly 62, 26–29 (1955)
Tanner, R.M.: Explicit Construction of Concentrators from Generalized N-Gons. SIAM J. Alg. Discr. Math. 5, 287–293 (1984)
Trevisan, L.: Inapproximability of Combinatorial Optimization Problems. Optimisation Combinatiore 2 (2005)
Woodruff, D.: Revisiting the efficiency of malicious two-party computation. Cryptology ePrint Archive, Report 2006/397 (2006)
Yao, A.C.: How to generate and exchange secrets. In: FOCS (1986)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woodruff, D.P. (2007). Revisiting the Efficiency of Malicious Two-Party Computation. In: Naor, M. (eds) Advances in Cryptology - EUROCRYPT 2007. EUROCRYPT 2007. Lecture Notes in Computer Science, vol 4515. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72540-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72540-4_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72539-8
Online ISBN: 978-3-540-72540-4
eBook Packages: Computer ScienceComputer Science (R0)