How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ-Reference-Cited by-同舟云学术

How to Choose Suitable Secure Multiparty Computation Using Generalized SPDZ

Published:2018-10-08 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the 2018 ACM SIGSAC Conference on Computer and Communications Security
language:
Short-container-title:

Author:

Araki Toshinori¹,Barak Assi²,Furukawa Jun³,Keller Marcel⁴,Ohara Kazuma¹,Tsuchida Hikaru¹

Affiliation:

1. NEC, Kanagawa, Japan

2. Bar-Ilan University, Tel Aviv , Israel

3. NEC Israel Research Center, Herzliya, Israel

4. Data61, Eveleigh, Australia

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/3243734.3278510

Reference7 articles.

1. Generalizing the SPDZ Compiler For Other Protocols

2. ristol Cryptography Group. Multiparty computation with SPDZ MASCOT and Overdrive offline phases https://github.com/bristolcrypto/SPDZ-2 ristol Cryptography Group. Multiparty computation with SPDZ MASCOT and Overdrive offline phases https://github.com/bristolcrypto/SPDZ-2

3. Multiparty Computation from Somewhat Homomorphic Encryption

4. High-Throughput Semi-Honest Secure Three-Party Computation with an Honest Majority

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

1. Constant-Round Fair SS-4PC for Private Decision Tree Evaluation;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2022-09-01

2. FedV;Proceedings of the 14th ACM Workshop on Artificial Intelligence and Security;2021-11-15

3. Private Decision Tree Evaluation with Constant Rounds via (Only) Fair SS-4PC;Information Security and Privacy;2021

4. NN-EMD: Efficiently Training Neural Networks using Encrypted Multi-sourced Datasets;IEEE Transactions on Dependable and Secure Computing;2021

5. Private Decision Tree Evaluation with Constant Rounds via (Only) SS-3PC over Ring;Provable and Practical Security;2020