Fully Distributed Threshold RSA under Standard Assumptions-Reference-Cited by-同舟云学术

Fully Distributed Threshold RSA under Standard Assumptions

Published:2001 Issue: Volume: Page:310-330
ISSN:0302-9743
Container-title:Advances in Cryptology — ASIACRYPT 2001
language:
Short-container-title:

Author:

Fouque Pierre-Alain,Stern Jacques

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-45682-1_19

Reference39 articles.

1. O. Baudron, P.A. Fouque, D. Pointcheval, G. Poupard, and J. Stern. Practical Multi-Candidate Election System. In PODC’ 01. ACM, 2001.

2. M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for noncryptographic fault-tolerant distributed computing. In Proceedings of the 20th STOC, ACM, pages 1–10, 1988.

3. Technical report;S. Blackburn,1998

4. Lect Notes Comput Sci;D. Boneh,1997

5. D. Boneh, M. Malkin, and T. Wu. Experimenting with Shared Generation of RSA keys. In Internet Society’s 1999 Symposium on Network and Distributed System Security (SNDSS), pages 43–56, 1999.

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

1. Decentralized Threshold Signatures With Dynamically Private Accountability;IEEE Transactions on Information Forensics and Security;2024

2. Threshold Signatures with Private Accountability via Secretly Designated Witnesses;Lecture Notes in Computer Science;2024

3. Threshold and Multi-signature Schemes from Linear Hash Functions;Advances in Cryptology – EUROCRYPT 2023;2023

4. Threshold Signatures with Private Accountability;Advances in Cryptology – CRYPTO 2022;2022

5. Framework for practical and receipt‐free remote voting;IET Information Security;2018-07