A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf
.
Optimization of the MOVA Undeniable Signature Scheme
[chapter]
2005
Lecture Notes in Computer Science
This article presents optimization results on the recent MOVA undeniable signature scheme presented by Monnerat and Vaudenay at PKC '04 as well as its generalization proposed at Asiacrypt '04 which is based on a secret group homomorphism. The original MOVA scheme uses characters on Z * n and some additional candidates homomorphisms were proposed with its generalization. We give an overview of the expected performances of the MOVA scheme depending on the group homomorphism. Our optimizations
doi:10.1007/11554868_14
fatcat:4k5gqsfouvbgpjgd4qmz7nmbcm