CryptoDB
Universally Composable Blind Signatures in the Plain Model
Authors: | |
---|---|
Download: | |
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. |
BibTeX
@misc{eprint-2006-21896, title={Universally Composable Blind Signatures in the Plain Model}, booktitle={IACR Eprint archive}, keywords={cryptographic protocols / Blind signatures, universal composability}, url={http://eprint.iacr.org/2006/405}, note={ krakmo@math.ntnu.no 13461 received 9 Nov 2006}, author={Aslak Bakke Buan and Kristian Gjøsteen and Lillian Kr\aa kmo}, year=2006 }