Author:
Anagreh Mohammad,Laud Peeter
Publisher
Springer International Publishing
Reference40 articles.
1. Aly, A., Cleemput, S.: An improved protocol for securely solving the shortest path problem and its application to combinatorial auctions. Cryptology ePrint Archive, Paper 2017/971 (2017)
2. Anagreh, M., Laud, P., Vainikko, E.: Parallel privacy-preserving shortest path algorithms. Cryptography 5(4), 27 (2021)
3. Anagreh, M., Laud, P., Vainikko, E.: Privacy-preserving parallel computation of shortest path algorithms with low round complexity. In: Mori, P., Lenzini, G., Furnell, S. (eds.) Proceedings of the 8th International Conference on Information Systems Security and Privacy, ICISSP 2022, Online Streaming, 9–11 February 2022, pp. 37–47. SCITEPRESS (2022)
4. Anagreh, M., Vainikko, E., Laud, P.: Parallel privacy-preserving computation of minimum spanning trees. In: Mori, P., Lenzini, G., Furnell, S. (eds.) Proceedings of the 7th International Conference on Information Systems Security and Privacy, ICISSP 2021, Online Streaming, 11–13 February 2021, pp. 181–190. SCITEPRESS (2021)
5. Anagreh, M., Vainikko, E., Laud, P.: Parallel privacy-preserving shortest paths by radius-stepping. In: 2021 29th Euromicro International Conference on Parallel, Distributed and Network-Based Processing (PDP), pp. 276–280. IEEE (2021)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Shortest Paths Publishing With Differential Privacy;IEEE Transactions on Sustainable Computing;2023