Universally Composable Undeniable Signature

نویسندگان

  • Kaoru Kurosawa
  • Jun Furukawa
چکیده

How to define the security of undeniable signature schemes is a challenging task. This paper presents two security definitions of undeniable signature schemes which are more useful or natural than the existing definition. It then proves their equivalence. We first define the UC-security, where UC means universal composability. We next show that there exists a UC-secure undeniable signature scheme which does not satisfy the standard definition of security that has been believed to be adequate so far. More precisely, it does note satisfy the invisibility defined by [19]. We then show a more adequate definition of invisibility which captures a wider class of (naturally secure) undeniable signature schemes. We finally prove that the UC-security against non-adaptive adversaries is equivalent to this definition of invisibility and the strong unforgeability in FZK-hybrid model, where FZK is the ideal ZK functionality. Our result of equivalence implies that all the known proven secure undeniable signature schemes (including Chaum’s scheme) are UC-secure if the confirmation/disavowal protocols are both UC zero-knowledge.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Eecient Convertible Undeniable Signature Schemes Extended Abstract

Undeniable signatures are digital signatures which are not universally veri able but can only be checked with the signer's help. However, the signer cannot deny the validity of a correct signature. An extended concept, convertible undeniable signatures, allows the signer to convert single undeniable signatures or even the whole scheme into universally veri able signatures or into an ordinary di...

متن کامل

Eecient Convertible Undeniable Signature Schemes

Undeniable signatures are digital signatures which are not universally veriiable but can only be checked with the signer's help. However, the signer cannot deny the validity of a correct signature. An extended concept , convertible undeniable signatures, allows the signer to convert single undeniable signatures or even the whole scheme into universally veriiable signatures or into an ordinary d...

متن کامل

Round-Optimal Composable Blind Signatures in the Common Reference String Model

We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, each interactive signature generation requires the requesting user and the issuing bank to transmit only one message each. We also put forward the definition of universally composable blind signature schemes, and show...

متن کامل

How to Break and Repair a Universally Composable Signature Functionality

Canetti and Rabin recently proposed a universally composable ideal functionality FSIG for digital signatures. We show that this functionality cannot be securely realized by any signature scheme, thereby disproving their result that any signature scheme that is existentially unforgeable under adaptive chosen-message attack is a secure realization. Next, an improved signature functionality is pre...

متن کامل

Time-Selective Convertible Undeniable Signatures

Undeniable signatures were introduced in 1989 by Chaum and van Antwerpen to limit the self-authenticating property of digital signatures. An extended concept – the convertible undeniable signatures – proposed by Boyar, Chaum, Damg̊ard and Pedersen in 1991, allows the signer to convert undeniable signatures to ordinary digital signatures. We present a new efficient convertible undeniable signatur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2008