Round-Optimal Secure Two-Party Computation from Trapdoor Permutations-Reference-Cited by-同舟云学术

Round-Optimal Secure Two-Party Computation from Trapdoor Permutations

Published:2017 Issue: Volume: Page:678-710
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Ciampi Michele,Ostrovsky Rafail,Siniscalchi Luisa,Visconti Ivan

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-70500-2_23

Reference19 articles.

1. Lecture Notes in Computer Science;P Ananth,2017

2. Blum, M.: How to prove a theorem so no one else can claim it. In: Proceedings of the International Congress of Mathematicians, pp. 1444–1454 (1986)

3. Lecture Notes in Computer Science;M Ciampi,2016

4. Lecture Notes in Computer Science;M Ciampi,2017

5. Ciampi, M., Ostrovsky, R., Siniscalchi, L., Visconti, I.: Round-optimal secure two-party computation from trapdoor permutations. Cryptology ePrint Archive, Report 2017/920 (2017). http://eprint.iacr.org/2017/920

Cited by 22 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Cloud-SMPC: two-round multilinear maps secure multiparty computation based on LWE assumption;Journal of Cloud Computing;2024-01-22

2. A Practical Approach to Quantum Resilient Cloud Usage Obtaining Data Privacy;2023 International Interdisciplinary PhD Workshop (IIPhDW);2023-05-03

3. Maliciously-Secure MrNISC in the Plain Model;Advances in Cryptology – EUROCRYPT 2023;2023

4. Knowledge Encryption and Its Applications to Simulatable Protocols with Low Round-Complexity;Advances in Cryptology – ASIACRYPT 2022;2022

5. Round-Optimal Multi-party Computation with Identifiable Abort;Advances in Cryptology – EUROCRYPT 2022;2022