Universally-composable two-party computation in two rounds

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

Volumn 4622 LNCS, Issue , 2007, Pages 111-129

  Horvitz, Omer ^a   Katz, Jonathan ^a  

^a University of Maryland ^*

Author keywords

[No Author keywords available]

Indexed keywords

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS; MESSAGE PASSING; NETWORK PROTOCOLS; PUBLIC KEY CRYPTOGRAPHY;

BLIND SIGNATURE; CRYPTOGRAPHIC TASKS;

COMPUTATIONAL COMPLEXITY;

EID: 38049159751     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-74143-5_7     Document Type: Conference Paper

References (47)

1. Aiello, W., Ishai, Y., Reingold, O.: Priced Oblivious Transfer: How to Sell Digital Goods. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 119-135. Springer, Heidelberg (2001)
2. Barak, B., Canetti, R., Nielsen, J.B., Pass, R.: Universally Composable Protocols with Relaxed Set-Up Assumptions. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science FOCS, pp. 186-195. IEEE, Los Alamitos (2004)
3. Bradshaw, R., Holt, J., Seamons, K.: Concealing complex policies with hidden credentials. In: Proceedings of the 11th ACM Conference on Computer and Communications Security (CCS), pp. 146-157. ACM Press, New York (2004)
4. Bagga, W., Molva, R., Crosta, S.: Policy-Based Encryption Schemes from Bilinear Pairings. In: Proceedings of the ACM Symposium on Information, Computer and Communications Security (ASIACCS), p. 368 (2006)
5. Beaver, D., Micali, S., Rogaway, P.: The Round Complexity of Secure Protocols. In: Procedings of the 22nd ACM Symposium on Theory of Computing (STOC), pp. 503-513. ACM, New York (1990)
6. Canetti, R.: Universally Composable Security: A New Paradigm for Cryp- tographic Protocols. In: Proceedings of the 42nd IEEE Symposium on foundations of computer Science (FOCS), pp. 136-145. IEEE, Los Alamitos (2001), http://eprint.iacr.org/2000/067
7. Chaum, D.: Blind Signatures for Untraceable Payments. In: McCurley, K.S., Ziegler, C.D. (eds.) Advances in Cryptology 1981 - 1997. LNCS, vol. 1440, pp. 199-203. Springer, Heidelberg (1982)
8. Cachin, C., Camenisch, J., Kilián, J., Müller, J.: One-Round Secure Computation and Secure Autonomous Mobile Agents. In: Welzl, E., Montanari, U., Rolim, J.D.P. (eds.) ICALP 2000. LNCS, vol. 1853, pp. 512-523. Springer, Heidelberg (2000)
9. Canetti, R., Dodis, Y., Pass, R., Walfish, S.: Universally Composable Security with Global Setup. In: Vadhan, S.P. (ed.) TCC 2007. LNCS, vol. 4392, pp. 61-85. Springer, Heidelberg (2007)
10. Canetti, R., Fischlin, M.: Universally Composable Commitments. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 19-40. Springer, Heidelberg (2001)
11. Canetti, R., Kushilevitz, E., Lindell, Y.: On the Limitations of Universally Composable Two-Party Computation Without Set-Up Assumptions. Journal of Cryptology 19(2), 135-167 (2006)
12. Canetti, R., Lindell, Y., Ostrovsky, R., Sahai, A.: Universally Composable Two-Party and Multi-Party Secure Computation. In: Proceedings of the 34th ACM Symposium on Theory of Computing (STOC), pp. 494-503. ACM, New York (2002), http://eprint.iacr.org/2002/140
13. De Santis, A., Di Crescenzo, G., Ostrovsky, R., Persiano, G., Sahai, A.: Robust Non-Interactive Zero-Knowledge. In: Kilián, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 566-598. Springer, Heidelberg (2001)
14. Diffie, W., Hellman, M.: New Directions in Cryptography. IEEE Transactions on Information Theory 22(6), 644-654 (1976)
15. Fischlin, M.: Round-Optimal Composable Blind Signatures in the Common Reference String Model. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 60-77. Springer, Heidelberg (2006)
16. Frikken, K.B., Atallah, M.J., Li, J.: Attribute-Based Access Control with Hidden Policies and Hidden Credentials. IEEE Transactions on Computers 55(10), 1259-1270 (2006)
17. Fitzi, M., Garay, J., Gollakota, S., Rangan, C.P, Srinathan, K.: Round-Optimal and Efficient Verifiable Secret Sharing. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 329-342. Springer, Heidelberg (2006)
18. Fischer, M.J., Lynch, N.A.: A Lower Bound for the Time to Assure Interactive Consistency. Information Processing Letters 14(4), 183-186 (1982)
19. Feldman, P., Micali, S.: An Optimal Probabilistic Protocol for Synchronous Byzantine Agreement. SIAM Journal of Computing 26(4), 873-933 (1997)
20. Goldreich, O.: Foundations of Cryptography: - Basic Tools, vol. 1. Cambridge University Press, Cambridge (2001)
21. Goldreich, O.: Foundations of Cryptography: - Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)
22. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: The Round Complexity of Verifiable Secret Sharing and Secure Multicast. In: Proceedings of the 33rd ACM Symposium on Theory of Computing STOC, pp. 580-589. ACM, New York (2001)
23. Gennaro, R., Ishai, Y., Kushilevitz, E., Rabin, T.: On 2-Round Secure Multiparty Computation. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 178-193. Springer, Heidelberg (2002)
24. Goldreich, O., Kahan, A.: How to Construct Constant-Round ZeroKnowledge Proof Systems for NP. Journal of Cryptology 9(3), 167-190 (1996)
25. Goldreich, O., Krawczyk, H.: On the Composition of Zero-Knowledge Proof Systems. SIAM Journal of Computing 25(1), 169-192 (1996)
26. Garay, J., Moses, Y.: Fully Polynomial Byzantine Agreement for n > 3t Processors in t + 1 Rounds. SIAM Journal of Computing 27(1), 247-290 (1998)
27. Goldwasser, S., Micali, S., Rackoff, C.: The Knowledge Complexity of Interactive Proof Systems. SIAM J. of Computing 18(1), 186-208 (1989)
28. Goldreich, O., Micali, S., Wigderson, A.: How to Play any Mental Game, or A Completeness Theorem for Protocols with Honest Majority. In: Proceedings of the 19th ACM Symposium on Theory Computing (STOC), pp. 218-229. ACM, New York (1987)
29. Horvitz, O.: Expressiveness of Definitions and Efficiency of Constructions in Computational Cryptography. Ph.D. thesis, University of Maryland (2007)
30. Hofheinz, D., Müller-Quade, J., Unruh, D.: Universally Composable Zero-Knowledge Arguments and Commitments from Signature Cards. In: Proceedings of the 5th Central European Conference on Cryptology - MoraviaCrypt (2005)
31. Ishai, Y., Kushilevitz, E.: Randomizing Polynomials: A New Representation with Applications to Round-Efficient Secure Computation. In: Proceedings of the 41st IEEE Symposium on Foundations of Computer Science (FOCS), pp. 294-304. IEEE, Los Alamitos (2000)
32. Juels, A., Luby, M., Ostrovsky, R.: Security of Blind Digital Signatures. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 150-164. Springer, Heidelberg (1997)
33. Jarecki, S., Shmatikov, V.: Efficient Two-Party Secure Computation on Committed Inputs. In: Naor, M. (ed.) EUROCRYPT 2007, vol. 4515, Springer, Heidelberg (2007)
34. Katz, J.: Universally Composable Multi-Party Computation using Tamper-Proof Hardware. In: Naor, M. (ed.) EUROCRYPT 2007, vol. 4515, Springer, Heidelberg (2007)
35. Katz, J., Ostrovsky, R.: Round-Optimal Secure Two-Party Computation. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, Springer, Heidelberg (2004)
36. Katz, J., Ostrovsky, R., Smith, A.: Round Efficiency of Multi-Party Computation with a Dishonest Majority. In: Biham, E. (ed.) EUROCRPYT 2003. LNCS, vol. 2656, Springer, Heidelberg (2003)
37. Lindell, Y.: Parallel Coin-Tossing and Constant-Round Secure Two-Party Computation. Journal of Crypto 16(3), 143-184 (2003)
38. Li, N., Du, W., Boneh, D.: Oblivious Signature-Based Envelope. In: Proceedings of the 22nd ACM Symposium on Principles of Distributed Computing (PODC), pp. 182-189. ACM Press, New York (2003)
39. Li, J., Li., N.: A Construction for General and Efficient Oblivious Commitment Based Envelope Protocols. In: Ning, P., Qing, S., Li, N. (eds.) ICICS 2006. LNCS, vol. 4307, pp. 122-138. Springer, Heidelberg (2006)
40. Lindell, Y., Pinkas, B.: A Proof of Yao's Protocol for Secure Two Party Computation. Journal of Cryptology, Full version available at http : //eprint. iacr. org/, /175 (toappear)
41. Naor, M., Pinkas, B.: Efficient Oblivious Transfer Protocols. In: Proceedings of the 12th Symposium on Discrete Algorithms (SODA), pp. 448-457 (2001)
42. Nasserian, S., Tsudik, G.: Revisiting Oblivious Signature-Based Envelopes Available at, http://eprint.iacr.org/2005/283
43. Pease, M., Shostak, R., Lamport, L.: Reaching Agreement in the Presence of Faults. Journal of the ACM 27(2), 228-234 (1980)
44. Pfitzmann, B., Waidner, M.: Composition and Integrity Preservation of Secure Reactive Systems. In: Proceedings of the 7th ACM Conference on Computer and Communications Security (CCS), pp. 245-254. ACM Press, New York (2000)
45. 1. In: Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 554-567. IEEE, Los Alamitos (1999)
46. Tauman Kalai, Y.: Smooth Projective Hashing and Two-Message Oblivious Transfer. In: Cramer, R.J.F. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 78-95. Springer, Heidelberg (2005)
47. Yao, A.C.-C: How to Generate and Exchange secrets. In: Proceedings of the 27 th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162-167. IEEE, Los Alamitos (1986)