Universally Composable Notions of Key Exchange and Secure Channels

By Ran Canetti, Hugo Krawczyk. International Conference on the Theory and Application of Cryptographic Techniques, 2002

795 citations recorded by the source corpus.

How researchers see this paper

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

Scalable Protocols for Authenticated Group Key Exchange (2003, methodology): “The case of 2-party AKE has been extensively investigated (e.g., [19,8,20,6, 25,4,30,15,16,17] and others) and is fairly well-understood; furthermore, a variety D. Boneh (Ed.)”
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks (2002, background): “With this, one moves into the domain of authenticated key-exchange protocols which is definitionally more complex (see for example [9,8,29,11]) and where identification without an associated exchange of a session-key is of little practical value.”
Privacy-Enhanced Data Aggregation Scheme Against Internal Attackers in Smart Grid (2014, background): “For securely distributing the blinding factors, we assume that there are secure channels [21]–[23] between an offline trusted third party and the users.”
HMQV: A High-Performance Secure Diffie-Hellman Protocol (2005, background): “Another advantage of HMQV-C is that it can be proven secure in the stronger universally composable (UC) KE security model of [13] which ensures the security of key-exchange protocols when run concurrently with other applications.”