Cryptology ePrint Archive: Report 2006/405

Universally Composable Blind Signatures in the Plain Model

Aslak Bakke Buan and Kristian Gj\o steen and Lillian Kr\aa kmo

Abstract: In the universal composability framework, we define an ideal functionality for blind signatures, as an alternative to a functionality recently proposed by Fischlin. Fischlin proves that his functionality cannot be realized in the plain model, but this result does not apply to our functionality. We show that our functionality is realized in the plain model by a blind signature protocol if and only if the corresponding blind signature scheme is secure with respect to blindness and non-forgeability, as defined by Juels, Luby and Ostrovsky.

Category / Keywords: cryptographic protocols / Blind signatures, universal composability

Date: received 9 Nov 2006

Contact author: krakmo at math ntnu no

Available format(s): Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20061112:195257 (All versions of this report)

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]