Filters








143 Hits in 3.4 sec

Key dependent message security

Tal Malkin, Isamu Teranishi, Moti Yung
2011 Proceedings of the first ACM conference on Data and application security and privacy - CODASPY '11  
An encryption scheme is Key Dependent Message (KDM) secure if it is secure even against an attacker who has access to encryptions of messages which depend on the secret key.  ...  In this paper we review the definition, and survey recent results and applications of KDM security.  ...  The second direction considers the more practical side: we want to construct an efficient KDM secure scheme w.r.t. a reasonably large F.  ... 
doi:10.1145/1943513.1943516 dblp:conf/codaspy/MalkinTY11 fatcat:rtkk3y3kbvch7hdhcymuezmmqi

Efficient Circuit-Size Independent Public Key Encryption with KDM Security [chapter]

Tal Malkin, Isamu Teranishi, Moti Yung
2011 Lecture Notes in Computer Science  
We present a construction of an efficient public key encryption scheme which is KDM secure with respect to a large function set F.  ...  Key Dependent Message (KDM) secure encryption is a new area which has attracted much research in recent years.  ...  We also thank Zvika, Shafi Goldwasser, Yael Tauman Kalai, and anonymous Eurocrypt reviewers for helpful comments regarding the presentation of the paper.  ... 
doi:10.1007/978-3-642-20465-4_28 fatcat:ptv5uoy6mzgpraoda4yruf5r7i

Key-Dependent Message Security: Generic Amplification and Completeness [chapter]

Benny Applebaum
2011 Lecture Notes in Computer Science  
As a result, we can amplify the security of all known KDM constructions, including ones that could not be amplified before.  ...  Key-dependent message (KDM) secure encryption schemes provide secrecy even when the attacker sees encryptions of messages related to the secret-key sk.  ...  More precisely, our results hold (i.e., lead to black-box KDM reduction/construction) as long as the security of the encoding reduces to the security of the underlying primitive (i.e., E) via a blackbox  ... 
doi:10.1007/978-3-642-20465-4_29 fatcat:kzgzlwe2anb7nleklbunczb3fe

Key-Dependent Message Security: Generic Amplification and Completeness

Benny Applebaum
2013 Journal of Cryptology  
As a result, we can amplify the security of all known KDM constructions, including ones that could not be amplified before.  ...  Key-dependent message (KDM) secure encryption schemes provide secrecy even when the attacker sees encryptions of messages related to the secret-key sk.  ...  More precisely, our results hold (i.e., lead to black-box KDM reduction/construction) as long as the security of the encoding reduces to the security of the underlying primitive (i.e., E) via a blackbox  ... 
doi:10.1007/s00145-013-9149-6 fatcat:gumfebxpofhrnptgairywq7foq

Encryption Schemes Secure under Related-Key and Key-Dependent Message Attacks [chapter]

