Abstract. We show a new protocol for blind signatures in which security is preserved even under arbitrarily-many concurrent executions. The protocol can be based on standard cryptographic assumptions and is the first to be proven secure in a concurrent setting (under any assumptions) without random oracles or a common reference string. Along the way, we also introduce new definitions of security for blind signature schemes
To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.