Efficient two-party secure computation on committed inputs

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

Volumn 4515 LNCS, Issue , 2007, Pages 97-114

  Jarecki, Stanisław ^a   Shmatikov, Vitaly ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

BANDWIDTH; COMPUTATIONAL EFFICIENCY; CRYPTOGRAPHY; INTRUSION DETECTION; NETWORK PROTOCOLS; SEMANTICS;

COMMON REFERENCE STRING MODELS; DECISIONAL COMPOSITE RESIDUOSITY (DCR); TWO PARTY SECURE COMPUTATION;

NETWORK SECURITY;

EID: 38049136533     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72540-4_6     Document Type: Conference Paper

References (30)

1. W. Aiello, Y. Ishai, and O. Reingold. Priced oblivious transfer: How to sell digital goods. In Proc. EUROCRYPT, pages 119-135, 2001.
2. F. Boudot. Efficient proofs that a committed number lies in an interval. In Proc. EUROCRYPT, pages 431-444, 2000.
3. J. Camenisch and C. Cachin. Optimistic fair secure computation. In Proc. CRYPTO, pages 93-111, 2000.
4. R. Cramer and I. Damgård. Linear zero-knowledge - a note on efficient zero-knowledge proofs and arguments. In Proc. STOC, pages 436-445, 1997.
5. R. Cramer, I. Damgård, and B. Schoenmakers. Proofs of partial knowledge and simplified design of witness hiding protocols. In Proc. CRYPTO, pages 174-187, 1994.
6. D. Catalano, R. Gennaro, and N. Howgrave-Graham. The bit security of Paillier's encryption scheme and its applications. In Proc. EUROCRYPT, pages 229-243, 2001.
7. D. Catalano, R. Gennaro, N. Howgrave-Graham, and P. Nguyen. Paillier's cryptosystem revisited. In Proc. CCS, pages 206-214, 2001.
8. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is a product of two safe primes. In Proc. EUROCRYPT, pages 107-122, 1999.
9. C. Crépeau. Verifiable disclosure of secrets and applications. In Proc. EUROCRYPT, pages 181-191, 1989.
10. J. Camenisch and V. Shoup. Practical verifiable encryption and decryption of discrete logarithms. In Proc. CRYPTO, pages 126-144, 2003.
11. C. Crépeau, J. van de Graaf, and A. Tapp. Committed oblivious transfer and private multiparty computation. In Proc. CRYPTO, pages 110-123, 1995.
12. I. Damgård. Efficient concurrent zero-knowledge in the auxiliary string model. In Proc. EUROCRYPT, pages 418-430, 2002.
13. I. Damgård and E. Fujisaki. A statistically hiding integer commitment scheme based on groups with hidden order. In Proc. ASIACRYPT, pages 125-142, 2002.
14. I. Damgård and Y. Ishai. Constant-round multiparty computation using a black-box pseudorandom generator. In Proc. CRYPTO, pages 378-394, 2005.
15. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Proc. CRYPTO, pages 16-30, 1997.
16. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proc. STOC, pages 218-229. ACM, 1987.
17. J. Garay, P. MacKenzie, and K. Yang. Efficient and universally composable oblivious transfer and applications. In Proc. TCC, pages 297-316, 2004.
18. J. Håstad, A. Schrift, and A. Shamir. The discrete logarithm modulo a composite hides o(n) bits. J. Comput. Syst. Sci., 47:850-864, 1993.
19. M. Jakobsson and A. Juels. Mix and match: Secure function evaluation via ciphertexts. In Proc. ASIACRYPT, pages 162-177, 2000.
20. J. Kilian. Founding cryptography on oblivious transfer. In Proc. STOC, pages 20-31, 1988.
21. J. Katz and R. Ostrovsky. Rount-optimal secure two-party computation. In Proc. CRYPTO, pages 335-354, 2004.
22. Y. Lindell. Parallel coin-tossing and constant-round secure two-party computation. J. Cryptology, 16(3):143-184, 2003.
23. H. Lipmaa. Verifiable homomorphic oblivious transfer and private equality test. In Proc. ASIACRYPT, pages 416-433, 2003.
24. Y. Lindell and B. Pinkas. An efficient protocol for secure two-party computation in the presence of malicious adversaries. In Proc. EUROCRYPT, 2007.
25. P. Mohassel and M. Franklin. Efficiency tradeoffs for malicious two-party computation. In Proc. PKC, pages 458-473, 2006.
26. P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proc. EUROCRYPT, pages 223-238, 1999.
27. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Proc. CRYPTO, pages 129-140, 1991.
28. B. Pinkas. Fair secure two-party computation. In Proc. EUROCRYPT, pages 87-105, 2003.
29. D. Woodruff. Revisiting the efficiency of malicious two-party computation. In Proc EUROCRYPT, 2007.
30. A. Yao. How to generate and exchange secrets. In Proc. FOCS, pages 162-167, 1986.