Author:
Faber Sky,Jarecki Stanislaw,Kentros Sotirios,Wei Boyang
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 1–10. ACM, New York (1988)
2. Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 11–19. ACM, New York (1988)
3. Lecture Notes in Computer Science;SG Choi,2012
4. Chor, B., Goldreich, O., Kushilevitz, E., Sudan, M.: Private information retrieval. In: Proceedings of 36th FOCS, pp. 41–50 (1995)
5. Lecture Notes in Computer Science;K-M Chung,2014
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
2. Distributed & Scalable Oblivious Sorting and Shuffling;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
3. Ramen: Souper Fast Three-Party Computation for RAM Programs;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15
4. GraphOS: Towards Oblivious Graph Processing;Proceedings of the VLDB Endowment;2023-09
5. Exploring the Efficiency of Data-Oblivious Programs;2023 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS);2023-04