Secure Hybrid Encryption from Weakened Key Encapsulation
By Dennis Hofheinz, Eike Kiltz. Annual International Cryptology Conference, 2007
300 citations recorded by the source corpus.
Subfields: Artificial Intelligence, Computational Theory and Mathematics
View Paper: https://www.semanticscholar.org/paper/99fa0e3ad7e0d70c1832c3b1ade061c319dfed3e
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
In Computational Theory and Mathematics
Citations in the corpus
- An Algebraic Framework for Diffie–Hellman Assumptions (2013, methodology): “More recently, the 2-Lin Assumption was generalized to the (k-Lin)k∈ Assumption family [19,29] (1-Lin = DDH), a family of increasingly (strictly) weaker Assumptions which are generically hard in k-linear maps.”
- Key Homomorphic PRFs and Their Applications (2013, background): “PRF security is based on the `-decision linear assumption [34, 23] in G.”
- Lossy trapdoor functions and their applications (2008, background): “) More recently, Freeman, Goldreich, Kiltz, Rosen and Segev [27] produced more constructions of lossy TDFs, from the quadratic residuosity assumption and the family of k-linear assumptions [39, 62] (which are potentially weaker generalizations of the DDH assumption).”
- A New Randomness Extraction Paradigm for Hybrid Encryption (2009, methodology): “The efficient transformation enables the design of new and efficient IND-CCA2 secure hybrid encryption schemes based on various hard subset membership problem, such as the DDH assumption, Paillier’s Decisional Composite Residuosity (DCR) assumption [21], the family of Linear assumptions [14, 23] tha”