Florian Böhl, Gareth T. Davies, Dennis Hofheinz
2014 Lecture Notes in Computer Science  
Our constructions are variants of known KDM-secure public-key encryption schemes.  ...  We construct secret-key encryption (SKE) schemes that are secure against related-key attacks and in the presence of key-dependent messages (RKA-KDM secure).  ...  Furthermore, we would like to thank Viet Tung Hoang for pointing out a more efficient and less complicated way to achieve bounded-KDM security (based on [14] ) than the one we first decided on (based  ... 
doi:10.1007/978-3-642-54631-0_28 fatcat:2dhwbhbxbzbwxgvetmvucy5uru

Garbling XOR Gates "For Free" in the Standard Model [chapter]

Benny Applebaum
2013 Lecture Notes in Computer Science  
As an additional contribution, we prove that the combination of RK and KDM security is non-trivial: There exists an encryption scheme which achieves both RK security and KDM security but breaks completely  ...  (KDM) attacks; and -We show that such a symmetric encryption can be constructed based on the LPN assumption.  ...  yet, based on more general assumptions (e.g., CPA-secure encryption scheme).  ... 
doi:10.1007/978-3-642-36594-2_10 fatcat:tennm3ep3zexfawngfshqkrk7i

Garbling XOR Gates "For Free" in the Standard Model

Benny Applebaum
2015 Journal of Cryptology  
As an additional contribution, we prove that the combination of RK and KDM security is non-trivial: There exists an encryption scheme which achieves both RK security and KDM security but breaks completely  ...  (KDM) attacks; and -We show that such a symmetric encryption can be constructed based on the LPN assumption.  ...  yet, based on more general assumptions (e.g., CPA-secure encryption scheme).  ... 
doi:10.1007/s00145-015-9201-9 fatcat:2bpppivzvfcsdno2gadovzxtea

A Public Key Encryption Scheme Secure against Key Dependent Chosen Plaintext and Adaptive Chosen Ciphertext Attacks [chapter]

Jan Camenisch, Nishanth Chandran, Victor Shoup
2009 Lecture Notes in Computer Science  
However, none of the above notions of security allow an adversary to obtain encryptions of secret keys or, more generally, functions of secret keys.  ...  It was only recently that Boneh et al. [9] gave a construction of a KDM-CPA secure public key encryption scheme. They proved their scheme secure under the Decisional Diffie-Hellman (DDH) assumption.  ...  than in the proof of security), one can simply generate all of the group elements appearing in pk cca at random (yielding a distribution that is statistically close to the real distribution on public keys  ... 
doi:10.1007/978-3-642-01001-9_20 fatcat:mn4ibpbanzcprc6w5z5o3a2inm

KDM-Security via Homomorphic Smooth Projective Hashing [chapter]

Hoeteck Wee
2016 Lecture Notes in Computer Science  
We present new frameworks for constructing public-key encryption schemes satisfying key-dependent message (KDM) security and that yield efficient, universally composable oblivious transfer (OT) protocols  ...  All of these schemes achieve KDM-security w.r.t. the class of affine functions, which can in turn be "boosted" to the class of circuits of a-priori bounded size [5, 3] .  ...  This provides a more direct construction of KDM-security with respect to f 1 , . . . , f t as opposed to the entropic-KDM framework in [11] . On KDM-security with multiple keys.  ... 
doi:10.1007/978-3-662-49387-8_7 fatcat:uidr6j6yf5chjof46lmsg7acmu

A Latticed-Based Public Key Encryption with KDM Security from R-LWE

Yan Fang Wu, Zheng Huang, Qiao Yan Wen
2012 Advanced Engineering Forum  
As well as it can achieve security against certain key-dependent message (KDM) attacks. Namely, this efficient encryption scheme can securely encrypt its own secret key.  ...  Since the introduction of the ring learning with errors (R-LWE) by Lyubashevsky, Peikert and Regev, many efficient and secure applications were founded in cryptography.  ...  It is efficient and enjoys the KDM security.  ... 
doi:10.4028/www.scientific.net/aef.6-7.398 fatcat:dx7aux5tbbg7rg6s5sug5q2bgm

Black-Box Circular-Secure Encryption beyond Affine Functions [chapter]

Zvika Brakerski, Shafi Goldwasser, Yael Tauman Kalai
2011 Lecture Notes in Computer Science  
that is KDM secure w.r.t. a richer class of functions.  ...  We say that an encryption scheme is entropy-k KDM-secure if it is KDM-secure even when the secret key is sampled from an arbitrary distribution with minentropy k, and the computation of the public key  ...  Heitner and Holenstein [HH09] gave impossibility results with regards to black-box constructions of KDM (1) -secure encryption (even in the symmetric case).  ... 
doi:10.1007/978-3-642-19571-6_13 fatcat:y3oeduzsq5dynmpceam3pdzspe

Efficient Lattice-Based Cryptosystems with Key Dependent Message Security

Bo Yang, Ruwei Huang, Jianan Zhao
2021 Applied Sciences  
In addition, this scheme enjoys a high level of efficiency, the cost of encryption and decryption is only ploylog(n) bit operations per message symbol, and we also prove that our scheme is KDM-CPA secure  ...  Key-dependent message (KDM) security is of great research significance, to better analyse and solve the potential security problems in complex application scenarios.  ...  Efficient Circuit-Size Independent Public Key Encryption with KDM Security.  ... 
doi:10.3390/app112412161 fatcat:uijmkhvcc5amvmiyf5knsqrhhu

On Generic Constructions of Circularly-Secure, Leakage-Resilient Public-Key Encryption Schemes [chapter]

Mohammad Hajiabadi, Bruce M. Kapron, Venkatesh Srinivasan
2016 Lecture Notes in Computer Science  
More precisely, our construction transforms a private-key scheme with the stated properties (and one more mild condition) into a public-key one, providing: n-KDM-projection security, an extension of circular  ...  We propose generic constructions of public-key encryption schemes, satisfying keydependent message (KDM) security for projections and different forms of key-leakage resilience, from CPA-secure private  ...  The main question arising from our work is if it is possible to construct circularly-secure encryption from even more general assumptions.  ... 
doi:10.1007/978-3-662-49387-8_6 fatcat:wupsurwerres3hxftchmxzoc5m

Low Noise LPN: KDM Secure Public Key Encryption and Sample Amplification [chapter]

Nico Döttling
2015 Lecture Notes in Computer Science  
Key Dependent Message Security A public key encryption scheme is called key dependent message (KDM) secure, if encryptions of the secret key, or more generally encryptions of functions of several secret  ...  In [8], Applebaum provided a construction of a KDM secure PKE for arbitrary (bounded size) circuits from any KDM secure PKE for affine functions.  ...  KDM Secure Public Key Encryption We will now provide an overview of our construction of a KDM secure public key encryption scheme from LPN.  ... 
doi:10.1007/978-3-662-46447-2_27 fatcat:hzw7ft4vqvapnh2m5l7xh2h73a

Efficient KDM-CCA Secure Public-Key Encryption via Auxiliary-Input Authenticated Encryption

Shuai Han, Shengli Liu, Lin Lyu
2017 Security and Communication Networks  
Using AIAE as an essential building block, we give two constructions of efficient KDM-CCA secure PKE based on the DDH and the Decisional Composite Residuosity (DCR) assumptions.  ...  In this paper, we study the design of KDM-CCA secure PKE. To this end, we develop a new primitive named Auxiliary-Input Authenticated Encryption (AIAE).  ...  Acknowledgments This work was supported by the National Natural Science Foundation of China Grant nos. 61672346 and 61373153. Security and Communication Networks  ... 
doi:10.1155/2017/2148534 fatcat:4ex7honpx5aqnpjtadk4yfr5ey
« Previous Showing results 1 — 15 out of 143 results