Nonmalleable Cryptography
By Danny Dolev, Cynthia Dwork, Moni Naor. SIAM Review, 2000
702 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/c30c80f3e0ae538621e42e3927e4dd0961a10f9d
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Artificial Intelligence
- Mihir Bellare
- Phillip Rogaway
- Dan Boneh
- Eike Kiltz
- Chanathip Namprempre
- Yehuda Lindell
- M. Yung
- Jonathan Katz
In Computational Theory and Mathematics
- Mihir Bellare
- Yehuda Lindell
- Eike Kiltz
- Phillip Rogaway
- Rosario Gennaro
- M. Yung
- Krzysztof Pietrzak
- Martijn Stam
Citations in the corpus
- Secure Hybrid Encryption from Weakened Key Encapsulation (2007, background): “It also has a very constructive appeal, which we demonstrate with a new encryption scheme whose security relies on a class of intractability assumptions that we show (in the generic group model) strictly weaker than the Decision Diffie-Hellman (DDH) assumption.”
- A New Randomness Extraction Paradigm for Hybrid Encryption (2009, methodology): “Our methodology can be instantiated with efficient schemes based on standard intractability assumptions such as Decisional Diffie-Hellman, Quadratic Residuosity, and Paillier’s Decisional Composite Residuosity.”
- Authenticated Encryption: Relations among Notions and Analysis of the Generic Composition Paradigm (2000, methodology): “Nonmalleability We will not use definitions of nonmalleability as per [10,24,37] but instead use the equivalent indistinguishability under parallel chosen-ciphertext attack characterization of [7] adapted to the symmetric setting.”
- Security and Cooperation in Wireless Networks (2007, unknown): “The interested reader may refer to [118]”
- Foundations of Group Signatures: The Case of Dynamic Groups (2005, methodology): “We know that if trapdoor permutations exist then so do secure digital signature schemes [6], IND-CCA secure encryption schemes [17, 28] and simulation sound NIZK proofs for NP [28].”
- Efficient Verifiable Delay Functions (2019, background): “Deniable authentication was introduced in [16,20], and Pass [28] proved several possibility and impossibility results for deniable zero-knowledge proofs in the CRS or random oracle model.”