Multiparty computation of fixed-point multiplication and reciprocal

Proceedings - International Workshop on Database and Expert Systems Applications, DEXA

Volumn , Issue , 2009, Pages 107-111

  Catrina, Octavian ^a   Dragulin, Claudiu ^a  

^a International University in Germany   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPLICATION DEVELOPMENT; BASIC OPERATION; BUSINESS APPLICATIONS; MULTIPARTY COMPUTATION; OPEN PROBLEMS; POINT MULTIPLICATION; POINT NUMBERS; RATIONAL NUMBERS; SECRET SHARING; SECURE COMPOSITION; SECURE COMPUTATION; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY; DATABASE SYSTEMS; EXPERT SYSTEMS; NETWORK SECURITY; PROBLEM SOLVING;

NETWORK PROTOCOLS;

EID: 73649105882     PISSN: 15294188     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/DEXA.2009.84     Document Type: Conference Paper

References (11)

1. J. Algesheimer, J. Camenish, and V. Shoup. Efficient computation modulo a shared secret with application to the generation of shared safe-prime products. In CRYPTO 2002, volume 2442 of LNCS, pages 417-432. Springer-Verlag, 2002.
2. M. Atallah, M. Blanton, V. Deshpande, K. Frikken, J. Li, and L. Schwarz. Secure Collaborative Planning, Forecasting, and Replenishment (SCPFR). In Proc. of Multi-Echelon/Public Applications of Supply Chain Management Conference, Atlanta, USA, 2006.
3. F. Brandt. Fundamental Aspects of Privacy and Deception in Electronic Auctions. PhD dissertation, Technical University Munich, 2003.
4. R. Cramer, I. Damg̊ ard, and Y. Ishai. Share conversion, pseudorandom secret-sharing and applications to secure computation. In TCC 2005, volume 3378 of LNCS, pages 342-362. Springer-Verlag, 2005.
5. I. Damg̊ ard, M. Fitzi, E. Kiltz, J. Nielsen, and T. Toft. Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In TCC 2006, volume 3876 of LNCS, pages 285-304. Springer-Verlag, 2006.
6. M. D. Ercegovac and T. Lang. Digital Arithmetic. Morgan Kaufmann, 2003.
7. S. L. From and T. Jakobsen. Secure Multi-Party Computation on Integers. Master's thesis, University of Aarhus, Denmark, BRICS, Department of Computer Science, 2006.
8. E. Kiltz, G. Leander, and J. Malone-Lee. Secure Computation of the Mean and Related Statistics. In TCC 2005, volume 3378 of LNCS. Springer-Verlag, 2005.
9. N. T. Masayuki Ito and S. Yajima. Efficient Initial Approximation for Multiplicative Division and Square Root by a Multiplication with Operand Modification. IEEE Transactions on Computers, 46(4), 1997.
10. T. Nishide and K. Ohta. Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol. In PKC 2007, volume 4450 of LNCS, pages 343-360. Springer-Verlag, 2007.
11. T. Toft. Primitives and Applications for Multi-party Computation. PhD dissertation, University of Aarhus, Denmark, Department of Computer Science, 2007.