Performance comparison of secure comparison protocols

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

Volumn , Issue , 2009, Pages 133-136

  Kerschbaum, Florian ^a   Biswas, Debmalya ^a   De Hoogh, Sebastiaan ^b  

^a SAP RESEARCH   (Germany)

^b EINDHOVEN UNIVERSITY OF TECHNOLOGY   (Netherlands)

Author keywords

Comparison protocols; Homomorphic encryption; Multiplicative hiding; Secret shares; Secure multiparty computation

Indexed keywords

E-COMMERCE; HOMOMORPHIC-ENCRYPTIONS; INPUT VALUES; PERFORMANCE COMPARISON; SECRET SHARING SCHEMES; SECURE MULTI-PARTY COMPUTATION;

CRYPTOGRAPHY; DATABASE SYSTEMS; ELECTRONIC COMMERCE; EXPERT SYSTEMS; IMAGE QUALITY; INTERNET PROTOCOLS; PROBLEM SOLVING;

NETWORK SECURITY;

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

References (16)

1. A. Yao, Protocols for Secure Computation, in proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 160164, 1982.
2. O. Goldreich, S. Micali, and A. Wigderson, How to Play Any Mental Game, in proceedings of the 19th Annual Symposium on Theory of Computing (STOC), pp. 218229, 1987.
3. T. Nishide and K. Ohta, Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol, in proceedings of the 10th International Conference on Practice and Theory in Public-Key Cryptography (PKC), pp. 343-360, 2007.
4. W. Du and M. J. Atallah, Secure Multi-party Computation Problems and their Applications: A Review and Open Problems, in proceedings of the New Security Paradigms Workshop (NSPW), pp. 12-21, 2001.
5. P. Bogetoft, D. L. Christensen, I. Dmgard, M. Geisler, T. Jakobsen, M. Krigaard, J. D. Nielsen, J. B. Nielsen, K. Nielsen, J. Pagter, M. Schwartzbach, and T. Toft, Multiparty Computation Goes Live, Cryptology ePrint Archive, Report 2008/068, 2008.
6. E. Kiltz, G. Leander, and J. Malone-Lee, Secure Computation of the Mean and Related Statistics, in proceedings of the 2nd Theory of Cryptography Conference (TCC), Spring LNCS vol. 3378, pp. 283-302, 2005.
7. I. Damgard and M. Jurik, A Generalization, a Simplification and Some Applications of Paillier's Probabilistic Public-Key System, in proceedings of the 4th International Workshop of Practice and Theory in Public Key Cryptography (PKC), Springer LNCS vol. 1992, pp. 119-136, 2001.
8. P. Paillier, Public-Key Cryptosystems Based on Composite Degree Residuosity Classes, in proceedings of the International Conference on the Theory and Application of Cryptographic Techniques (EUROCRYPT), Spring LNCS 1592, pp. 223-238, 1999.
9. A. Shamir, How to Share a Secret, Communications of the ACM, 22(11): 612-613, 1979.
10. R. Gennaro, M O. Rabin, and T. Rabin, Simplified VSS and Fact-Track Multiparty Computations with Applications to Threshold Cryptography, in proceedings of the 17th ACM Symposium on Principles of Distributed Computing (PODC), pp. 101-111, 1998.
11. V. Nikov, S. Nikova, and B. Preneel, On Multiplicative Linear Secret Sharing Schemes, in proceedings of the 4th International Conference on Cryptology in India (INDOCRYPT), pp. 135-147, 2003.
12. F. Bahr, M. Boehm, J. Franke, and T. Kleinjung, RSA200, Available at http://www.cryptoworld.com/announcements/rsa200.txt, 2005.
13. M. Ben-Or, S. Goldwasser, and A. Wigderson, Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computations, in: proceedings of the 20th Annual Symposium on the Theory of Computing (STOC), ACM Press, pp. 110, 1988.
14. Exclusive Disjunction, Available at http://en.wikipedia.org/wiki/ Exclusive disjunction.
15. A. K. Lenstra and E. R. Verheul, Selecting Cryptographic Key Sizes, Journal of Cryptology, 14(4): 255293, 2001.
16. Java Remote Method Invocation Home, Available at http://java.sun.com/javase/technologies/core/basic/rmi/.