Capacity of non-malleable codes
- Submitting institution
-
Imperial College of Science, Technology and Medicine
- Unit of assessment
- 11 - Computer Science and Informatics
- Output identifier
- 2135
- Type
- D - Journal article
- DOI
-
10.1109/TIT.2015.2511784
- Title of journal
- IEEE Transactions on Information Theory
- Article number
- 3
- First page
- 1097
- Volume
- 62
- Issue
- 3
- ISSN
- 1557-9654
- Open access status
- Out of scope for open access requirements
- Month of publication
- December
- Year of publication
- 2015
- URL
-
-
- Supplementary information
-
10.1109/TIT.2015.2511784
- Request cross-referral to
- -
- Output has been delayed by COVID-19
- No
- COVID-19 affected output statement
- -
- Forensic science
- No
- Criminology
- No
- Interdisciplinary
- No
- Number of additional authors
-
1
- Research group(s)
-
-
- Citation count
- 7
- Proposed double-weighted
- No
- Reserve for an output with double weighting
- No
- Additional information
- Non-malleable (NM) codes are a main cryptographic primitive used to secure cryptosystems against tampering (CCA2) attacks. This is the first work to detail NM code redundancy and to provide efficient optimal construction in the random oracle model. The paper is an extension of our highly-cited ITCS 2014 paper (https://doi.org/10.1145/2554797.2554814) and also cited by Wikipedia on NM codes (https://en.wikipedia.org/wiki/Non-malleable_code).
- Author contribution statement
- -
- Non-English
- No
- English abstract
- -
