Evervault Papers
Crypto means cryptography
The most important cryptography papers spanning the past, present, and future of cryptosystems & cryptology.
Non-Malleable Cryptography
Danny Dolev, Cynthia Dwork, & Moni Naor — Published January 1991
Malleable means capable of being transformed into another shape or form without breaking or cracking.
Non-malleability as defined in Semantic Security [Goldwasser and Micali, 1982] says that for any relation, seeing an encryption of a message doesn't help us to find the plaintext details of the message. The adversary learns nothing about the original message just by seeing an encryption of the message and can produce no plaintext related to the message.
The notion of non-malleable cryptography, an extension of semantically secure cryptography goes one step further in that given the ciphertext of a message, it is impossible to generate a different ciphertext so that the respective plaintexts are related.
The same concept makes sense in the contexts of string commitment and zero-knowledge proofs of possession of knowledge. Non-malleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other system users.
At time of publishing this cryptosystem was the first proven to be secure against a strong type of chosen ciphertext attack proposed by Rackoff and Simon, in which the attacker knows the ciphertext she wishes to break and can query the decryption oracle on any ciphertext other than the target.
Download PDF
On the (Im)possibility of Obfuscating Programs
Computer Systems Established, Maintained and Trusted by Mutually Suspicious Groups
A Digital Signature Based on a Conventional Encryption Function
The Knowledge Complexity of Interactive Proof-Systems
Minimal Key Lengths for Symmetric Ciphers to Provide Adequate Commercial Security
CryptDB: Protecting Confidentiality with Encrypted Query Processing
Protocols for Secure Computations
Bitcoin: A Peer-to-Peer Electronic Cash System
A fully homomorphic encryption scheme
On Data Banks and Privacy Homomorphisms
A fast quantum mechanical algorithm for database search
Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
Use of Elliptic Curves in Cryptography
Elliptic Curve Cryptosystems
A Method for Obtaining Digital Signatures and Public Key Cryptosystems
New Directions in Cryptography
Cramming more components onto integrated circuits
A Mathematical Theory of Cryptography
