Concurrently-Secure Blind Signatures without Random Oracles or Setup Assumptions

Jonathan Katz
University of Maryland

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 without random oracles or a common reference string.

Joint work with Camit Hazay, Chiu-Yuen Koo, and Yehuda Lindell

Audio (MP3 File, Podcast Ready) Presentation (PowerPoint File)

Back to Workshop II: Locally decodable codes, private information retrieval, privacy-preserving data-mining, and public key encryption with special properties