Results 1  10
of
293,554
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
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
requirements for program obfuscation, and show that they are incomparable in general. We also construct nonmalleable obfuscators of both flavors for some program families of interest. Some of our constructions are in the Random Oracle model, whereas another one is in the common reference string model. We also
NonMalleability Amplification
 In 41st STOC
, 2009
"... We show a technique for amplifying commitment schemes that are nonmalleable with respect to identities of length t, into ones that are nonmalleable with respect to identities of length Ω(2 t), while only incurring a constant overhead in roundcomplexity. As a result we obtain a construction of O(1 ..."
Abstract

Cited by 17 (9 self)
 Add to MetaCart
We show a technique for amplifying commitment schemes that are nonmalleable with respect to identities of length t, into ones that are nonmalleable with respect to identities of length Ω(2 t), while only incurring a constant overhead in roundcomplexity. As a result we obtain a construction of O
An Algebraic Approach to NonMalleability
"... In their seminal work on nonmalleable cryptography, Dolev, Dwork and Naor, showed how to construct a nonmalleable commitment with logarithmicallymany "rounds"/"slots", the idea being that any adversary may successfully maul in some slots but would fail in at least one. Since t ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In their seminal work on nonmalleable cryptography, Dolev, Dwork and Naor, showed how to construct a nonmalleable commitment with logarithmicallymany "rounds"/"slots", the idea being that any adversary may successfully maul in some slots but would fail in at least one. Since
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
tion, the adversary is allowed to ask many adaptive “parallel ” decryption queries (i.e., a query consists of many ciphertexts) up to the point when the first invalid ciphertext is submitted. As such, NMSDA security generalizes nonmalleability against chosen plaintext attacks (NMCPA, where only one parallel
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1643 (75 self)
 Add to MetaCart
We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R
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
Capacity of nonmalleable codes
, 2013
"... Nonmalleable codes, introduced by Dziembowski, Pietrzak and Wichs (ICS 2010), encode messages s in a manner so that tampering the codeword causes the decoder to either output s or a message that is independent of s. While this is an impossible goal to achieve against unrestricted tampering function ..."
Abstract

Cited by 6 (2 self)
 Add to MetaCart
w.h.p. by a randomized construction). • We show the existence of families of size exp(n O(1) 2 αn) against which there is no nonmalleable code of rate 1 − α (in fact this is the case w.h.p for a random family of this size). • We also show that 1 − α is the best achievable rate for the family
Blockwise Nonmalleable Codes
, 2015
"... Nonmalleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that nonmalleable codes cannot exist for ..."
Abstract
 Add to MetaCart
Nonmalleable codes, introduced by Dziembowski, Pietrzak, and Wichs (ICS ’10), provide the guarantee that if a codeword c of a message m, is modified by a tampering function f to c′, then c ′ either decodes to m or to “something unrelated ” to m. It is known that nonmalleable codes cannot exist
Results 1  10
of
293,554