| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 10331922 | Information Processing Letters | 2015 | 4 Pages |
Abstract
Our result resolves one of the two main open questions in [1]. It improves the rate of non-malleable codes against affine tampering over Fp from logâ¡logâ¡p to a constant, and consequently the rate for non-malleable codes against split-state tampering for n-bit messages is improved from n6log7â¡n to n6.
Keywords
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Divesh Aggarwal,