Relations among security notions for undeniable signature schemes

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 pa...

Full description

Bibliographic Details
Main Authors: Kurosawa, Kaoru, Heng, Swee Huay
Format: Book Section
Published: Springer 2006
Subjects:
Online Access:http://shdl.mmu.edu.my/2019/
_version_ 1848789941360787456
author Kurosawa, Kaoru
Heng, Swee Huay
author_facet Kurosawa, Kaoru
Heng, Swee Huay
author_sort Kurosawa, Kaoru
building MMU Institutional Repository
collection Online Access
description 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.
first_indexed 2025-11-14T18:04:43Z
format Book Section
id mmu-2019
institution Multimedia University
institution_category Local University
last_indexed 2025-11-14T18:04:43Z
publishDate 2006
publisher Springer
recordtype eprints
repository_type Digital Repository
spelling mmu-20192020-12-14T08:28:52Z http://shdl.mmu.edu.my/2019/ Relations among security notions for undeniable signature schemes Kurosawa, Kaoru Heng, Swee Huay QA299.6-433 Analysis 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. Springer 2006 Book Section NonPeerReviewed 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 https://link.springer.com/chapter/10.1007/11832072_3 https://doi.org/10.1007/11832072_3 https://doi.org/10.1007/11832072_3
spellingShingle QA299.6-433 Analysis
Kurosawa, Kaoru
Heng, Swee Huay
Relations among security notions for undeniable signature schemes
title Relations among security notions for undeniable signature schemes
title_full Relations among security notions for undeniable signature schemes
title_fullStr Relations among security notions for undeniable signature schemes
title_full_unstemmed Relations among security notions for undeniable signature schemes
title_short Relations among security notions for undeniable signature schemes
title_sort relations among security notions for undeniable signature schemes
topic QA299.6-433 Analysis
url http://shdl.mmu.edu.my/2019/
http://shdl.mmu.edu.my/2019/
http://shdl.mmu.edu.my/2019/