Amortized Complexity of Information-Theoretically Secure MPC Revisited-Reference-Cited by-同舟云学术

Amortized Complexity of Information-Theoretically Secure MPC Revisited

Published:2018 Issue: Volume: Page:395-426
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Cascudo Ignacio,Cramer Ronald,Xing Chaoping,Yuan Chen

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-319-96878-0_14

Reference23 articles.

1. Bassa, A., Beelen, P., Garcia, A., Stichtenoth, H.: Towers of function fields over non-prime finite fields. Moscow Math. J. 15(1), 1–29 (2015)

2. Lecture Notes in Computer Science;D Beaver,1992

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, 2–4 May 1988, pp. 1–10 (1988)

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

5. Lecture Notes in Computer Science;AR Block,2017

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

1. Scalable Multiparty Garbling;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15

2. Privacy-preserving cryptographic algorithms and protocols: a survey on designs and applications;SCIENTIA SINICA Informationis;2023-09-01

3. Ramp Hyper-invertible Matrices and Their Applications to MPC Protocols;Advances in Cryptology – ASIACRYPT 2023;2023

4. Degree-D Reverse Multiplication-Friendly Embeddings: Constructions and Applications;Advances in Cryptology – ASIACRYPT 2023;2023

5. Amortized NISC over $$\mathbb {Z}_{2^k}$$ from RMFE;Advances in Cryptology – ASIACRYPT 2023;2023