Universally composable signature, certification, and authentication

By Ran Canetti. Proceedings. 17th IEEE Computer Security Foundations Workshop, 2004., 2004

326 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.

Universally Composable Security with Global Setup (2007, background): “For instance, most traditional two-party tasks cannot be UC-realized with no setup [16, 11, 17], and authenticated communication is impossible without some sort of setup [13].”
TumbleBit: An Untrusted Bitcoin-Compatible Anonymous Payment Hub (2017, background): “This is follows the deﬁnition of the ideal functionality for signatures, per [15].”
Ouroboros: A Provably Secure Proof-of-Stake Blockchain Protocol (2017, result): “First, in Figure 3, we present Functionality FDSIG as defined in [14], where it is also shown that EUF-CMA signature schemes realize FDSIG.”
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge (2017, methodology): “Therefore, FTEE uses a “real” signature scheme Σ, rather than an idealized variant [30], as doing so would correspond to a less natural assumption on the setup provided by trusted hardware.”