Non-interactive confirmer signatures

3Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The study of non-transferability of digital signatures, such as confirmer signatures, has enjoyed much interest over the last twenty years. In PKC '08, Liskov and Micali noted that all previous constructions of confirmer signatures consider only offline untransferability - non-transferability is not preserved if the recipient interacts concurrently with the signer/confirmer and an unexpected verifier. We view this as a result of all these schemes being interactive in the confirmation step. In this paper, we introduce the concept of non-interactive confirmer signatures (which can also be interpreted as extractable universal designated-verifier signatures). Non-interactive confirmer signatures give a neat way to ensure the online untransferability of signatures. We realize our notion under the "encryption of a signature" paradigm using pairings and provide a security proof for our construction without random oracles. © 2011 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Chow, S. S. M., & Haralambiev, K. (2011). Non-interactive confirmer signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6558 LNCS, pp. 49–64). https://doi.org/10.1007/978-3-642-19074-2_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free