zbMATH — the first resource for mathematics

Chosen-ciphertext security via correlated products. (English) Zbl 1213.94130
Reingold, Omer (ed.), Theory of cryptography. 6th theory of cryptography conference, TCC 2009, San Francisco, CA, USA, March 15–17, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00456-8/pbk). Lecture Notes in Computer Science 5444, 419-436 (2009).
Summary: We initiate the study of one-wayness under correlated products. We are interested in identifying necessary and sufficient conditions for a function \(f\) and a distribution on inputs (\(x _{1}, \dots , x _{k })\), so that the function \((f(x _{1}), \dots , f(x _{k }))\) is one-way. The main motivation of this study is the construction of public-key encryption schemes that are secure against chosen-ciphertext attacks (CCA). We show that any collection of injective trapdoor functions that is secure under a very natural correlated product can be used to construct a CCA-secure encryption scheme. The construction is simple, black-box, and admits a direct proof of security.
We provide evidence that security under correlated products is achievable by demonstrating that lossy trapdoor functions yield injective trapdoor functions that are secure under the above mentioned correlated product. Although we currently base security under correlated products on existing constructions of lossy trapdoor functions, we argue that the former notion is potentially weaker as a general assumption. Specifically, there is no fully-black-box construction of lossy trapdoor functions from trapdoor functions that are secure under correlated products.
For the entire collection see [Zbl 1156.94005].

94A60 Cryptography
Full Text: DOI