Multiparty computation for interval, equality, and comparison without bit-decomposition protocol

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

Volumn 4450 LNCS, Issue , 2007, Pages 343-360

  Nishide, Takashi ^a,b   Ohta, Kazuo ^a  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b HITACHI LTD   (Japan)

Author keywords

Bitwise sharing; Multiparty computation; Secret sharing

Indexed keywords

BITS; COMPUTATION THEORY; COMPUTER AIDED SOFTWARE ENGINEERING; POLYNOMIALS;

BIT DECOMPOSITION PROTOCOL; BIT ORIENTED OPERATIONS; BITWISE SHARING; MULTIPARTY COMPUTATION; SECRET SHARING;

CRYPTOGRAPHY;

EID: 38049034355     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71677-8_23     Document Type: Conference Paper

References (25)

1. J. Algesheimer, J. Camenisch, and V. Shoup, "Efficient computation modulo a shared secret with application to the generation of shared safe-prime products," CRYPTO'02, LNCS 2442, pp.417-432, Springer Verlag, 2002.
2. J. Bar-Ilan and D. Beaver, "Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction," Proc. ACM Symposium on Principles of Distributed Computing, pp.201-209, 1989.
3. M. Ben-Or, S. Goldwasser, and A. Wigderson, "Completeness theorem for noncryptographic fault-tolerant distributed computation," 20th Annual ACM Symposium on Theory of Computing, pp.1-10, 1988.
4. P. Bogetoft, I. Damgård, T. Jakobsen, K. Nielsen, J. Pagter, and T. Toft, "A practical implementation of secure auctions based on multiparty integer computation," Financial Cryptography 2006, LNCS 4107, pp. 142-147, Springer Verlag, 2006.
5. A.K. Chandra, S. Fortune, and R.J. Lipton, "Lower bounds for constant depth circuits for prefix problems," ICALP, LNCS 154, pp.109-117, Springer Verlag, 1983.
6. A.K. Chandra, S. Fortune, and R.J. Lipton, "Unbounded fan-in circuits and associative functions," Proc. 15th ACM Symposium on Theory of Computing, pp.52-60, 1983.
7. D. Chaum, C. Crêpeau, and I. Damgård, "Multi-party unconditionally secure protocols," Proc. ACM STOC'88, pp.11-19, 1988.
8. R. Cramer and I. Damgård, "Secure distributed linear algebra in a constant number of rounds," CRYPTO'01, LNCS 2139, pp.119-136, Springer Verlag, 2001.
9. R. Cramer, I. Damgård, and Y. Ishai, "Share conversion, pseudorandom secret sharing and applications to secure computation," Proc. 2nd Theory of Cryptography Conference, LNCS 3378, pp.342-362, Springer Verlag, 2005.
10. R. Cramer, I. Damgård, and J.B. Nielsen, "Multiparty computation from threshold homomorphic encryption," EUROCRYPT'01, LNCS 2045, pp.280-300, Springer Verlag, 2001.
11. I. Damgârd, M. Fitzi, E. Kiltz, J.B. Nielsen, and T. Toft, "Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation," Proc. 3rd Theory of Cryptography Conference, LNCS 3876, pp.285-304, Springer Verlag, 2006.
12. I. Damgård and M. Jurik, "A generalisation, a simplification and some applications of Paillier's probabilistic public-key system," PKC 2001, LNCS 1992, pp.119-136, Springer Verlag, 2001.
13. I. Damgård and J.B. Nielsen, "Universally composable efficient multiparty computation from threshold homomorphic encryption," CRYPTO'03, LNCS 2729, pp.247-264, Springer Verlag, 2003.
14. P.-A. Fouque, G. Poupard, and J. Stern, "Sharing decryption in the context of voting or lotteries," Financial Cryptography 2000, LNCS 1962, pp.90-104, Springer Verlag, 2000.
15. S. L. From and T. Jakobsen, "Secure multi-party computation on integers," Master's Thesis, http://www.daimi.au.dk/~mas/thesis/index.html, 2006
16. R. Gennaro, M.O. Rabin, and T. Rabin, "Simplified VSS and fast-track multiparty computations with applications to threshold cryptography," Proc. 17th ACM Symposium on Principles of Distributed Computing, pp.101-110, 1998.
17. O. Goldreich, S. Micali, and A. Wigderson, "How to play any mental game or a complete theorem for protocols with honest majority," Proc. 19th STOC, pp.218-229, 1987.
18. H. Jordan and G. Alaghband "Fundamentals of parallel processing," Prentice Hall, 2003.
19. R. Ladner and M. Fischer, "Parallel prefix computation," Journal of the Association for Computing Machinery vol.27, pp.831-838, 1980.
20. E. Ong and J. Kubiatowicz, "Optimizing robustness while generating shared secret safe primes," PKC 2005, LNCS 3386, pp. 120-137, Springer Verlag, 2005.
21. B. Schoenmakers and P. Tuyls, "Efficient binary conversion for Paillier encrypted values," EUROCRYPT'06, LNCS 4004, pp.522-537, Springer Verlag, 2006.
22. A. Shamir, "How to share a secret," Communications of ACM, vol.22, no.11, pp.612-613, 1979.
23. T. Toft, "Secure integer computation with applications in economy," http://www.aicis.alexandra.dk/uk/projects/scet.demo.htm#Tof05, Available from http://www.daimi.au.dk/~tomas/publications/progress.pdf
24. T. Toft, "An efficient, unconditionally secure equality test for secret shared values," Workshop on Models for Cryptographic Protocols (MCP 2006), Abstract available from http://www.daimi.au.dk/~buus/mcp2006/talks/T.pdf
25. A. Yao, "Protocols for secure computation," Proc. 23rd FOCS, pp. 160-164, 1982.