Multiparty comparison - An improved multiparty protocol for comparison of secret-shared values

ICETE 2009 - International Joint Conference on e-Business and Telecommunications

Volumn , Issue , 2009, Pages 325-330

  Reistad, Tord Ingolf ^a  

^a NORWEGIAN UNIVERSITY OF SCIENCE AND TECHNOLOGY   (Norway)

Author keywords

Comparison; Information hiding; Multiparty; Secret sharing

Indexed keywords

INFORMATION HIDING; MULTI-PARTY PROTOCOLS; SECRET SHARING; SECRET SHARING SCHEMES; SHARED VALUES;

ELECTRONIC COMMERCE; NETWORK SECURITY;

NETWORK PROTOCOLS;

EID: 74549116494     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (12)

1. Bar-Ilan, J. and Beaver, D. (1989). Non-cryptographic faulttolerant computing in a constant number of rounds of interaction. In Rudnicki, P., editor, Proceedings of the eighth annual ACM Symposium on Principles of distributed computing, pages 201-209, New York. ACM Press. (Pubitemid 20692671)
2. Ben-Or, M., Goldwasser, S., and Wigderson, A. (1988). Completeness theorems for noncryptographic faulttolerant distributed computations. In 20th Annual ACM Symposium on Theory of Computing, pages 110. ACM Press.
3. Bogetoft, P., Christensen, D., Dåmgard, I., Geisler, M., Jakobsen, T., Kreigaard, M., Nielsen, J., Nielsen, J., Nielsen, K., Pagter, J., Schwartzbach, M., and Toft, T. (2008). Multi-party computation goes live. Cryptology ePrint Archive, Report 2008/068.
4. Bogetoft, P., Damgård, I., Jakobsen, T., Nielsen, K., Pagter, J., and Toft, T. (2005). Secure computing, economy, and trust: A generic solution for secure auctions with real-world applications. BRICS Report Series RS-05-18,BRICS. http://www.brics.dk/RS/05/18/.
5. Damgard, I., Fitzi, M., Kiltz, E., Nielsen, J., and Toft, T. (2006). Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In Halevi, S. and Rabin, T., editors, Theory of Cryptography, volume 3876 of Lecture Notes in Computer Science (LNCS), pages 285-304. Springer.
6. Fischlin, M. (2001). A cost-effective pay-per-multiplication comparison method for millionaires. In Naccache, D., editor, Topics in Cryptology - CT-RSA 2001, volume 2020 of Lecture Notes in Computer Science, pages 457-471. Springer-Verlag, Berlin, Germany.
7. Gennaro, R., Rabin, M., and Rabin, T. (1998). Simplified vss and fast-track multiparty computations with applications to threshold cryptography. In PODC '98: Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing, pages 101-111, New York, NY, USA. ACM Press.
8. Nishide, T. and Ohta, K. (2007). Multiparty computation for interval, equality, and comparison without bit-decomposition protocol. In PKC 2007 International Workshop on Theory and Practice in Public Key Cryptography, Lecture Notes in Computer Science. Springer-Verlag, Berlin, Germany.
9. Reistad, T. and Toft, T. (2007). Secret sharing comparison by transformation and rotation. In Preproceedings ICITS, International Conference on Information Theoretic Security 2007
10. Schoenmakers, B. and Tuyls, P. (2004). Practical twoparty computation based on the conditional gate. In Lee, P. J., editor, Advances in Cryptology - ASIACRYPT 2004, volume 3329 of Lecture Notes in Computer Science, pages 119-136. Springer-Verlag, Berlin, Germany.
11. Shamir, A. (1979). How to share a secret. Communications of the ACM, 22(11):612-613.
12. Yao, A. (1982). Protocols for secure computation. In Proceedings of the twenty-third annual IEEE Symposium on Foundations of Computer Science, pages 160-164. IEEE Computer Society.