Perfectly-Secure Multiplication for Any t < n/3-Reference-Cited by-同舟云学术

Perfectly-Secure Multiplication for Any t < n/3

Published:2011 Issue: Volume: Page:240-258
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2011
language:
Short-container-title:

Author:

Asharov Gilad,Lindell Yehuda,Rabin Tal

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22792-9_14.pdf

Reference19 articles.

1. Asharov, G., Lindell, Y., Rabin, T.: A Full Proof of the Perfectly-Secure BGW Protocol and Improvements. Cryptology ePrint Archive, 2011/136 (2011)

2. Lecture Notes in Computer Science;Z. Beerliová-Trubíniová,2006

3. Lecture Notes in Computer Science;Z. Beerliová-Trubíniová,2008

4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation. In: 20th STOC, pp. 1–10 (1988)

5. Canetti, R.: Security and Composition of Multiparty Cryptographic Protocols. Journal of Cryptology 13(1), 143–202 (2000)

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

1. Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time;Advances in Cryptology – EUROCRYPT 2023;2023

2. Efficient Perfectly Secure Computation with Optimal Resilience;Journal of Cryptology;2022-09-27

3. Asymptotically Free Broadcast in Constant Expected Time via Packed VSS;Theory of Cryptography;2022

4. Efficient Perfectly Secure Computation with Optimal Resilience;Theory of Cryptography;2021

5. SNUSE: A secure computation approach for large-scale user re-enrollment in biometric authentication systems;Future Generation Computer Systems;2019-09