Comment
Author: Admin | 2025-04-28
2018-21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings, Part II, Michel Abdalla and Ricardo Dahab (Eds.). Lecture Notes in Computer Science, Vol. 10770. Springer, 465–495. DOI:[43]Juan A. Garay, Aggelos Kiayias, and Giorgos Panagiotakos. 2017. Consensus from Signatures of Work. Cryptology ePrint Archive, Report 2017/775. (2017). Retrieved from https://eprint.iacr.org/2017/775[44]Juan A. Garay, Aggelos Kiayias, and Giorgos Panagiotakos. 2019. Iterated Search Problems and Blockchain Security under Falsifiable Assumptions. Cryptology ePrint Archive, Report 2019/315. (2019). Retrieved from https://eprint.iacr.org/2019/315[45]Peter Gazi, Aggelos Kiayias, and Alexander Russell. 2020. Tight consistency bounds for bitcoin. In Proceedings of the CCS’20: 2020 ACM SIGSAC Conference on Computer and Communications Security, Jay Ligatti, Xinming Ou, Jonathan Katz, and Giovanni Vigna (Eds.). ACM, 819–838. DOI:[46]Oded Goldreich, Silvio Micali, and Avi Wigderson. 1987. How to play any mental game or a completeness theorem for protocols with honest majority. In Proceedings of the 19th Annual ACM Symposium on Theory of Computing. ACM, 218–229.[47]Martin Hirt and Vassilis Zikas. 2010. Adaptively secure broadcast. In Proceedings of the Advances in Cryptology - EUROCRYPT 2010, 29th Annual International Conference on the Theory and Applications of Cryptographic Techniques. Proceedings, Henri Gilbert (Ed.). Lecture Notes in Computer Science, Vol. 6110. Springer, 466–485. DOI:[48]Ari Juels and John G. Brainard. 1999. Client puzzles: A cryptographic countermeasure against connection depletion attacks. In Proceedings of the Network and Distributed System Security Symposium. The Internet Society.[49]Jonathan Katz and Chiu-Yuen Koo. 2009. On expected constant-round protocols for Byzantine agreement. Journal of Computer and System Sciences 75, 2 (2009), 91–112. DOI:[50]Jonathan Katz, Ueli Maurer, Björn Tackmann, and Vassilis Zikas. 2013. Universally composable synchronous computation. In Proceedings of the 10th Theory of Cryptography Conference on Theory of Cryptography. 477–498. DOI:[51]Aggelos Kiayias and Giorgos Panagiotakos. 2015. Speed-security tradeoffs in blockchain protocols. IACR Cryptology ePrint Archive 2015 (2015), 1019. Retrieved from http://eprint.iacr.org/2015/1019[52]Aggelos Kiayias and Giorgos Panagiotakos. 2016. On trees, chains and fast transactions in the blockchain. IACR Cryptology ePrint Archive 2016 (2016), 545. Retrieved from http://eprint.iacr.org/2016/545[53]Aggelos Kiayias, Alexander Russell, Bernardo David, and Roman Oliynykov. 2017. Ouroboros: A provably secure proof-of-stake blockchain protocol. In Proceedings of the Advances in Cryptology - CRYPTO 2017-37th Annual International Cryptology Conference, Proceedings, Part I (Lecture Notes in Computer Science), Jonathan Katz and Hovav Shacham (Eds.). Vol. 10401. Springer, 357–388. DOI:[54]Aggelos Kiayias, Hong-Sheng Zhou, and Vassilis Zikas. 2016. Fair and robust multi-party computation using a global transaction ledger. In Advances in Cryptology - EUROCRYPT 2016-35th Annual International Conference on the Theory and
Add Comment