Generic homomorphic undeniable signatures

Autor:	Jean Monnerat, Serge Vaudenay
Předmět:	Theoretical computer science business.industry NCCR-MICS NCCR-MICS/CL3 Cryptography Undeniable signature Random oracle Public-key cryptography Digital signature Discrete logarithm Commitment scheme Arithmetic business Schnorr signature Mathematics Computer Science::Cryptography and Security
Zdroj:	Advances in Cryptology-ASIACRYPT 2004 ISBN: 9783540239758 ASIACRYPT
Popis:	We introduce a new computational problem related to the interpolation of group homomorphisms which generalizes many famous cryptographic problems including discrete logarithm, Diffie-Hellman, and RSA. As an application, we propose a generic undeniable signaturescheme which generalizes the MOVA schemes. Our scheme is generic in the sense that we transform a private group homomorphism from public groups G to H (the order of H being public) into an undeniable signature scheme. It is provably secure in the random oracle model provided that the interpolation problem is hard and it offers the advantage of making the signature size arbitrarily short (depending on a security level). We (im)prove some security results from MOVA. We also propose a new example with complexity similar to RSA and with 3-byte signatures.
Databáze:	OpenAIRE
Externí odkaz:	https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b534c346467d4dc8a353308a2dc1bf74 https://infoscience.epfl.ch/record/99428 Zobrazit plný text záznamu