Two-party computing with encrypted data

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

Volumn 4833 LNCS, Issue , 2007, Pages 298-314

  Choi, Seung Geol ^a   Elbaz, Ariel ^a   Juels, Ari ^b   Malkin, Tal ^a   Yung, Moti ^a,c  

^a Och Spine at New York Presbyterian Hospitals

^b RSA Laboratories

^c GOOGLE INC   (United States)

Author keywords

Computing with encrypted data; CryptoComputing; Oblivious transfer; Secure two party computation

Indexed keywords

COMPUTATION THEORY; COMPUTATIONAL METHODS; MESSAGE PASSING; ONLINE SYSTEMS; SECURITY OF DATA;

COMMON INPUT CIRCUIT; ENCRYPTED DATA; ONLINE MESSAGE;

PUBLIC KEY CRYPTOGRAPHY;

EID: 38149073262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-76900-2_18     Document Type: Conference Paper

References (32)

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. Beaver, D.: Minimal-latency secure function evaluation. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 335-350. Springer, Heidelberg (2000)
3. Boneh, D., Lipton, R.: Algorithms for black-box fields and their application to cryptography. In: Koblitz, N. (ed.) CRYPTO 1996. LNCS, vol. 1109, pp. 283-297. Springer, Heidelberg (1996)
4. Cachin, C., Camensich, J., Kilian, J., Müller, A.J.: One-round secure computation and secure autonomous mobile agents. In: Proc. 27th International Colloquium on Automata, Languages and Programming (ICALP) (2000)
5. Camenisch, J., Michels, M.: Proving that a number is the product of two safe primes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107-122. Springer, Heidelberg (1999)
6. Camenisch, J., Shoup, V.: Practical verifiable encryption and decryption of discrete logarithms. In: Boneh, D. (ed.) CRYPTO 2003. LNCS, vol. 2729, pp. 126-144. Springer, Heidelberg (2003)
7. Camenisch, J., Stadler, M.: Efficient group signature schemes for large groups. In: Sommer, G., Daniilidis, K., Pauli, J. (eds.) CAIP 1997. LNCS, vol. 1296, pp. 410-424. Springer, Heidelberg (1997)
8. Cramer, R., Genaro, R., Schoenmakers, B.: A secure and optimally efficient multi-authority election scheme. In: Fumy, W. (ed.) EUROCRYPT 1997. LNCS, vol. 1233, pp. 103-118. Springer, Heidelberg (1997)
9. Cramer, R., Damgård, I., Schoenmakers, B.: Proofs of partial knowledge and simplified design of witness hiding protocols. In: Desmedt, Y.G. (ed.) CRYPTO 1994. LNCS, vol. 839, pp. 174-187. Springer, Heidelberg (1994)
10. Diffie, W., Hellman, M.E.: New directions in cryptography. IEEE Trans. on Information Theory, IT 22(6), 644-654 (1976)
11. ElGamal, T.: A public key cryptosystem and a signature scheme based on discrete logarithms. IEEE Transactions on Information Theory 31, 469-472 (1985)
12. Even, S., Goldreich, O., Micali, S.: On-line/off-line digital schemes. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 263-275. Springer, Heidelberg (1990)
13. Feigenbaum, J., Merritt, M.: Open questions, talk abstracts, and summary of discussions. In: DIMACS. Series in Discrete Mathematics and Theoretical Computer Science, pp. 1-45 (1991)
14. Fiat, A., Shamir, A.: How to prove yourself: Practical solutions to identification and signature problems. In: Massey, J.L. (ed.) CRYPTO 1986. LNCS, vol. 263, pp. 186-194. Springer, Heidelberg (1987)
15. Furukawa, J., Sako, K.: An efficient scheme for proving a shuffle. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 368-387. Springer, Heidelberg (2001)
16. Gertner, Y., Ishai, Y., Kushilevitz, E., Malkin, T.: Protecting data privacy in private information retrieval schemes. In: Proceedings of the thirtieth annual ACM symposium on Theory of computing, pp. 151-160 (1998)
17. Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game. In: Proc. 19th Annual ACM Symposium on Theory of Computing (STOC), pp. 218-229. ACM Press, New York (1987)
18. Goldwasser, S., Micali, S.: Probabilistic encryption. Journal of Computer and System Sciences 28(2), 270-299 (1984)
19. Horvitz, O., Katz, J.: Universally-composable two-party computation in two rounds. In: Advances in Cryptology -(CRYPTO 2007), pp. 111-129 (2007)
20. Jarecki, S., Shmatikov, V.: Efficient two-party secure computation on committed inputs. In: Advances in Cryptology -(EUROCRYPT 2007) (2007)
21. Lindell, Y., Pinkas, B.: An efficient protocol for secure two-party computation in the presence of malicious adversaries. In: Advances in Cryptology -(EUROCRYPT 2007) (2007)
22. Naor, M., Pinkas, B., Sumner, R.: Privacy preserving auctions and mechanism design. In: 1st ACM Conference on Electronic Commerce, ACM Press, New York (1999)
23. Paillier, P.: Public-key cryptosystems based on composite degree residuosity classes. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 107-122. Springer, Heidelberg (1999)
24. Rivest, R., Adelman, L., Dertouzos, M.L.: On data banks and privacy homomorphisms. In: DeMillo, R.A, Dobkin, D.P., Jones, A.K., Lipto, R.J. (eds.) Foundations of Secure Computation, pp. 169-17. Academic Press, London (1978)
25. Sahai, A.: Non-malleable non-interactive zero knowledge and adaptive chosen-ciphertext security. In: Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 543-553 (1999)
26. Sander, T., Tschudin, C.F.: Protecting mobile agents against malicious hosts. In: Vigna, G. (ed.) Mobile Agents and Security. LNCS, vol. 1419, pp. 44-61. Springer, Heidelberg (1998)
27. 1. In: Proc. 40th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 554-567 (1999)
28. De Santis, A., Persiano, G.: Zero-knowledge proofs of knowledge without interaction. In: Proc. 33rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 427-437 (1992)
29. De Santis, A., Di Crescenzo, G., Persiano, G., Yung, M.: On monotone formula closure of SZK. In: Proc. 35th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 454-465. IEEE Computer Society Press, Los Alamitos (1994)
30. Schnorr, C.P.: Efficient signature generation by smart cards. Journal of Cryptology 4, 161-174 (1991)
31. Valiant, L.: Universal circuits. In: Proc. 8th Annual ACM Symposium on Theory of Computing (STOC), pp. 196-203 (1976)
32. Yao, A.C.: How to generate an exchange secrets. In: Proc. 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162-167 (1986)