Relations among security notions for undeniable signature schemes

Kurosawa, , Kaoru and Heng, , Swee-Huay (2006) Relations among security notions for undeniable signature schemes. SECURITY AND CRYPTOGRAPHY FOR NETWORKS, PROCEEDINGS, 4116. pp. 34-48. ISSN 0302-9743

Full text not available from this repository.

Abstract

In this paper, we conduct a thorough study among various notions of security of undeniable signature schemes and establish some relationships among them. We focus on two adversarial goals which are unforgeability and invisibility and two attacks which are chosen message attack and full attack. In particular,we show that unforgeability against chosen message attack is equivalent to unforgeability against full attack, and invisibility against chosen message attack is equivalent to invisibility against full attack. We also present an undeniable signature scheme whose unforgeability is based on the factoring assumption and whose invisibility is based on the composite decision Diffie-Hellman assumption.

Item Type: Article
Subjects: Q Science > QA Mathematics > QA75.5-76.95 Electronic computers. Computer science
Divisions: Faculty of Information Science and Technology (FIST)
Depositing User: Ms Rosnani Abd Wahab
Date Deposited: 10 Aug 2011 07:06
Last Modified: 10 Aug 2011 07:06
URI: http://shdl.mmu.edu.my/id/eprint/2019

Actions (login required)

View Item View Item