Secure multiparty computation for comparator networks

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Volumn E91-A, Issue 9, 2008, Pages 2349-2355

  Morohashi, Gembu ^a,b   Chida, Koji ^b   Hirota, Keiichi ^b   Kikuchi, Hiroaki ^c  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b NTT CORPORATION   (Japan)

^c TOKAI UNIVERSITY   (Japan)

Author keywords

(M + 1) st price auction; Comparator network; Multiparty protocol; Secure function evaluation; Statistical analysis

Indexed keywords

COMPARATOR CIRCUITS; COMPARATORS (OPTICAL); INTERNET PROTOCOLS; STATISTICAL METHODS;

MULTI-PARTY PROTOCOLS; PRICE AUCTION; SECURE FUNCTION EVALUATION; SECURE MULTI-PARTY COMPUTATION; SORTING AND SEARCHING; VARIOUS FUNCTIONS;

NETWORK SECURITY;

EID: 70349856576     PISSN: 09168508     EISSN: 17451337     Source Type: Journal    
DOI: 10.1093/ietfec/e91-a.9.2349     Document Type: Article

References (20)

1. G. Aggarwal, N. Mishra, and B. Pinkas, "Secure computation of the kth-ranked element" Advances in Cryptology -EUROCRYPT'04, LNCS 3027, pp.40-55, Springer-Verlag, Berlin, 2004.
2. D.L. Chaum, "Untraceable electronic mail, return address, and digital pseudonyms," Commun. ACM, vol.24, no.2, pp.84-88, 1981.
3. K. Chida, G. Yamamoto, K. Suzuki, S. Uchiyama, N. Taniguchi, O. Shionoiri, and A. Kanai, "Non-optimistic secure circuit evaluation based on ElGamal encryption and its applications," IEICE Trans. Fundamentals, vol.E90-A, no.1, pp.128-138, Jan. 2007.
4. I. Damgård and M. Jurik, "Client/server tradeoffs for online elections," Public Key Cryptography 2002, LNCS 2274, pp. 125-140, Springer-Verlag, Berlin, 2002.
5. Y. Desmedt and Y. Frankel, "Threshold cryptosystems," Advances in Cryptology -CRYPTO'89, LNCS 435, pp.307-315, Springer-Verlag, Berlin, 1990.
6. P. Feldman, "A practical scheme for non-interactive verifiable secret sharing," Proc. FOCS'87, pp.427-437, IEEE Press, Los Alamitos, 1987.
7. M. Jakobsson and A. Juels, "Mix and match: Secure function evaluation via ciphertexts," Advances in Cryptology-ASIACRYPT'00, LNCS 1976, pp. 162-177, Springer-Verlag, Berlin, 2000.
8. H. Kikuchi, "(M + l)st-price auction protocol," Financial Cryptography 2001, LNCS 2339, pp.351-363, Springer-Verlag, Berlin, 2002.
9. D.E. Knuth, The Art of Computer Programming, vol.3, Sorting and Searching, 2nd ed., Addison-Wesley, Reading, MA, 1998.
10. V. Krishna, Auction Theory, Academic Press, San Diego, 2002.
11. K. Kurosawa and W. Ogata, "Bit-slice auction circuit" ESORICS 2002, LNCS 2502, pp.24-38, Springer-Verlag, Berlin, 2002.
12. G. Morohasni, K. Chida, K. Hirota, S. Tanimoto, O. Shionoiri, and A. Kanai, "Cross tabulation protocol hiding individual information," Proc. Computer Security Symposium 2006, Kyoto, Japan, 2006.
13. C.A. Neff, "A verifiable secret shuffle and its application to e-voting," Proc. ACM CCS 2001, pp. 116-125, ACM Press, New York, 2001.
14. C.A. Neff, "Verifiable mixing (shuffling) of ElGamal pairs," VHTi Technical Document, http://www.votehere.net/vhti/documentation/egshuf.pdf, VoteHere, Inc., 2003.
15. M.J. Osborne and A. Rubinstein, A Course in Game Theory, The MIT Press, Cambridge, MA, 1994.
16. C. Park, K. Itoh, and K. Kurosawa, "Efficient anonymous channel and all/nothing election scheme," Advances in Cryptology-EUROCRYPT'93, LNCS 765, pp.248-259, Springer-Verlag, Berlin, 1994.
17. K. Sako, "Generating statistical information in anonymous surveys," IEICE Trans. Fundamentals, vol.E79-A, no.4, pp.507-512, April 1996.
18. K. Sako and J. Kilian, "Receipt-free mix-type voting scheme-A practical solution to the implementation of a voting booth," Advances in Cryptology-EUROCRYPT'95, LNCS 921, pp.393-403, Springer-Verlag, Berlin, 1995.
19. B. Schoenmakers and P. Tuyls, "Practical two-party computation based on the conditional gate," Advances in Cryptology-ASIACRYFT04, LNCS 3329, pp.119-136, Springer-Verlag, Berlin, 2004.
20. A.C. Yao, "Protocols for secure computations," Proc. FOCS'82, pp. 160-164, IEEE Press, Los Alamitos, 1982.