Premium
Provably secure strong designated verifier signature scheme based on coding theory
Author(s) -
Shooshtari Masoumeh Koochak,
AhmadianAttari Mahmoud,
Aref Mohammad Reza
Publication year - 2016
Publication title -
international journal of communication systems
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.344
H-Index - 49
eISSN - 1099-1131
pISSN - 1074-5351
DOI - 10.1002/dac.3162
Subject(s) - computer science , random oracle , cryptosystem , scheme (mathematics) , theoretical computer science , digital signature , coding theory , oracle , signature (topology) , authentication (law) , computer security , message authentication code , hash function , cryptography , public key cryptography , mathematics , programming language , encryption , mathematical analysis , geometry
Summary Strong Designated Verifier Signature (SDVS) provides authentication for the signer and the verifier such that the signer is assured that what s/he has signed, is only verified by the designated verifier. Currently, the security of most of the SDVS schemes is based on hard problems in the number theory. As it is proved that all kinds of cryptosystems which are based on the number theory will not tolerate quantum attacks, here, an SDVS scheme based on hard problems in coding theory is presented. We have proved that the suggested scheme is unforgeable under a chosen message attack in Random Oracle Model. Copyright © 2016 John Wiley & Sons, Ltd.