Efficient Multiparty Protocols Using Circuit Randomization-Reference-Cited by-同舟云学术

Efficient Multiparty Protocols Using Circuit Randomization

Published: Issue: Volume: Page:420-432
ISSN:
Container-title:Advances in Cryptology — CRYPTO ’91
language:
Short-container-title:

Author:

Beaver Donald

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-46766-1_34.pdf

Reference15 articles.

1. J. Bar-Ilan, D. Beaver. “Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction.” Proceedings of PODC, ACM, 1989, 201–209.

2. D. Beaver. “Secure Multiparty Protocols and Zero Knowledge Proof Systems Tolerating a Faulty Minority.” To appear, J. Cryptology. An earlier version appeared as “Secure Multiparty Protocols Tolerating Half Faulty Processors.” Proceedings of Crypto 1989, ACM, 1989.

3. D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. PhD Thesis, Harvard University, Cambridge, 1990.

4. D. Beaver, S. Goldwasser. “Multiparty Computation with Faulty Majority.” Proceedings of the 30th FOCS, IEEE, 1989, 468–473.

5. D. Beaver, S. Haber. “Cryptographic Protocols Provably Secure Against Dynamic Adversaries.” Submitted to FOCS 91.

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

1. Multi-Party Privacy-Preserving Faster R-CNN Framework for Object Detection;IEEE Transactions on Emerging Topics in Computational Intelligence;2024-02

2. Secure Dataspace Approach for Interorbital Satellite Links;AIAA SCITECH 2024 Forum;2024-01-04

3. Verifiable Privacy-Preserving Heart Rate Estimation Based on LSTM;IEEE Internet of Things Journal;2024-01-01

4. Secure Approximate Nearest Neighbor Search with Locality-Sensitive Hashing;Computer Security – ESORICS 2023;2024

5. Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC;Computer Security – ESORICS 2023;2024