Projects per year
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).
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 | |
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/Territory | Austria |
City | Vienna |
Period | 24/10/16 → 28/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.Projects
- 1 Finished
-
Panoramix:Privacy and Accountability in Networks via Optimized Randomized Mix-nets
1/09/15 → 31/01/19
Project: Research