Author:
Atallah Mikhail J.,Li Jiangtao
Publisher
Springer Berlin Heidelberg
Reference29 articles.
1. Aho, A.V., Hirschberg, D.S., Ullman, J.D.: Bounds on the Complexity of the Longest Common Subsequence Problem. Journal of the ACM 23(1), 1–12 (1976)
2. Atallah, M.J., Kerschbaum, F., Du, W.: Secure and Private Sequence Comparisons. In: Proceedings of 2nd ACM Workshop on Privacy in Electronic Society (2003)
3. Atallah, M.J., Pantazopoulos, K.N., Rice, J., Spafford, E.H.: Secure Outsourcing of Scientific Computations. Advances in Computers 54(6), 215–272 (2001)
4. Lecture Notes in Computer Science;P. Beguin,1995
5. Cachin, C.: Efficient Private Bidding and Auctions with an Oblivious Third Party. In: Proceedings of the 6th ACM Conference on Computer and Communications Security, pp. 120–127 (1999)
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献