Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Sustained Space and Cumulative Complexity Trade-Offs for Data-Dependent Memory-Hard Functions

Published:2022 Issue: Volume: Page:222-251
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2022
language:
Short-container-title:

Author:

Blocki Jeremiah^ORCID,Holman Blake^ORCID

Publisher

Springer Nature Switzerland

Link

https://link.springer.com/content/pdf/10.1007/978-3-031-15982-4_8

Reference19 articles.

1. Password hashing competition (2015). https://www.password-hashing.net/

2. Lecture Notes in Computer Science;J Alwen,2016

3. Alwen, J., Blocki, J., Harsha, B.: Practical graphs for optimal side-channel resistant memory-hard functions. In: Thuraisingham, B.M., Evans, D., Malkin, T., Xu, D. (eds.) ACM CCS 2017: 24th Conference on Computer and Communications Security, 31 October–2 November 2017, pp. 1001–1017. ACM Press (2017)

4. Lecture Notes in Computer Science;J Alwen,2017

5. Lecture Notes in Computer Science;J Alwen,2018

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

1. Trapdoor Memory-Hard Functions;Lecture Notes in Computer Science;2024

2. Computationally Relaxed Locally Decodable Codes, Revisited;2023 IEEE International Symposium on Information Theory (ISIT);2023-06-25

3. Lower Bounds for the Number of Decryption Updates in Registration-Based Encryption;Theory of Cryptography;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP