搜索结果: 1-5 共查到“密码学 Deterministic Encryption”相关记录5条 . 查询时间(0.109 秒)
The Local Forking Lemma and its Application to Deterministic Encryption
Deterministic public-key encryption searchable encryption forking lemma
<
2019/9/16
We bypass impossibility results for the deterministic encryption of public-key-dependent messages, showing that, in this setting, the classical Encrypt-with-Hash scheme provides message-recovery secur...
On ELFs, Deterministic Encryption, and Correlated-Input Security
deterministic public key encryption lossy functions
<
2019/2/28
We construct deterministic public key encryption secure for any constant number of arbitrarily correlated computationally unpredictable messages. Prior works required either random oracles or non-stan...
How Secure is Deterministic Encryption?
Deterministic public-key encryption random-oracle model selective-opening attack
<
2016/1/9
It would appear to be a triviality, for any primitive, that security in the standard model implies
security in the random-oracle model, and it is certainly true, and easily proven, for R-PKE.
For D-...
On Notions of Security for Deterministic Encryption,and Efficient Constructions without Random Oracles
Public-key encryption deterministic encryption lossy trapdoor functions
<
2009/6/5
The study of deterministic public-key encryption was initiated by Bellare et al. (CRYPTO ’07),
who provided the “strongest possible” notion of security for this primitive (called PRIV) and constructi...
Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
Deterministic Encryption Definitional Equivalences Random Oracles
<
2009/6/5
We strengthen the foundations of deterministic public-key encryption via definitional equivalences
and standard-model constructs based on general assumptions. Specifically we consider seven notions o...