Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
Resisting Randomness Subversion: Fast Deterministic and Hedged Public-Key Encryption in the Standard Model
复制标题
DOI：
10.1007/978-3-662-46803-6_21
复制
发表时间：
2015-04
期刊：
影响因子：
--
通讯作者：
M. Bellare;V. Hoang
中科院分区：
文献类型：
--
作者：
M. Bellare;V. Hoang
本文首次提出了一种高效的、标准模型的、完全可实现的公钥加密（PKE）方案，即确定型和对冲型PKE方案。这些形式的PKE抵御颠覆的随机数生成器，结束了新的紧迫性，最近的启示的性质和程度，这样的subversion.We解决（公认的）技术挑战，通过一个新的范式，结合UCE（通用计算提取器）与LTDFs（有损陷门函数）达到这些目标。至关重要的是，我们只依赖于弱形式的UCE，即统计（而不是计算）不可预测来源的安全性。然后，我们定义并实现唯一密文PKE作为一种方法来抵御实现颠覆通过算法替换攻击。
This paper provides the firstefficient,standard-model,fully-secureschemes for some related and challenging forms of public-key encryption (PKE), namely deterministic and hedged PKE. These forms of PKE defend against subversion of random number generators, an end given new urgency by recent revelations on the nature and extent of such subversion.We resolve the (recognized) technical challenges in reaching these goals via a new paradigm that combines UCEs (universal computational extractors) with LTDFs (lossy trapdoor functions). Crucially, we rely only on a weak form of UCE, namely security for statistically (rather than computationally) unpredictable sources. We then define and achieve unique-ciphertext PKE as a way to defend against implementation subversion via algorithm-substitution attacks.