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

Aggelos Kiayias; Feng-Hao Liu; Yiannis Tselekounis

doi:10.1145/2976749.2978352

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

Aggelos Kiayias, Feng-Hao Liu, Yiannis Tselekounis

Research output: Chapter in Book/Report/Conference proceeding › Conference 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 language	English
Title of host publication	Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security
Place of Publication	New York, NY, USA
Publisher	ACM
Pages	1317-1328
Number of pages	12
ISBN (Print)	978-1-4503-4139-4
DOIs	https://doi.org/10.1145/2976749.2978352
Publication status	Published - 24 Oct 2016
Event	23rd ACM Conference on Computer and Communications Security - Hofburg Palace, Vienna, Austria Duration: 24 Oct 2016 → 28 Oct 2016 https://www.sigsac.org/ccs/CCS2016/index.html https://www.sigsac.org/ccs/CCS2016/

Publication series

Name	CCS '16
Publisher	ACM

Conference

Conference	23rd ACM Conference on Computer and Communications Security
Abbreviated title	ACM CCS 2016
Country	Austria
City	Vienna
Period	24/10/16 → 28/10/16
Internet address	https://www.sigsac.org/ccs/CCS2016/index.html https://www.sigsac.org/ccs/CCS2016/

Access to Document

10.1145/2976749.2978352

p1317-kiayiasFinal published version, 882 KB

http://dl.acm.org/citation.cfm?doid=2976749.2978352

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

1 Finished

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets
Kiayias, A.
EU government bodies
1/09/15 → 31/01/19
Project: Research

Cite this

@inproceedings{66a169695fee4204841cb5b0dbe42758,

title = "Practical Non-Malleable Codes from L-more Extractable Hash Functions",

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).",

author = "Aggelos Kiayias and Feng-Hao Liu and Yiannis Tselekounis",

year = "2016",

month = oct,

day = "24",

doi = "10.1145/2976749.2978352",

language = "English",

isbn = "978-1-4503-4139-4",

series = "CCS '16",

publisher = "ACM",

pages = "1317--1328",

booktitle = "Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security",

note = "23rd ACM Conference on Computer and Communications Security, ACM CCS 2016 ; Conference date: 24-10-2016 Through 28-10-2016",

url = "https://www.sigsac.org/ccs/CCS2016/index.html, https://www.sigsac.org/ccs/CCS2016/",

}

Kiayias, A, Liu, F-H & Tselekounis, Y 2016, Practical Non-Malleable Codes from L-more Extractable Hash Functions. in Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security. CCS '16, ACM, New York, NY, USA, pp. 1317-1328, 23rd ACM Conference on Computer and Communications Security, Vienna, Austria, 24/10/16. https://doi.org/10.1145/2976749.2978352

TY - GEN

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

AU - Kiayias, Aggelos

AU - Liu, Feng-Hao

AU - Tselekounis, Yiannis

PY - 2016/10/24

Y1 - 2016/10/24

N2 - 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).

AB - 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).

U2 - 10.1145/2976749.2978352

DO - 10.1145/2976749.2978352

M3 - Conference contribution

SN - 978-1-4503-4139-4

T3 - CCS '16

SP - 1317

EP - 1328

BT - Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security

PB - ACM

CY - New York, NY, USA

T2 - 23rd ACM Conference on Computer and Communications Security

Y2 - 24 October 2016 through 28 October 2016

ER -

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

Abstract

Publication series

Conference

Access to Document

Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets

Cite this