Author:
Badrinarayanan Saikrishna,Goyal Vipul,Jain Abhishek,Kalai Yael Tauman,Khurana Dakshita,Sahai Amit
Publisher
Springer International Publishing
Reference34 articles.
1. Lecture Notes in Computer Science;P Ananth,2017
2. Barak, B.: How to go beyond the black-box simulation barrier. In: 2001 Proceedings of the 42nd IEEE Symposium on Foundations of Computer Science, pp. 106–115. IEEE (2001)
3. Barak, B., Sahai, A.: How to play almost any mental game over the net - concurrent composition via super-polynomial simulation. In: Proceedings of the 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), 23–25 October 2005, Pittsburgh, PA, USA, pp. 543–552 (2005). https://doi.org/10.1109/SFCS.2005.43
4. Beaver, D., Micali, S., Rogaway, P.: The round complexity of secure protocols (extended abstract). In: STOC, pp. 503–513 (1990)
5. Lecture Notes in Computer Science;F Benhamouda,2018
Cited by
41 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. A New Approach to Post-Quantum Non-Malleability;2023 IEEE 64th Annual Symposium on Foundations of Computer Science (FOCS);2023-11-06
2. The Round Complexity of Statistical MPC with Optimal Resiliency;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02
3. Broadcast-Optimal Four-Round MPC in the Plain Model;Theory of Cryptography;2023
4. On Non-uniform Security for Black-Box Non-interactive CCA Commitments;Advances in Cryptology – EUROCRYPT 2023;2023
5. A New Framework for Quantum Oblivious Transfer;Advances in Cryptology – EUROCRYPT 2023;2023