.png){kind=icon}
返回
Committed-programming reductions: formalizations, implications and relations
.png){kind=icon}
PRE
AI
DOI：10.1007/s11432-022-3893-3.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this work, we introduce a class of black-box (BB) reductions called committed-programming reduction (CPRed) in the random oracle model (ROM) and obtain the following interesting results: (1) we demonstrate that some well-known schemes, including the full-domain hash (FDH) signature (Eurocrypt 1996) and the Boneh-Franklin identity-based encryption (IBE) scheme (Crypto 2001), are provably secure under CPReds; (2) we prove that a CPRed associated with an instance-extraction algorithm implies a reduction in the quantum ROM (QROM). This unifies several recent results, including the security of the Gentry-Peikert-Vaikuntanathan IBE scheme by Zhandry (Crypto 2012) and the key encapsulation mechanism (KEM) variants using the Fujisaki-Okamoto transform by Jiang et al. (Crypto 2018) in the QROM. Finally, we show that CPReds are incomparable to non-programming reductions (NPReds) and randomly-programming reductions (RPReds) formalized by Fischlin et al. (Asiacrypt 2010).
Keyword:
provable security
random oracle model
quantum random oracle model
black-box reduction/separation
programmability
期刊
IF:
7.6
论文数:
4.9K
被引数:
8.9K
机构
查看更多机构
引用论文
.png){kind=icon}
Looking Deeply In: Using Photo-Elicitation to Explore the Meanings of Outdoor Education Experiences
PREAI
分享收藏First-Principles Simulations of Liquid Water Using a Dielectric-Dependent Hybrid Functional使用介电相关的混合泛函对液态水进行第一性原理模拟
PREAI
分享收藏 没有更多内容