Results 1  10
of
87,417
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related
Relations among notions of security for publickey encryption schemes
, 1998
"... Abstract. We compare the relative strengths of popular notions of security for public key encryption schemes. We consider the goals of privacy and nonmalleability, each under chosen plaintext attack and two kinds of chosen ciphertext attack. For each of the resulting pairs of definitions we prove e ..."
Abstract

Cited by 514 (68 self)
 Add to MetaCart
Abstract. We compare the relative strengths of popular notions of security for public key encryption schemes. We consider the goals of privacy and nonmalleability, each under chosen plaintext attack and two kinds of chosen ciphertext attack. For each of the resulting pairs of definitions we prove
Concurrent nonmalleable commitments
 In FOCS
, 2005
"... We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a maninthemiddle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender and as a ..."
Abstract

Cited by 42 (14 self)
 Add to MetaCart
We present a nonmalleable commitment scheme that retains its security properties even when concurrently executed a polynomial number of times. That is, a maninthemiddle adversary who is simultaneously participating in multiple concurrent commitment phases of our scheme, both as a sender
SelfDestruct NonMalleability
, 2014
"... We introduce a new security notion for publickey encryption (PKE) that we dub nonmalleability under (chosenciphertext) selfdestruct attacks (NMSDA), which appears to be the strongest natural PKE security notion below fullblown chosenciphertext (INDCCA) security. In this notion, the adversa ..."
Abstract
 Add to MetaCart
We introduce a new security notion for publickey encryption (PKE) that we dub nonmalleability under (chosenciphertext) selfdestruct attacks (NMSDA), which appears to be the strongest natural PKE security notion below fullblown chosenciphertext (INDCCA) security. In this no
Relations among notions of nonmalleability for encryption
 In Advances in Cryptology  ASIACRYPT ’07
, 2007
"... Abstract. Since its introduction in the early 90’s, the notion of nonmalleability for encryption schemes has been formalized using a number of conceptually different definitional approaches—most notably, the “pragmatic ” indistinguishabilitybased approach and the “semantical” simulationbased appro ..."
Abstract

Cited by 6 (0 self)
 Add to MetaCart
based approach. We provide a full characterization of these approaches and consider their robustness under composition. Keywords: Publickey Encryption, Nonmalleability. 1
NonMalleable Obfuscation
"... Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of nonmalleability requ ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
Existing definitions of program obfuscation do not rule out malleability attacks, where an adversary that sees an obfuscated program is able to generate another (potentially obfuscated) program that is related to the original one in some way. We formulate two natural flavors of nonmalleability
Concurrently NonMalleable ZeroKnowledge in the Authenticated PublicKey Model
, 2006
"... We consider a type of zeroknowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zeroknowledge arguments of knowledge that remain secure against concurrent maninthemiddle attacks. As negative results in the area of concurrent nonm ..."
Abstract

Cited by 4 (0 self)
 Add to MetaCart
We consider a type of zeroknowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zeroknowledge arguments of knowledge that remain secure against concurrent maninthemiddle attacks. As negative results in the area of concurrent nonmalleable
NonMalleable NonInteractive Zero Knowledge and Adaptive ChosenCiphertext Security
, 1999
"... We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against ..."
Abstract

Cited by 190 (19 self)
 Add to MetaCart
We introduce the notion of nonmalleable noninteractive zeroknowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong nonmalleability properties. We then show that the elegant encryption scheme of Naor and Yung [NY] can be made secure against
From singlebit to multibit publickey encryption via nonmalleable codes
 IACR Cryptology ePrint Archive
, 2014
"... One approach towards basing publickey encryption schemes on weak and credible assumptions is to build “stronger ” or more general schemes generically from “weaker ” or more restricted schemes. One particular line of work in this context, which has been initiated by Myers and Shelat (FOCS ’09) and c ..."
Abstract

Cited by 9 (5 self)
 Add to MetaCart
One approach towards basing publickey encryption schemes on weak and credible assumptions is to build “stronger ” or more general schemes generically from “weaker ” or more restricted schemes. One particular line of work in this context, which has been initiated by Myers and Shelat (FOCS ’09
Results 1  10
of
87,417