Time-Lock Puzzles in the Random Oracle Model-Reference-Cited by-同舟云学术

Time-Lock Puzzles in the Random Oracle Model

Published:2011 Issue: Volume: Page:39-50
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2011
language:
Short-container-title:

Author:

Mahmoody Mohammad,Moran Tal,Vadhan Salil

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-22792-9_3.pdf

Reference25 articles.

1. Abadi, M., Burrows, M., Manasse, M.S., Wobber, T.: Moderately hard, memory-bound functions. ACM Trans. Internet Techn. 5(2), 299–327 (2005)

2. Back, A.: Hashcash — a denial of service counter-measure (2002), http://www.hashcash.org/papers/hashcash.pdf

3. Barak, B., Mahmoody, M.: Lower bounds on signatures from symmetric primitives. In: FOCS 2007, pp. 680–688. IEEE Computer Society, Los Alamitos (2007)

4. Lecture Notes in Computer Science;B. Barak,2009

5. Lecture Notes in Computer Science;E. Biham,2008

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

1. A tamper-resistant timed secure data transmission protocol based on smart contract;Scientific Reports;2023-07-17

2. Sequential Computational Time-Released Encryption Technique Using Variable Time Delay;2023 14th International Conference on Computing Communication and Networking Technologies (ICCCNT);2023-07-06

3. SoK: Delay-Based Cryptography;2023 IEEE 36th Computer Security Foundations Symposium (CSF);2023-07

4. Communication Lower Bounds of Key-Agreement Protocols via Density Increment Arguments;Theory of Cryptography;2023

5. Completeness Theorems for Adaptively Secure Broadcast;Advances in Cryptology – CRYPTO 2023;2023