搜索结果: 1-15 共查到“军事学 Key-Dependent”相关记录18条 . 查询时间(0.087 秒)
CCA Security and Trapdoor Functions via Key-Dependent-Message Security
chosen ciphertext security trapdoor functions key dependent message security
2019/3/20
We study the relationship among public-key encryption (PKE) satisfying indistinguishability against chosen plaintext attacks (IND-CPA security), that against chosen ciphertext attacks (IND-CCA securit...
Key-dependent cube attack on reduced Frit permutation in Duplex-AE modes
Frit Duplex authenticated encryption mode Key-dependent cube attack
2019/2/25
Frit is a new lightweight 384-bit cryptographic permutation proposed by Simon et al., which is designed for resisting fault injection and performs competitively in both hardware and software. Dobrauni...
Towards Key-Dependent Integral and Impossible Differential Distinguishers on 5-Round AES
AES Key-Dependent Integral
2018/8/10
Reduced-round AES has been a popular underlying primitive to design new cryptographic schemes and thus its security including distinguishing properties deserves more attention. At Crypto'16, a key-dep...
Key Dependent Message Security and Receiver Selective Opening Security for Identity-Based Encryption
Identity-based encryption Key dependent message security Receiver selective opening security
2017/10/10
We construct two identity-based encryption (IBE) schemes. The first one is IBE satisfying key dependent message (KDM) security for user secret keys. The second one is IBE satisfying simulation-based r...
New Constructions of Identity-Based and Key-Dependent Message Secure Encryption Schemes
KDM security IBE LPN
2017/10/9
Finally, we show that the notion of one-time signatures with encryption is also useful for the construction of key-dependent-message (KDM) secure public-key encryption. In particular, our results impl...
Security of Even--Mansour Ciphers under Key-Dependent Messages
Even--Mansour KDM security Ideal Cipher
2017/5/31
The iterated Even--Mansour (EM) ciphers form the basis of many block cipher designs. Several results have established their security in the CPA/CCA models, under related-key attacks, and in the indiff...
On the Key Dependent Message Security of the Fujisaki-Okamoto Constructions
public key encryption key dependent message security chosen ciphertext security
2016/3/7
In PKC 1999, Fujisaki and Okamoto showed how to convert any public key encryption
(PKE) scheme secure against chosen plaintext attacks (CPA) to a PKE scheme which is secure against
chosen ciphertext...
TOWARDS THE GENERATION OF A DYNAMIC KEY-DEPENDENT S-BOX TO ENHANCE SECURITY
Hamming weight Hamming Distance confidentiality
2016/1/4
Secure transmission of message was the concern of early men. Several techniques have been developed ever since
to assure that the message is understandable only by the sender and the receiver while i...
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
Authenticated encryption symmetric encryption random oracles
2012/3/28
This paper provides a comprehensive treatment of the security of authenticated encryption (AE) in the presence of key-dependent data, considering the four variants of the goal arising from the choice ...
Authenticated and Misuse-Resistant Encryption of Key-Dependent Data
Authenticated encryption symmetric encryption random oracles
2011/6/9
This paper provides a comprehensive treatment of the security of authenticated encryption (AE) in the presence of key-dependent data, considering the four variants of the goal arising from the choice ...
Key-Dependent Message Security: Generic Amplification and Completeness Theorems
Key-dependent message cyclic-security randomized encoding
2010/10/11
In this work, we prove the first \emph{generic} KDM amplification theorem which relies solely on the KDM security of the underlying scheme without making any other assumptions. Specifically, we show t...
On the Equivalence of Two Models for Key-Dependent-Message Encryption
Equivalence Models Key-Dependent-Message Encryption
2009/12/29
In this paper, we show that the security models for key-dependent-message
encryption proposed by Backes et al. [1] and Camenisch et al. [3] are equivalent for certain
classes of function families.
Bounded Key-Dependent Message Security
KDM/clique/circular security fully homomorphic encryption formal security
2009/11/18
We construct the first public-key encryption scheme that is proven secure (in the standard
model, under standard assumptions) even when the attacker gets access to encryptions
of arbitrary efficient...
A public key encryption scheme secure against key dependent chosen plaintext and adaptive chosen ciphertext attacks
public key encryption scheme plaintext ciphertext attacks
2009/6/9
Recently, at Crypto 2008, Boneh, Halevi, Hamburg, and Ostrovsky (BHHO) solved the longstanding
open problem of "circular encryption," by presenting a public key encryption scheme
and proving that it...
On the (Im)Possibility of Key Dependent Encryption
Key-dependent input Black-box separations One-way functions
2009/6/3
We study the possibility of constructing encryption schemes secure under messages that are chosen
depending on the key k of the encryption scheme itself. We give the following separation results that...