Improved primitives for secure multiparty integer computation

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

Volumn 6280 LNCS, Issue , 2010, Pages 182-199

  Catrina, Octavian ^a   De Hoogh, Sebastiaan ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

secret sharing; secure comparison; secure integer arithmetic; Secure multiparty computation

Indexed keywords

BUILDING BLOCKES; COMPLEX APPLICATIONS; FIXED-POINT COMPUTATION; HIGHER-LEVEL PROTOCOLS; INTEGER ARITHMETIC; MULTI-PARTY COMPUTATION PROTOCOLS; MULTIPARTY COMPUTATION; PERFORMANCE BOTTLENECKS; PERFORMANCE REQUIREMENTS; SECRET SHARING; SECURE COMPARISON; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 77958074910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15317-4_13     Document Type: Conference Paper

References (25)

1. Abe, M., Cramer, R., Fehr, S.: Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments. In: Zheng, Y. (ed.) ASIACRYPT 2002. LNCS, vol. 2501, pp. 206-223. Springer, Heidelberg (2002)
2. Algesheimer, J., Camenish, J., Shoup, V.: Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 417-432. Springer, Heidelberg (2002)
3. Atallah, M., Blanton, M., Deshpande, V., Frikken, K., Li, J., Schwarz, L.: Se-cure Collaborative Planning, Forecasting, and Replenishment (SCPFR). In: Multi-Echelon/Public Applications of Supply Chain Management Conference (2006)
4. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: Proc. 8th ACM Symposium on Principles of Distributed Computing, pp. 201-209. ACM, New York (1989)
5. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault tolerant distributed computation. In: Proc. of 20th ACM Sym-posium on Theory of Computing (STOC), pp. 1-10 (1988)
6. Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 35-50. Springer, Heidelberg (2010)
7. Cramer, R., Damg°ard, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342-362. Springer, Heidelberg (2005)
8. Cramer, R., Damg°ard, I., Maurer, U.: General Secure Multi-Party Computation from any Linear Secret-Sharing Scheme. In: Preneel, B. (ed.) EUROCRYPT 2000. LNCS, vol. 1807, pp. 316-334. Springer, Heidelberg (2000)
9. Cramer, R., Damg°ard, I., Nielsen, J.: Multiparty computation from threshold homomorphic encryption. In: Pfitzmann, B. (ed.) EUROCRYPT 2001. LNCS, vol. 2045, pp. 280-300. Springer, Heidelberg (2001)
10. Cramer, R., Gennaro, 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) (Pubitemid 127067797)
11. Damg°ard, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and ex-ponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006)
12. Damg°ard, I., Nielsen, J., Toft, T., Pagter, J.I., Jakobsen, T., Bogetoft, P., Nielsen, K.: A Practical Implementation of Secure Auctions Based on Multiparty Integer Computation. In: Di Crescenzo, G., Rubin, A. (eds.) FC 2006. LNCS, vol. 4107, pp. 142-147. Springer, Heidelberg (2006)
13. Damg°ard, I., Thorbek, R.: Non-interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412-429. Springer, Heidelberg (2007)
14. Damgard, I., Thorbek, R.: Efficient conversion of secret-shared values between different fields. Cryptology ePrint Archive, Report 2008/221 (2008)
15. Garay, J., Schoenmakers, B., Villegas, J.: Practical and Secure Solutions for Integer Comparison. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 330-342. Springer, Heidelberg (2007)
16. Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In: Proc. of ACM Sym-posium on Principles of Distributed Computing, PODC 1998 (1998)
17. Guajardo, J., Mennink, B., Schoenmakers, B.: Modulo reduction for paillier en-cryptions and application to secure statistical analysis. In: Sion, R. (ed.) FC 2010. LNCS, vol. 6052, pp. 375-382. Springer, Heidelberg (2010)
18. Kerschbaum, F.: Building a privacy-preserving benchmarking enterprise system. Enterp. Inf. Syst. 2(4), 421-441 (2008)
19. Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Com-parison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343-360. Springer, Heidelberg (2007)
20. Reistad, T.I.: Multiparty comparison-an improved multiparty protocol for com-parison of secret-shared values. In: SECRYPT, pp. 325-330. INSTICC (2009)
21. Schoenmakers, B., Tuyls, P.: Efficient Binary Conversion for Paillier Encryptions. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 522-537. Springer, Heidelberg (2006)
22. SecureSCM. Security Analysis. Deliverable D9.2, EU FP7 Project Secure Supply Chain Management, SecureSCM (2009)
23. Shoup, V.: A Computational Introduction to Number Theory and Algebra, 2nd edn. Cambridge University Press, Cambridge (2009)
24. Toft, T.: Primitives and Applications for Multi-party Computation. PhD disserta-tion, University of Aarhus, Denmark (2007)
25. Toft, T.: Solving Linear Programs Using Multiparty Computation. In: Dingledine, R., Golle, P. (eds.) FC 2009. LNCS, vol. 5628, pp. 90-107. Springer, Heidelberg (2009)