Skip to search formSkip to main contentSkip to account menu

Malleability (cryptography)

Malleability is a property of some cryptographic algorithms. An encryption algorithm is malleable if it is possible for an adversary to transform a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

21 relations
Adaptive chosen-ciphertext attackAlgorithmCiphertextCiphertext indistinguishability

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Non-Malleable Codes Against Affine Errors
Non-malleable code is a relaxed version of error-correction codes and the decoding of modified codewords results in the original… 
2010
2010
Non-malleable encryption and message authentication
Cieľom tejto prace je studium non-malleability, sifrovania a autentizacie sprav a ich vzajomných vzťahov. V praci su uvedene… 
2010
2010
Improvement on a Signed ElGamal Encryption
Previously, two schemes were proposed to enhance the security of ElGamal encryption. The weakness of the original scheme is… 
2009
2009
Adaptive Concurrent Non-Malleability with Bare Public-Keys
Concurrent non-malleability (CNM) is central for cryptographic protocols running concurrently in environments such as the… 
Review
2008
Review
2008
Some Information Theoretic Arguments for Encryption: Non-malleability and Chosen-Ciphertext Security (Invited Talk)
In this paper, we briefly review two independent studies: (1) an information-theoretic definition and constructions of non… 
2007
2007
Epoc: Ecient Probabilistic Public-key Encryption (submission to Nessie)
We describe a novel public-key cryptosystem, EPOC (E cient Probabilistic Public-Key Encryption), which has three versions: EPOC-1… 
2006
2006
Bounded CCA2-Secure Non-Malleable Encryption
Under an adaptive chosen ciphertext attack (CCA2), the security of an encryption scheme must hold against adversaries that have… 
2000
2000
PSEC : Provably Secure Elliptic Curve Encryption Scheme ( Submission to NESSIE )
We describe an elliptic curve encryption scheme, PSEC (provably secure elliptic curve encryption scheme), which has three… 
1997
1997
On Characterization of Escrow Encryption Schemes
Designing escrow encryption schemes is an area of much recent interest. However, the basic design issues, characterizations and… 
1993
1993
The Power of Choice in Scheduling Parallel Tasks
A malleable parallel task is one that can be executed on any number of processors, with its execution time being a function of… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)