A framework for universally composable non-committing blind signatures

32Citations
Citations of this article
38Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A universally composable (UC) blind signature functionality demands users to commit to the message to be blindly signed. It is thereby impossible to realize in the plain model. We show that even non-committing variants of UC blind signature functionality remain not realizable in the plain model. We then characterize adaptively secure UC non-committing blind signatures in the common reference string model by presenting equivalent stand-alone security notions. We also present a generic construction based on conceptually simple Fischlin's blind signature scheme. © 2009 Springer-Verlag.

Cite

CITATION STYLE

APA

Abe, M., & Ohkubo, M. (2009). A framework for universally composable non-committing blind signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5912 LNCS, pp. 435–450). https://doi.org/10.1007/978-3-642-10366-7_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free