Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices-Reference-Cited by-同舟云学术

Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices

Published:2024 Issue: Volume: Page:425-458
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:en
Short-container-title:

Author:

Espitau Thomas^ORCID,Niot Guilhem^ORCID,Prest Thomas^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-68394-7_14

Reference29 articles.

1. Agrawal, S., Stehlé, D., Yadav, A.: Round-optimal lattice-based threshold signatures, revisited. In: Bojanczyk, M., Merelli, E., Woodruff, D.P. (eds.) ICALP 2022. LIPIcs, vol. 229, pp. 1–20. Schloss Dagstuhl (Jul 2022). https://doi.org/10.4230/LIPIcs.ICALP.2022.8

2. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169–203 (2015). http://www.degruyter.com/view/j/jmc.2015.9.issue-3/jmc-2015-0016/jmc-2015-0016.xml

3. Atapoor, S., Baghery, K., Cozzo, D., Pedersen, R.: VSS from distributed ZK proofs and applications. In: Guo, J., Steinfeld, R. (eds.) Advances in Cryptology – ASIACRYPT 2023: 29th International Conference on the Theory and Application of Cryptology and Information Security, Guangzhou, China, December 4–8, 2023, Proceedings, Part I, pp. 405–440. Springer Nature Singapore, Singapore (2023). https://doi.org/10.1007/978-981-99-8721-4_13

4. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: 20th ACM STOC, pp. 1–10. ACM Press (May 1988). https://doi.org/10.1145/62212.62213

5. Jacobson, Michael, Locasto, Michael, Mohassel, Payman, Safavi-Naini, Reihaneh (eds.): Applied Cryptography and Network Security: 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceedings. Springer Berlin Heidelberg, Berlin, Heidelberg (2013)