Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. Optimization of the MOVA Undeniable Signature Scheme
 
conference paper

Optimization of the MOVA Undeniable Signature Scheme

Monnerat, Jean  
•
Oswald, Yvonne Anne
•
Vaudenay, Serge  
2005
Progress in Cryptology - Mycrypt 2005
Progress in Cryptology - Mycrypt 2005, First International Conference on Cryptology in Malaysia

This article presents optimization results on the MOVA undeniable signature scheme presented last year 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 $\zz_n^$ and some additional candidate homomorphisms were proposed with its generalization. We give an overview of the expected performance of the MOVA scheme depending on the group homomorphism. Our optimizations focus on the quartic residue symbol and a homomorphism based on the computation of a discrete logarithm in a hidden subgroup of $\zz_n^$. We demonstrate that the latter provides a signature generation which is three times faster than RSA.

  • Files
  • Details
  • Metrics
Loading...
Thumbnail Image
Name

MOV05.pdf

Access type

openaccess

Size

227.83 KB

Format

Adobe PDF

Checksum (MD5)

8365625d473e44dfdd7b7b52ebd36cea

Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés