Sciweavers

13 search results - page 2 / 3
» The Security of the FDH Variant of Chaum's Undeniable Signat...
Sort
View
ICICS
2001
Springer
13 years 10 months ago
Threshold Undeniable RSA Signature Scheme
Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almo...
Guilin Wang, Sihan Qing, Mingsheng Wang, Zhanfei Z...
JOC
2011
104views more  JOC 2011»
12 years 9 months ago
Short Undeniable Signatures Based on Group Homomorphisms
This paper is devoted to the design and analysis of short undeniable signatures based on a random oracle. Exploiting their online property, we can achieve signatures with a fully s...
Jean Monnerat, Serge Vaudenay
PKC
2004
Springer
150views Cryptology» more  PKC 2004»
13 years 11 months ago
Undeniable Signatures Based on Characters: How to Sign with One Bit
We present a new undeniable signature scheme which is based on the computation of characters. Our signature scheme offers the advantage of having an arbitrarily short signature. I...
Jean Monnerat, Serge Vaudenay
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
14 years 15 days ago
Gradually Convertible Undeniable Signatures
In 1990, Boyar, Chaum, Damg˚ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted b...
Laila El Aimani, Damien Vergnaud
PKC
2001
Springer
95views Cryptology» more  PKC 2001»
13 years 10 months ago
The Gap-Problems: A New Class of Problems for the Security of Cryptographic Schemes
This paper introduces a novel class of computational problems, the gap problems, which can be considered as a dual to the class of the decision problems. We show the relationship a...
Tatsuaki Okamoto, David Pointcheval