Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks-Reference-Cited by-同舟云学术

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

Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks

Published:2010 Issue: Volume: Page:666-684
ISSN:0302-9743
Container-title:Advances in Cryptology – CRYPTO 2010
language:
Short-container-title:

Author:

Bellare Mihir,Cash David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-14623-7_36.pdf

Reference54 articles.

1. Applebaum, B.: Fast cryptographic primitives based on the hardness of decoding random linear code. Technical Report TR-845-08, Princeton University (2008)

2. Lecture Notes in Computer Science;M. Bellare,2006

3. Lecture Notes in Computer Science;M. Bellare,1996

4. Bellare, M., Cash, D.: Pseudorandom functions and permutations provablysecure against related key attacks. Cryptology ePrint Archive (2010) (full version of this abstract)

5. Lecture Notes in Computer Science;M. Bellare,2003

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

1. Symmetric and Dual PRFs from Standard Assumptions: A Generic Validation of a Prevailing Assumption;Journal of Cryptology;2024-08-19

2. Tamper Detection against Unitary Operators;Quantum;2023-11-08

3. Proactive Secret Sharing with Constant Communication;Theory of Cryptography;2023

4. Non-Malleable Functions and their Applications;Journal of Cryptology;2022-03-09

5. Continuously Non-malleable Codes Against Bounded-Depth Tampering;Advances in Cryptology – ASIACRYPT 2022;2022

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

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

www.globalauthorid.com

TOP