Practical Non-Malleable Codes from L-more Extractable Hash Functions

Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this work, we significantly improve the efficiency of non-malleable codes in the split state model, by constructing a code with codeword length (roughly), where |s| is the length of the message, and k is the security parameter. This is a substantial improvement over previous constructions, both asymptotically and concretely.

Our construction relies on a new primitive which we define and study, called l-more extractable hash functions. This notion, which may be of independent interest, is strictly stronger than the previous notion of extractable hash by Goldwasser et al. (Eprint '11) and Bitansky et al. (ITCS '12, Eprint '14), yet we can instantiate it under the same assumption used for the previous extractable hash function (a variant of the Knowledge of Exponent Assumption).
Original languageEnglish
Title of host publicationProceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Place of PublicationNew York, NY, USA
PublisherACM
Pages1317-1328
Number of pages12
ISBN (Print)978-1-4503-4139-4
DOIs
Publication statusPublished - 24 Oct 2016
Event23rd ACM Conference on Computer and Communications Security - Hofburg Palace, Vienna, Austria
Duration: 24 Oct 201628 Oct 2016
https://www.sigsac.org/ccs/CCS2016/index.html
https://www.sigsac.org/ccs/CCS2016/

Publication series

NameCCS '16
PublisherACM

Conference

Conference23rd ACM Conference on Computer and Communications Security
Abbreviated titleACM CCS 2016
CountryAustria
CityVienna
Period24/10/1628/10/16
Internet address

Fingerprint Dive into the research topics of 'Practical Non-Malleable Codes from L-more Extractable Hash Functions'. Together they form a unique fingerprint.

Cite this