Invisibility and Anonymity of Undeniable and Confirmer Signatures

Show simple item record Galbraith, Steven en Mao, W en
dc.contributor.editor Joye, M en
dc.coverage.spatial San Francisco, USA en 2015-08-11T04:15:07Z en 2003 en
dc.identifier.citation Topics in Cryptology : Lecture Notes in Computer Science, 2003, 2612 pp. 80 - 97 en
dc.identifier.isbn 3-540-00847-0 en
dc.identifier.issn 0302-9743 en
dc.identifier.uri en
dc.description.abstract Traditionally, the strongest notion of security for undeniable and confirmer signatures is invisibility under adaptive attacks. This security property was promoted by Camenisch and Michels and they provided schemes with this property. Gennaro, Krawczyk and Rabin (GKR) developed an RSA-based scheme which is much more efficient than the schemes of Camenisch and Michels, but it does not have invisibility. We give an RSA-based scheme which is as efficient as the GKR scheme, and which has invisibility. We suggest that anonymity is the most relevant security property for undeniable and confirmer signatures. We give a precise definition of anonymity for undeniable and confirmer signatures in the multi-user setting and show that anonymity and invisibility are closely related. Finally, we show that anonymity can be achieved even when the parties use completely different cryptographic primitives. en
dc.publisher Springer en
dc.relation.ispartof Cryptographers Track held at the RSA Conference (CT-RSA) en
dc.relation.ispartofseries Topics in Cryptology : Lecture Notes in Computer Science en
dc.rights Items in ResearchSpace are protected by copyright, with all rights reserved, unless otherwise indicated. Previously published items are made available in accordance with the copyright policy of the publisher. Details obtained from en
dc.rights.uri en
dc.title Invisibility and Anonymity of Undeniable and Confirmer Signatures en
dc.type Conference Item en
dc.identifier.doi 10.1007/3-540-36563-X_6 en
pubs.begin-page 80 en
pubs.volume 2612 en
dc.description.version AM - Accepted Manuscript en
dc.rights.holder Copyright: Springer en
pubs.end-page 97 en
pubs.finish-date 2003-04-17 en
pubs.start-date 2003-04-13 en
dc.rights.accessrights en
pubs.subtype Proceedings en
pubs.elements-id 489105 en Science en Mathematics en
pubs.record-created-at-source-date 2015-06-29 en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace