Concurrently-secure blind signatures without random oracles or setup assumptions

Carmit Hazay, Jonathan Katz, Chiu Yuen Koo, Yehuda Lindell

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

38 Scopus citations

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 publicationTheory of Cryptography - 4th Theory of Cryptography Conference, TCC 2007, Proceedings
PublisherSpringer Verlag
Pages323-341
Number of pages19
ISBN (Print)9783540709350
DOIs
StatePublished - 2007
Event4th Theory of Cryptography Conference, TCC 2OO7 - Amsterdam, Netherlands
Duration: 21 Feb 200724 Feb 2007

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume4392 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference4th Theory of Cryptography Conference, TCC 2OO7
Country/TerritoryNetherlands
CityAmsterdam
Period21/02/0724/02/07

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