Sciweavers

ACNS
2009
Springer

Efficient Deniable Authentication for Signatures

13 years 8 months ago
Efficient Deniable Authentication for Signatures
Releasing a classical digital signature faces to privacy issues. Indeed, there are cases where the prover needs to authenticate some data without making it possible for any malicious verifier to transfer the proof to anyone else. It is for instance the case for e-passports where the signature from the national authority authenticates personal data. To solve this problem, we can prove knowledge of a valid signature without revealing it. This proof should be non-transferable. We first study deniability for signature verification. Deniability is essentially a weaker form of non-transferability. It holds as soon as the protocol is finished (it is often called offline non-transferability). We introduce Offline Non-Transferable Authentication Protocol (ONTAP) and we show that it can be built by using a classical signature scheme and a deniable zero-knowledge proof of knowledge. For that reason, we use a generic transform for -protocols. Finally, we give examples to upgrade signature standard...
Jean Monnerat, Sylvain Pasini, Serge Vaudenay
Added 12 Aug 2010
Updated 12 Aug 2010
Type Conference
Year 2009
Where ACNS
Authors Jean Monnerat, Sylvain Pasini, Serge Vaudenay
Comments (0)