Improved, black-box, non-malleable encryption from semantic security

• Published in: Designs, codes, and cryptography Vol. 86; no. 3; pp. 641 - 663
• Main Authors: Choi, Seung Geol, Dachman-Soled, Dana, Malkin, Tal, Wee, Hoeteck
• Format: Journal Article
• Language: English
• Published: New York Springer US 01-03-2018; Springer Nature B.V
• Subjects: Circuits; Codes; Coding and Information Theory; Computer Science; Cryptology; Data Structures and Information Theory; Discrete Mathematics in Computer Science; Encryption; Error correcting codes; Error correction; Information and Communication; Public-key encryption; Black-box construction; 68P25; Non-malleable encryption; 94A60
• ISSN: 0925-1022; 1573-7586
• DOI: 10.1007/s10623-017-0348-2

We give a new black-box transformation from any semantically secure encryption scheme into a non-malleable one which has a better rate than the best previous work of Coretti et al. (in: Kushilevitz and Malkin (eds) TCC 2016-A, Part I, Springer, Heidelberg,
2016
). We achieve a better rate by departing from the “matrix encoding” methodology used by previous constructions, and working directly with a single codeword. We also use a Shamir secret-share packing technique to improve the rate of the underlying error-correcting code.