A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://www.iacr.org/archive/pkc2008/49390068/49390068.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
Completely Non-malleable Encryption Revisited
[chapter]
<i title="Springer Berlin Heidelberg">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/irvfffcatna3lecs7dvebnzgcy" style="color: black;">Public Key Cryptography – PKC 2008</a>
</i>
Preserved Fulltext
Several security notions for public-key encryption schemes have been proposed so far, in particular considering the powerful adversary that can play a so called "man-in-the-middle" attack. In this paper we extend the notion of completely non-malleable encryption introduced in [Fischlin, ICALP 05]. This notion immunizes a scheme from adversaries that can generate related ciphertexts under new public keys. This notion is motivated by its powerful features when encryption schemes are used as
<span class="external-identifiers">
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-78440-1_5">doi:10.1007/978-3-540-78440-1_5</a>
<a target="_blank" rel="external noopener" href="https://dblp.org/rec/conf/pkc/VentreV08.html">dblp:conf/pkc/VentreV08</a>
<a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/bmhepjotsnbt7h3zpnsfvd2te4">fatcat:bmhepjotsnbt7h3zpnsfvd2te4</a>
</span>
more »
... tocols. While in [Fischlin, ICALP 05] the only notion of simulation-based completely non-malleable encryption with respect to CCA2 adversaries was given, we present new game-based definitions for completely non-malleable encryption that follow the standard separations among NM-CPA, NM-CCA1 and NM-CCA2 security given in [Bellare et al., CRYPTO 98]. This is motivated by the fact that in several cases, the simplest notion we introduce (i.e., NM-CPA*) in several cases suffices for the main application that motivated the introduction of the notion of NM-CCA2* security, i.e., the design of non-malleable commitment schemes. Further the game-based definition of NM-CPA* security actually implies the simulation-based one. We then focus on constructing encryption schemes that satisfy these strong security notions and show: 1) an NM-CCA2* secure encryption scheme in the shared random string model; 2) an NM-CCA2* secure encryption scheme in the plain model; for this second result, we use interaction and non-black-box techniques to overcome an impossibility result. Our results clarify the importance of these stronger notions of encryption schemes and show how to construct them without requiring random oracles.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170811091052/https://www.iacr.org/archive/pkc2008/49390068/49390068.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext">
<button class="ui simple right pointing dropdown compact black labeled icon button serp-button">
<i class="icon ia-icon"></i>
Web Archive
[PDF]
<div class="menu fulltext-thumbnail">
<img src="https://blobs.fatcat.wiki/thumbnail/pdf/ef/b8/efb8ecaa6e7cf24abc4fec5eac21ef6bd8e62819.180px.jpg" alt="fulltext thumbnail" loading="lazy">
</div>
</button>
</a>
<a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1007/978-3-540-78440-1_5">
<button class="ui left aligned compact blue labeled icon button serp-button">
<i class="external alternate icon"></i>
springer.com
</button>
</a>