New Constructions of Hinting PRGs, OWFs with Encryption, and more
New Constructions of Hinting PRGs, OWFs with Encryption, and more
复制标题
提示 PRG、带加密的 OWF 等的新构造
DOI：
10.1007/978-3-030-56784-2_18
复制
发表时间：
2020
期刊：
影响因子：
--
通讯作者：
Waters, Brent
中科院分区：
文献类型：
--
作者：
Goyal, Risha;Vusirikala, Satyanarayana;Waters, Brent
在过去的几年中，由于Cho等人最近在工作中引入了一个漂亮的框架，出现了大量新的密码学结果，包括简洁的无关转移[13,16],（匿名/分层）基于身份的加密[9]，陷阱门函数[19,20]，选择的密文安全转换[32,33]，指定验证者零知识证明[30,34,37][13]，Döttling和Garg[14]。单向函数加密原语（OWFE）[19,20]及其相关原语（变色龙加密、一次性签名加密、暗示PRGs、trapdoor散列加密、批处理加密）[9,14,16,17,33]是所有这些结果的核心。虽然从CDH、保理和LWE等各种假设中存在OWFE（及其相关）的多种实现，但所有这些构造都属于相同的一般“缺失块”框架[13,14]。尽管这个框架通过对OWFE（及其相关物）的抽象开辟了通往各种加密功能的新途径，但它也伴随着不受欢迎的低效率，这可能会阻碍在许多实际场景中更广泛的采用。在OWFE抽象（及其相关概念）重要性激增的推动下，一个自然的问题是，现有的方法是否可以多样化，不仅可以从不同的假设中获得更多的结构，而且还可以开发更新的框架。我们相信，回答这个问题将最终导致在这种新型加密范式的总体应用中进行重要的、以前未被探索的性能权衡。在这项工作中，我们提出了一个新的累积式框架来构建一个新的OWFE类，并提示PRG结构，特别关注实现更短的密文大小和更短的公共参数大小（分别）。这样的性能改进有助于缩短相应应用程序中的参数。简而言之，我们探讨了以下性能权衡-(1)对于OWFE，我们的结构在密文大小和加密时间方面优于其他结构，但这是以更大的评估和设置时间为代价的；(2)对于暗示PRGs，我们的结构在评估时间与参数大小之间提供了相当显著的权衡，我们的结构导致显着缩短公共参数大小。我们提示的PRG构建所带来的权衡也会在b[33]中提供的cpa到cca转换中产生有趣的影响。我们还为我们的结构提供具体的性能测量，并将其与现有方法进行比较。我们相信强调这样的权衡将导致在实际意义上更广泛地采用这些抽象。
Over the last few years, there has been a surge of new cryptographic results, including laconic oblivious transfer [13, 16], (anonymous/ hierarchical) identity-based encryption [9], trapdoor functions [19, 20], chosen-ciphertext security transformations [32, 33], designated-verifier zero-knowledge proofs [30, 34, 37], due to a beautiful framework recently introduced in the works of Cho et al. [13], and Döttling and Garg [14]. The primitive of one-way function with encryption (OWFE) [19, 20] and its relatives (chameleon encryption, one-time signatures with encryption, hinting PRGs, trapdoor hash encryption, batch encryption) [9, 14, 16, 17, 33] have been a centerpiece in all these results.While there exist multiple realizations of OWFE (and its relatives) from a variety of assumptions such as CDH, Factoring, and LWE, all such constructions fall under the same general “missing block” framework [13, 14]. Although this framework has been instrumental in opening up a new pathway towards various cryptographic functionalities via the abstraction of OWFE (and its relatives), it has been accompanied by undesirable inefficiencies that might inhibit a much wider adoption in many practical scenarios. Motivated by the surging importance of the OWFE abstraction (and its relatives), a natural question to ask is whether the existing approaches can be diversified to not only obtain more constructions from different assumptions, but also in developing newer frameworks. We believe answering this question will eventually lead to important and previously unexplored performance trade-offs in the overarching applications of this novel cryptographic paradigm.In this work, we propose a newaccumulation-styleframework for building a new class of OWFE as well as hinting PRG constructions with a special focus on achieving shorter ciphertext size and shorter public parameter size (respectively). Such performance improvements parlay into shorter parameters in their corresponding applications. Briefly, we explore the following performance trade-offs—(1) for OWFE, our constructions outperform in terms of ciphertext size as well as encryption time, but this comes at the cost of larger evaluation and setup times, (2) for hinting PRGs, our constructions provide a rather dramatic trade-off between evaluation time versus parameter size, with our construction leading to significantly shorter public parameter size. The trade-off enabled by our hinting PRG construction also leads to interesting implications in the CPA-to-CCA transformation provided in [33]. We also provide concrete performance measurements for our constructions and compare them with existing approaches. We believe highlighting such trade-offs will lead to a wider adoption of these abstractions in a practical sense.
登录
查看更多内容
来自 Laconic Oblivious Transfer 的自适应乱码 RAM
DOI：
10.1007/978-3-319-96878-0_18
发表时间：
2018
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Sanjam Garg;R. Ostrovsky;Akshayaram Srinivasan
通讯作者：
Akshayaram Srinivasan
具有结构化秘密的对称原语
DOI：
10.1007/978-3-030-26948-7_23
发表时间：
2019
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Navid Alamati;H. Montgomery;Sikhar Patranabis
通讯作者：
Sikhar Patranabis
具有近乎最佳在线复杂性的自适应安全乱码
DOI：
10.1007/978-3-319-78375-8_18
发表时间：
2018
期刊：
IACR Cryptol. ePrint Arch.
影响因子：
--
作者：
Sanjam Garg;Akshayaram Srinivasan
通讯作者：
Akshayaram Srinivasan
DOI：
10.1007/978-3-662-46494-6_24
发表时间：
2015-03
期刊：
--
影响因子：
--
作者：
B. Hemenway;R. Ostrovsky;Alon Rosen
通讯作者：
B. Hemenway;R. Ostrovsky;Alon Rosen
可重复使用的指定验证者 NIZK 的新结构
DOI：
10.1007/978-3-030-26954-8_22
发表时间：
2019
期刊：
Graduate Studies in Mathematics
影响因子：
--
作者：
Alex Lombardi;Willy Quach;Ron D. Rothblum;Daniel Wichs;David J. Wu
通讯作者：
David J. Wu