Towards Optimal and Efficient Perfectly Secure Message Transmission-Reference-Cited by-同舟云学术

Towards Optimal and Efficient Perfectly Secure Message Transmission

Published: Issue: Volume: Page:311-322
ISSN:
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Fitzi Matthias,Franklin Matthew,Garay Juan,Vardhan S. Harsha

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-70936-7_17.pdf

Reference20 articles.

1. Lecture Notes in Computer Science;S. Agarwal,2006

2. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the 2nd ACM Symposium on Principles of Distributed Computing (PODC ’83), pp. 17–19. ACM Press, New York (1983)

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing (STOC ’88), pp. 1–10. Springer, Heidelberg (1988)

4. Berlekamp, E., Welch, L.: Error correction of algebraic block codes. US Patent 4,633,470

5. Berman, P., Garay, J.A., Perry, K.J.: Bit optimal distributed consensus. In: Computer Science Research, pp. 313–322. Plenum Publishing Corporation, New York (1992)

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

1. Perfectly Secure Message Transmission;Encyclopedia of Cryptography, Security and Privacy;2024

2. Must the Communication Graph of MPC Protocols be an Expander?;Journal of Cryptology;2023-05-10

3. $$\text {Muckle}+$$: End-to-End Hybrid Authenticated Key Exchanges;Post-Quantum Cryptography;2023

4. How to Recover a Secret with O(n) Additions;Advances in Cryptology – CRYPTO 2023;2023

5. Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority;Advances in Cryptology – CRYPTO 2022;2022