Towards Practical Public Key Systems Secure Against Chosen Ciphertext Attacks

By Ivan Bjerre Damgård. 1991

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Succinct Malleable NIZKs and an Application to Compact Shuffles (2013, background): “While the succinctness property of SNARGs is quite attractive for applications, it comes with a price: all known SNARG constructions are based on so-called “knowledge of exponent” assumptions [10,2]; furthermore, a recent result due to Gentry and Wichs [19] that separates SNARGS from all falsifiable”
A New Randomness Extraction Paradigm for Hybrid Encryption (2009, methodology): “One application of our method is centered around Damg̊ard’s public-key scheme [5] (from 1991) which he proved IND-CCA1 secure under the rather strong knowledge of exponent assumption.”
Quadratic Span Programs and Succinct NIZKs without PCPs (2013, background): “8 KEAs [6, 18, 24] exist for Paillier/RSA [19, 24], bilinear groups [27, 33], and even lattices [34].”
Relations among Notions of Security for Public-Key Encryption Schemes (1998, background): “Then there are schemes without proofs, such as those of [9, 26].”
The Algebraic Group Model and its Applications (2018, background): “The ﬁrst trivial observation is that the classical knowledge of exponent assumption 1 [Dam92] holds by deﬁnition in the AGM.”
Random oracles are practical: a paradigm for designing efficient protocols (1993, unknown): “Damg&rd [10] suggests an efficient scheme to achieve the definition of [34], but this scheme is not proven to achieve the definition of [34] and it does not achieve the one of [36] which we are interested in.”