Efficient polynomial operations in the shared-coefficients setting

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

Volumn 3958 LNCS, Issue , 2006, Pages 44-57

  Mohassel, Payman ^a   Franklin, Matthew ^a  

^a University of California   (United States)

Author keywords

Passive adversary; Polynomial operations; Privacy preserving set operations; Secure multi party computation; Threshold homomorphic encryption

Indexed keywords

CRYPTOGRAPHY; INFORMATION THEORY; INTERPOLATION; NETWORK PROTOCOLS; POLYNOMIALS;

PASSIVE ADVERSARY; POLYNOMIAL OPERATIONS; PRIVACY-PRESERVING SET OPERATIONS; SECURE MULTI-PARTY COMPUTATION; THRESHOLD HOMOMORPHIC ENCRYPTION;

COMPUTATION THEORY;

EID: 33745868262     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11745853_4     Document Type: Conference Paper

References (21)

1. [BB89] J. Bar-Ilan and D. Beaver. Non-cryptographic fault-tolerant computing in constant number of rounds of interaction. In Proceedings of ACM PODC, pp. 201-209, 1989.
2. [BGW88] M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of ACM STOC, pages 1-10, 1988.
3. [BMR90] D. Beaver, S. Micali, P. Rogaway. The Round Complexity of Secure Protocols. In Proceedings of 22nd ACM STOC, pp. 503-513, 1990.
4. [CCD88] D. Chaum, C. Crepeau, and I. Darngard. Multi-party unconditionally secure protocols. In Proceedings of ACM STOC, pages 11-19, 1988.
5. [CD01] R. Cramer and I. Damgard. Secure distributed linear algebra in a constant number of rounds. In Proceedings of Crypto, pages 119-136, August 2001.
6. [CDN01] R. Cramer, I. Damgard, and J. Nielsen. Multiparty computation from homomorphic encryption. In Proceedings of Eurocrypt, pages 280-300, 2001.
7. [DFNT05] I. Damgård, M. Fitzi, J. Buus Nielsen, and T. Toft. How to split a shared secret into shared bits in constant-round. Cryptology ePrint Archive, Report 2005/140, 2005. http://eprint.iacr.org/.
8. [FIPR05] M. Freedman, Y. Ishai, B. Pinkas, and O. Reingold. Keyword search and oblivious pseudorandom functions. In Proceedings of Theory of Cryptography Conference, 2005.
9. [FKN94] U. Feige, J. Kilian, M. Naor. A Minimal Model for Secure Computation. In Proceedings of ACM STOC '94, pp. 554-563, 1994.
10. [FNP04] M. Freedman, K. Nissim, and B. Pinkas. Efficient private matching and set intersection. In Proceedings of Eurocrypt, 2004.
11. [FP00] P. Fouque and D. Pointcheval. Threshold cryptosystems secure against, chosen-ciphertext attacks. In Proceedings of Asiacrypt, pages 573-84, 2000.
12. [GG03] J. Von Zur Gathen and J. Gerhard. Modern Computer Algebra. University Press, Cambridge, 2nd edition, 2003.
13. [GMW87] O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game or a completeness theorem for protocols with honest majority. Proceedings of the 19th Annual ACM symposium on Theory of Computing, pages 218-229, 1987.
14. [GRR98] R. Gennaro, M. Rabin, and T. Rabin. Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In Proceedings of ACM PODC, pages 101-111, 1998.
15. [IK97] Y. Ishai and E. Kushilevitz. Private Simultaneous Messages Protocols with Applications. In Proceedings of 5th Israel Symposium on Theoretical Comp. Sc., pp. 174-183, 1997.
16. [IK00] Y. Ishai and E. Kushilevitz. Randomizing polynomials: A New Paradigm for Round-efficient Secure Computation. In Proceedings of FOCS, 2000.
17. [KS05] Lea Kissner and Dawn Song. Privacy preserving set operations. In Proceedings of CRYPTO '05, August 2005.
18. [Pai00] P. Paillier. Public-key cryptosystems based on composite degree residuosity classes. In Proceedings of Asiacrypt, pages 573-84, 2000.
19. [Sha79] A. Shamir. How to share a secret. In CACM, pages 612-613, 1979.
20. [Yao82] A. C. Yao. Protocols for secure computation. In Proceedings of Focs, pp. 160-164, 1982.
21. [Yao86] A. C. Yao. How to generate and exchange secrets. In Proceedings of 27th FOCS, pages 162-167, 1986.