Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions

Aggelos Kiayias, Moti Yung

Research output: Chapter in Book/Report/Conference proceedingConference contribution

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 trusted setup assumption such as a common reference string. Along the way, we also introduce new definitions of security for blind signature schemes.
Original languageEnglish
Title of host publicationFinancial Cryptography
Subtitle of host publication8th International Conference, FC 2004, Key West, FL, USA, February 9-12, 2004. Revised Papers
EditorsAri Juels
Place of PublicationBerlin, Heidelberg
PublisherSpringer Berlin Heidelberg
Pages72-89
Number of pages18
ISBN (Electronic)978-3-540-27809-2
ISBN (Print)978-3-540-22420-4
DOIs
Publication statusPublished - 2004

Publication series

Name Lecture Notes in Computer Science
PublisherSpringer Berlin Heidelberg
Volume3110
ISSN (Print)0302-9743

Fingerprint Dive into the research topics of 'Concurrently-Secure Blind Signatures Without Random Oracles or Setup Assumptions'. Together they form a unique fingerprint.

Cite this