Author:
Lindell Yehuda,Pinkas Benny,Smart Nigel P.,Yanai Avishay
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols. In: Ortiz, H. (ed.) 22nd STOC, pp. 503–513. ACM (1990)
2. Ben-David, A., Nisan, N., Pinkas, B.: FairplayMP: a system for secure multi-party computation. In: Ning, P., Syverson, P.F., Jha, S. (eds.) ACM CCS, pp. 257–266. ACM (2008)
3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Simon [21], pp. 1–10
4. Chaum, D., Crépeau, C., Damgård, I.: Multiparty unconditionally secure protocols. In: Simon [21], pp. 11–19
5. Choi, S.G., Katz, J., Malozemoff, A.J., Zikas, V.: Efficient three-party computation from cut-and-choose. In: Garay, Gennaro [9], pp. 513–530
Cited by
79 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. The Price of Active Security in Cryptographic Protocols;Journal of Cryptology;2024-07
2. Efficient Actively Secure DPF and RAM-based 2PC with One-Bit Leakage;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
3. Scalable Mixed-Mode MPC;2024 IEEE Symposium on Security and Privacy (SP);2024-05-19
4. ScionFL: Efficient and Robust Secure Quantized Aggregation;2024 IEEE Conference on Secure and Trustworthy Machine Learning (SaTML);2024-04-09
5. Fast Public-Key Silent OT and More from Constrained Naor-Reingold;Lecture Notes in Computer Science;2024