Non-malleable Time-Lock Puzzles and Applications-Reference-Cited by-同舟云学术

Non-malleable Time-Lock Puzzles and Applications

Published:2021 Issue: Volume: Page:447-479
ISSN:0302-9743
Container-title:Theory of Cryptography
language:
Short-container-title:

Author:

Freitag Cody,Komargodski Ilan,Pass Rafael,Sirkin Naomi

Publisher

Springer International Publishing

Link

https://link.springer.com/content/pdf/10.1007/978-3-030-90456-2_15

Reference50 articles.

1. Barak, B.: Constant-round coin-tossing with a man in the middle or realizing the shared random string model. In: 43rd Symposium on Foundations of Computer Science FOCS, pp. 345–355 (2002)

2. Barak, B., Prabhakaran, M., Sahai, A.: Concurrent non-malleable zero knowledge. In: 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 345–354 (2006)

3. Baum, C., David, B., Dowsley, R., Nielsen, J.B., Oechsner, S.: Craft: composable randomness and almost fairness from time. Cryptology ePrint Archive, Report 2020/784 (2020). https://eprint.iacr.org/2020/784

4. Lecture Notes in Computer Science;C Baum,2021

5. Bentov, I., Pass, R., Shi, E.: Snow white: provably secure proofs of stake. IACR Cryptol. ePrint Arch. 2016, 919 (2016)

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

1. Time-Lock Puzzles with Efficient Batch Solving;Lecture Notes in Computer Science;2024

2. CaSCaDE: (Time-Based) Cryptography from Space Communications DElay;Lecture Notes in Computer Science;2024

3. Incremental Time-Deniable Signatures;Lecture Notes in Computer Science;2024

4. Time-Lock Puzzles from Lattices;Lecture Notes in Computer Science;2024

5. Riggs: Decentralized Sealed-Bid Auctions;Proceedings of the 2023 ACM SIGSAC Conference on Computer and Communications Security;2023-11-15