Abstract
Blind signatures play a critical role in digital cash systems. In this paper, we investigate the blind signature functionality in the framework of universally composable (UC) security — the strongest security guarantees up to now for cryptographic protocols over the Internet. We present the universally composable blind signature functionality, [Formula: see text]. Our approach is based on a new UC signature functionality [Formula: see text], which is a modified version of the original signature functionality [Formula: see text] presented by Canetti. We also prove that [Formula: see text] and [Formula: see text] are actually equivalent with respect to non-adaptive adversaries. Our result is of both theoretical and practical consequence to future research studies and practical implementations of digital cash systems with universally composable security.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
