Your browser does not fully support modern features. Please upgrade for a smoother experience.
Submitted Successfully!
Thank you for your contribution! You can also upload a video entry or images related to this topic. For video creation, please contact our Academic Video Service.
Version Summary Created by Modification Content Size Created at Operation
1 handwiki Vivi Li -- 1868 2022-11-11 01:32:58

Video Upload Options

We provide professional Academic Video Service to translate complex research into visually appealing presentations. Would you like to try it?
No, upload directly Yes
Cite
If you have any further questions, please contact Encyclopedia Editorial Office.
HandWiki. Non-Malleable Codes. Encyclopedia. Available online: https://encyclopedia.pub/entry/34157 (accessed on 22 September 2026).
HandWiki. Non-Malleable Codes. Encyclopedia. Available at: https://encyclopedia.pub/entry/34157. Accessed September 22, 2026.
HandWiki. "Non-Malleable Codes" Encyclopedia, https://encyclopedia.pub/entry/34157 (accessed September 22, 2026).
HandWiki. (2022, November 11). Non-Malleable Codes. In Encyclopedia. https://encyclopedia.pub/entry/34157
HandWiki. "Non-Malleable Codes." Encyclopedia. Web. 11 November, 2022.
Non-Malleable Codes
Edit
The content is sourced from: https://handwiki.org/wiki/Non-malleable_codes

The notion of non-malleable codes was introduced in 2010 by Dziembowski, Pietrzak, and Wichs, for relaxing the notion of error-correction and error-detection. Informally, a code is non-malleable if the message contained in a modified code-word is either the original message, or a completely unrelated value. Non-malleable codes provide a useful and meaningful security guarantee in situations where traditional error-correction and error-detection is impossible; for example, when the attacker can completely overwrite the encoded message. Although such codes do not exist if the family of "tampering functions" F is completely unrestricted, they are known to exist for many broad tampering families F.

non-malleable error-detection error-correction

References

  1. Faust, Sebastian; Mukherjee, Pratyay; Venturi, Daniele; Wichs, Daniel. "Efficient Non-Malleable Codes and Key-Derivation for Poly-Size Tampering Circuits". Advances in Cryptology – EUROCRYPT 2014 8441: 111–128. http://infoscience.epfl.ch/record/198993/files/Efficient_Non-Malleable_Codes.pdf. 
  2. E. Shannon, Claude (1949). "Communication theory of secrecy systems". Bell System Technical Journal. 
  3. Dolev, Danny; Dwork, Cynthia; Moni, Naor (Mar 24, 2000). "Non-Malleable Cryptography". SIAM Journal on Computing: http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=9A853A59C3A45DD1B67690F10232D635?doi=10.1.1.26.8267&rep=rep1&type=pdf.+doi:10.1137/s0097539795291562.  https://dx.doi.org/10.1137%2Fs0097539795291562
  4. Dziembowski, Stefan; Pietrzak, Krzysztof; Wichs, Daniel. "Non-Malleable Codes". ICS, 2010. http://eprint.iacr.org/2009/608.pdf.. 
  5. Cheraghchi, Mahdi; Guruswami, Venkatesan (2013-09-02). "Capacity of Non-Malleable Codes". arXiv:1309.0458. //arxiv.org/abs/1309.0458
More
©Text is available under the terms and conditions of the Creative Commons-Attribution ShareAlike (CC BY-SA) license; additional terms may apply. By using this site, you agree to the Terms and Conditions and Privacy Policy.
Upload a video for this entry
Information
Subjects: Mathematics, Applied
Contributor MDPI registered users' name will be linked to their SciProfiles pages. To register with us, please refer to https://encyclopedia.pub/register :
HandWiki
View Times: 1.0K
Entry Collection: HandWiki
Revision: 1 time (View History)
Update Date: 16 Nov 2022
Table of Contents
    Notice
    You are not a member of the advisory board for this topic. If you want to update advisory board member profile, please contact office@encyclopedia.pub.
    OK
    Confirm
    Only members of the Encyclopedia advisory board for this topic are allowed to note entries. Would you like to become an advisory board member of the Encyclopedia?
    Yes
    No
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    There is no comment~
    ${ textCharacter }/${ maxCharacter }
    Submit
    Cancel
    ${ selectedItem.replyTextCharacter }/${ selectedItem.replyMaxCharacter }
    Submit
    Cancel
    Confirm
    Are you sure to Delete?
    Yes No
    Academic Video Service
    Feedback