Non-Malleable Codes Against Bounded Polynomial Time Tampering

Autor:	Dana Dachman-Soled, Huijia Lin, Marshall Ball, Mukul Kulkarni, Tal Malkin
Rok vydání:	2019
Předmět:	Soundness Discrete mathematics 03 medical and health sciences 0302 clinical medicine 010201 computation theory & mathematics 030220 oncology & carcinogenesis Bounded function Beta (velocity) 0102 computer and information sciences 01 natural sciences Time complexity Mathematics Exponential function
Zdroj:	Advances in Cryptology – EUROCRYPT 2019 ISBN: 9783030176525 EUROCRYPT (1)
Popis:	We construct efficient non-malleable codes (NMC) that are (computationally) secure against tampering by functions computable in any fixed polynomial time. Our construction is in the plain (no-CRS) model and requires the assumptions that (1) \(\mathbf {E}\) is hard for \(\mathbf {NP}\) circuits of some exponential \(2^{\beta n}\) (\(\beta >0\)) size (widely used in the derandomization literature), (2) sub-exponential trapdoor permutations exist, and (3) \(\mathbf {P}\)-certificates with sub-exponential soundness exist.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_________::17fb7379f13967ddab196ef63083e4e8 https://doi.org/10.1007/978-3-030-17653-2_17 Zobrazit plný text záznamu