Citation

Kurosawa, Kaoru and Heng, Swee Huay (2006) Relations among security notions for undeniable signature schemes. In: Security and Cryptography for Networks. Lecture Notes in Computer Science, 4116 . Springer, pp. 34-48. ISBN Print ISBN 978-3-540-38080-1, 978-3-540-38081-8

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:	Book Section
Uncontrolled Keywords:	System identification, Undeniable signature, security notions, factoring assumption, composite decision Diffie-Hellman assumption
Subjects:	Q Science > QA Mathematics > QA299.6-433 Analysis
Divisions:	Faculty of Information Science and Technology (FIST)
Depositing User:	Ms Rosnani Abd Wahab
Date Deposited:	10 Aug 2011 07:06
Last Modified:	14 Dec 2020 08:28
URII:	http://shdl.mmu.edu.my/id/eprint/2019

Downloads

Edit (login required)