TY - CHAP
T1 - Black-Box Construction of a Non-malleable Encryption Scheme from Any Semantically Secure One
T2 - Theory of Cryptography
Y1 - 2008
A1 - Choi, Seung Geol
A1 - Dana Dachman-Soled
A1 - Malkin, Tal
A1 - Wee, Hoeteck
ED - Canetti, Ran
KW - Algorithm Analysis and Problem Complexity
KW - black-box constructions
KW - computers and society
KW - Data Encryption
KW - Discrete Mathematics in Computer Science
KW - Management of Computing and Information Systems
KW - non-malleability
KW - public-key encryption
KW - semantic security
KW - Systems and Data Security
AB - We show how to transform any semantically secure encryption scheme into a non-malleable one, with a black-box construction that achieves a quasi-linear blow-up in the size of the ciphertext. This improves upon the previous non-black-box construction of Pass, Shelat and Vaikuntanathan (Crypto ’06). Our construction also extends readily to guarantee non-malleability under a bounded-CCA2 attack, thereby simultaneously improving on both results in the work of Cramer et al. (Asiacrypt ’07). Our construction departs from the oft-used paradigm of re-encrypting the same message with different keys and then proving consistency of encryptions; instead, we encrypt an encoding of the message with certain locally testable and self-correcting properties. We exploit the fact that low-degree polynomials are simultaneously good error-correcting codes and a secret-sharing scheme.
JA - Theory of Cryptography
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-540-78523-1, 978-3-540-78524-8
UR - http://link.springer.com/chapter/10.1007/978-3-540-78524-8_24
ER -