Secure computation with fixed-point numbers

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

Volumn 6052 LNCS, Issue , 2010, Pages 35-50

  Catrina, Octavian ^a   Saxena, Amitabh ^a  

^a UNIVERSITY OF MANNHEIM   (Germany)

Author keywords

secret sharing; secure fixed point arithmetic; Secure multiparty computation

Indexed keywords

APPLICATION DEVELOPMENT; BUSINESS APPLICATIONS; BUSINESS PROBLEMS; CRYPTOGRAPHIC PROTOCOLS; DATA SHARING; DATA TYPE; FIXED POINT ARITHMETIC; INPUT DATAS; MULTIPARTY COMPUTATION; POINT NUMBERS; RATIONAL NUMBERS; SECRET SHARING; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION; SECURE PROTOCOLS;

COMPUTATION THEORY; COMPUTATIONAL EFFICIENCY; CRYPTOGRAPHY; DECISION MAKING; NETWORK PROTOCOLS;

NETWORK SECURITY;

EID: 77955328311     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-14577-3_6     Document Type: Conference Paper

References (20)

1. 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)
2. Atallah, M., Blanton, M., Deshpande, V., Frikken, K., Li, J., Schwarz, L.: Secure Collaborative Planning, Forecasting, and Replenishment (SCPFR). In: Multi- Echelon/Public Applications of Supply Chain Management Conference (2006)
3. Atallah, M., Bykova, M., Li, J., Frikken, K., Topkara, M.: Private Collaborative Forecasting and Benchmarking. In: Proc. WPES 2004, Washington (2004)
4. Brandt, F.: How to obtain full privacy in auctions. International Journal of Information Security 5(4), 201-216 (2006)
5. Catrina, O., Dragulin, C.: Multiparty Computation of Fixed-Point Multiplication and Reciprocal. In: Proc. 20th International Workshop on Database and Expert Systems Application (DEXA 2009), pp. 107-111. IEEE Computer Society, Los Alamitos (2009)
6. Cramer, R., Damǧ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)
7. Cramer, R., Damǧ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)
8. Damǧard, 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)
9. Damǧ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)
10. Damǧ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)
11. Damgard, I., Thorbek, R.: Efficient Conversion of Secret-shared Values Between Different Fields. In: Cryptology ePrint Archive, Report 2008/221 (2008)
12. Ercegovac, M.D., Lang, T.: Digital Arithmetic. Morgan Kaufmann, San Francisco (2003)
13. Fouque, P., Stern, J., Wackers, G.: CryptoComputing with Rationals. In: Blaze, M. (ed.) FC 2002. LNCS, vol.2357, pp. 136-146. Springer, Heidelberg (2003)
14. From, S.L., Jakobsen, T.: Secure Multi-Party Computation on Integers. Master's thesis, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2006)
15. Kiltz, E., Leander, G., Malone-Lee, J.: Secure Computation of the Mean and Related Statistics. In: Kilian, J. (ed.) TCC 2005. LNCS, vol.3378, pp. 283-302. Springer, Heidelberg (2005)
16. Markstein, P.: Software Division and Square Root Using Goldschmidt's Algorithms. In: Proc. 6th Conference on Real Numbers and Computers, pp. 146-157 (2004)
17. Masayuki Ito, N.T., Yajima, S.: Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification. IEEE Transactions on Computers 46(4) (1997)
18. 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)
19. Toft, T.: Primitives and Applications for Multi-party Computation. PhD dissertation, Univ. of Aarhus, Denmark, BRICS, Dep. of Computer Science (2007)
20. 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)