Round-Optimal Composable Blind Signatures in the Common Reference String Model

We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, each interactive signature generation requires the requesting user and the issuing bank to transmit only one message each. We also put forward the definition of universally composable blind signature schemes, and show how to extend our concurrently executable blind signature protocol to derive such universally composable schemes in the common reference string model under general assumptions. While this protocol then guarantees very strong security properties when executed within larger protocols, it still supports signature generation in two moves.

• Type: Conference
• Year: 2006
• Where: CRYPTO
• Authors: Marc Fischlin
• Keywords: Common Reference String Model, Composable Blind Signature, CRYPTO 2006, Cryptology, Executable Blind Signature