Secure multiparty linear programming using fixed-point arithmetic

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

Volumn 6345 LNCS, Issue , 2010, Pages 134-150

  Catrina, Octavian ^a   De Hoogh, Sebastiaan ^b  

^a UNIVERSITY OF MANNHEIM   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

linear programming; secret sharing; secure fixed point arithmetic; Secure multiparty computation

Indexed keywords

CRYPTOGRAPHY; DATA PRIVACY; FIXED POINT ARITHMETIC; SUPPLY CHAINS;

FIXED-POINT ARITHMETICS; LINEAR PROGRAMS; LINEAR-PROGRAMMING; OBJECTIVE FUNCTIONS; OPTIMIZATION PROBLEMS; PRIVATE DATA; SECRET-SHARING; SECURE FIXED-POINT ARITHMETIC; SECURE MULTI-PARTY COMPUTATION; SUPPLY CHAIN PLANNING;

LINEAR PROGRAMMING;

EID: 78049400032     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-15497-3_9     Document Type: Conference Paper

References (19)

1. Bednarz, A., Bean, N., Roughan, M.: Hiccups on the road to privacy-preserving linear programming. In: WPES 2009: Proc. of the 8th ACM Workshop on Privacy in the electronic society, pp. 117-120. ACM, New York (2009)
2. Bertsimas, D., Tsitsiklis, J.: Introduction to Linear Optimization. Athena Scientific, Belmont (1997)
3. Canetti, R.: Security and composition of multiparty cryptographic protocols. Journal of Cryptology 13(1), 143-202 (2000)
4. Catrina, O., Saxena, A.: Secure computation with fixed-point numbers. In: Financial Cryptography and Data Security. LNCS, Springer, Heidelberg (2010)
5. Cramer, R., Damgärd, 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)
6. Cramer, R., Damgärd, 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)
7. Damgärd, I., Fitzi, M., Kiltz, E., Nielsen, J., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 285-304. Springer, Heidelberg (2006)
8. Damgärd, I., Thorbek, R.: Non-interactive Proofs for Integer Multiplication. In: Naor, M. (ed.) EUROCRYPT 2007. LNCS, vol. 4515, pp. 412-429. Springer, Heidelberg (2007)
9. Damgard, I., Thorbek, R.: Efficient conversion of secret-shared values between different fields. Cryptology ePrint Archive, Report 2008/221 (2008)
10. Ercegovac, M. D., Lang, T.: Digital Arithmetic. Morgan Kaufmann, San Francisco (2003)
11. Frati, F., Damiani, E., Ceravolo, P., Cimato, S., Fugazza, C., Gianini, G., Marrara, S., Scotti, O.: Hazards in full-disclosure supply chains. In: Proc. 8th Conference on Advanced Information Technologies for Management, AITM 2008 (2008)
12. Gennaro, R., Rabin, M., Rabin, T.: Simplified VSS and fast-track multi-party computations with applications to threshold cryptography. In: Proc. of ACM Symposium on Principles of Distributed Computing, PODC 1998 (1998)
13. Li, J., Atallah, M.: Secure and Private Collaborative Linear Programming. In: Proc. 2nd Int. Conference on Collaborative Computing: Networking, Applications and Worksharing (ColaborateCom 2006), Atlanta, USA, pp. 19-26 (2006)
14. Nishide, T., Ohta, K.: Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In: Okamoto, T., Wang, X. (eds.) PKC 2007. LNCS, vol. 4450, pp. 343-360. Springer, Heidelberg (2007)
15. Rosenberg, G.: Enumeration of All Extreme Equilibria of Bimatrix Games with Integer Pivoting and Improved Degeneracy Check. Research Report LSE-CDAM-2005-18, London School of Economics and Political Science (2005)
16. SecureSCM. Security Analysis. Deliverable D9.2, EU FP7 Project Secure Supply Chain Management, SecureSCM (2009)
17. SecureSCM. Protocol Description V2. Deliverable D3.2, EU FP7 Project Secure Supply Chain Management, SecureSCM (2010)
18. Toft, T.: Primitives and Applications for Multi-party Computation. PhD dissertation, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2007)
19. 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)