Asynchronous Computational VSS with Reduced Communication Complexity-Reference-Cited by-同舟云学术

Asynchronous Computational VSS with Reduced Communication Complexity

Published:2013 Issue: Volume: Page:259-276
ISSN:0302-9743
Container-title:Topics in Cryptology – CT-RSA 2013
language:
Short-container-title:

Author:

Backes Michael,Datta Amit,Kate Aniket

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-36095-4_17

Reference25 articles.

1. Abraham, I., Dolev, D., Halpern, J.Y.: An Almost-surely Terminating Polynomial Protocol for Asynchronous Byzantine Agreement with Optimal Resilience. In: Proceedings of ACM PODC 2008, pp. 405–414 (2008)

2. Lecture Notes in Computer Science;M.H. Au,2008

3. Backes, M., Datta, A., Kate, A.: Asynchronous Computational VSS with Reduced Communication Complexity. Cryptology ePrint Archive, Report 2012/619 (2012), http://eprint.iacr.org/2012/619

4. Lecture Notes in Computer Science;M. Backes,2011

5. Ben-Or, M., Canetti, R., Goldreich, O.: Asynchronous Secure Computation. In: Proceedings of ACM STOC 1993, pp. 52–61 (1993)

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

1. Blockchain-Based Privacy-Preserving Authentication With Hierarchical Access Control Using Polynomial Commitment for Mobile Cloud Computing;IEEE Internet of Things Journal;2024-05-15

2. Almost-surely terminating asynchronous Byzantine agreement against general adversaries with optimal resilience;Theoretical Computer Science;2024-05

3. Greyhound: Fast Polynomial Commitments from Lattices;Lecture Notes in Computer Science;2024

4. Scalable Multi-domain Trust Infrastructures for Segmented Networks;2023 IEEE 28th International Workshop on Computer Aided Modeling and Design of Communication Links and Networks (CAMAD);2023-11-06

5. Private Polynomial Commitments and Applications to MPC;Lecture Notes in Computer Science;2023