Bureaucratic protocols for secure two-party sorting, selection, and permuting

Proceedings of the 5th International Symposium on Information, Computer and Communications Security, ASIACCS 2010

Volumn , Issue , 2010, Pages 226-237

  Wang, Guan ^a   Luo, Tongbo ^a   Goodrich, Michael T ^b   Du, Wenliang ^a   Zhu, Zutao ^a  

^a SYRACUSE UNIVERSITY   (United States)

^b UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

bureaucratic protocols; oblivious algorithms; secure two party computation; sorting

Indexed keywords

BLACK BOXES; COMPUTATIONAL OVERHEADS; DESIGN DATA; INPUT FUNCTIONS; INPUT VALUES; OBLIVIOUS ALGORITHMS; RANDOM PERMUTATIONS; SECURE TWO-PARTY COMPUTATIONS; ZERO KNOWLEDGE;

ALGORITHMS; COMPUTATION THEORY; NETWORK SECURITY; SORTING;

NETWORK PROTOCOLS;

EID: 77954519783     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1755688.1755716     Document Type: Conference Paper

References (30)

1. th-ranked element. In In Advances in Cryptology-Proc. of Eurocrypt'04, pages 40-55, 2004.
2. M. Ajtai, J. Komlos, and E. Szemeredi. Sorting in c log n parallel steps. Combinatorica, 3:1-19, 1983.
3. M. J. Atallah and W. Du. Secure multi-party computational geometry. In WADS2001: 7th International Workshop on Algorithms and Data Structures, pages 165-179, Providence, Rhode Island, USA, August 8-10 2001.
4. K. E. Batcher. Sorting networks and their applications. In Proceedings of the AFIPS Spring Joint Computer Conference 32, pages 307-314, 1968.
5. M. Blum, R. W. Floyd, V. Pratt, R. Rivest, and R. Tarjan. Time bounds for selection, 1973.
6. R. Canetti, Y. Ishai, R. Kumar, M. K. Reiter, R. Rubinfeld, and R. N. Wright. Selective private function evaluation with applications to private statistics (extended abstract). In Proceedings of Twentieth ACM Symposium on Principles of Distributed Computing (PODC), 2001.
7. G. Chen and H. Shen. A bitonic selection algorithm on multiprocessor system. J. of Comput. Sci. Technol., 4:315-322, 1989.
8. B. Chor, O. Goldreich, E. Kushilevitz, and M. Sudan. Private information retrieval. In Proceedings of IEEE Symposium on Foundations of Computer Science, Milwaukee, WI USA, October 23-25 1995.
9. M. Ciura. Best increments for the average case of shellsort. In International Symposium on Fundamentals of Computation Theory, Riga, Latvia, 2001.
10. T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
11. J. Feigenbaum, Y. Ishai, T. Malkin, K. Nissim, M. Strauss, and R. Wright. Secure multiparty computation of approximations. In Twenty Eighth International Colloquium on Automata, Language and Programming, 2001.
12. M. Frigo, C. E. Leiserson, H. Prokop, and S. Ramachandran. Cache-oblivious algorithms (extended abstract). In In Proc. 40th Annual Symposium on Foundations of Computer Science, pages 285-397. IEEE Computer Society Press, 1999.
13. O. Goldreich. The Foundations of Cryptography, volume 2. 2004.
14. O. Goldreich, S. Micali, and A. Wigderson. How to play any mental game. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pages 218-229, 1987.
15. L. J. Goldstein and S. W. Leibholz. On the synthesis of signal switching networks with transient blocking, 1967.
16. M. T. Goodrich and R. Tamassia. Algorithm Design: Foundations, Analysis, and Internet Examples. Wiley, 2001.
17. Michael T. Goodrich. Randomized Shellsort: A simple oblivious sorting algorithm. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 1-16. SIAM, 2010.
18. J. Incerpi. A study of the worst case of shellsort. Ph.D. thesis, Brown University, Dept. of Computer Science, 1994.
19. J. Incerpi and R. Sedgewick. Practical variations of shellsort. Information Processing Letters, 79:223-227, 2001.
20. D. E. Knuth. Seminumerical algorithms. The Art of Computer Programming, 2.
21. D. E. Knuth. Sorting and searching. The Art of Computer Programming, 3.
22. T. Leighton, Y. Ma, and T. Suel. On probabilistic networks for selection, merging, and sorting. In SPAA'95, pages 106-118, Santa Barbara, CA, USA, 1995.
23. P. Lemke. The performance of randomized shellsort-like network sorting algorithms. In SCAMP working paper, Institute for Defense Analysis, Princeton, NJ, USA, 1994.
24. Y. Lindell and B. Pinkas. Privacy preserving data mining. In Advances in Cryptology - Crypto2000, Lecture Notes in Computer Science, volume 1880, 2000.
25. D. Malkhi, N. Nisan, B. Pinkas, and Y. Sella. Fairplay - a secure two-party computation system. In In USENIX Security Symposium, pages 287-302, 2004.
26. M. S. Paterson. Improved sorting networks with o(log n) depth. Algorithmica, 5:75-92, 2005.
27. H. Prokop. Cache-oblivious algorithms. Technical report, M.I.T, 1999.
28. R. Sedgewick. Analysis of shellsort and related algorithms. In ESA 96: Fourth Annual European Symposium on Algorithms, pages 25-27, 1996.
29. D. L. Shell. A high-speed sorting procedure. Commun. ACM, 2(7):30-32, 1959.
30. A. C. Yao. How to generate and exchange secrets. In Proceedings 27th IEEE Symposium on Foundations of Computer Science, pages 162-167, 1986.