Sciweavers

144 search results - page 4 / 29
» Signature Schemes Based on Two Hard Problems Simultaneously
Sort
View
ACNS
2005
Springer
85views Cryptology» more  ACNS 2005»
14 years 1 months ago
New Signature Schemes with Coupons and Tight Reduction
Amongst provably secure signature schemes, two distinct classes are of particular interest: the ones with tight reduction (e.g., RSA-PSS), and those which support the use of coupon...
Benoît Chevallier-Mames
ISW
2004
Springer
14 years 27 days ago
Chameleon Hashing Without Key Exposure
Abstract. Chameleon signatures are based on well established hashand-sign paradigm, where a chameleon hash function is used to compute the cryptographic message digest. Chameleon s...
Xiaofeng Chen, Fangguo Zhang, Kwangjo Kim
ISCI
2008
160views more  ISCI 2008»
13 years 7 months ago
Certificateless undeniable signature scheme
In this paper, we present the first certificateless undeniable signature scheme. The scheme does not suffer from the key escrow problem, which is inherent in identity based crypto...
Shanshan Duan
LATINCRYPT
2010
13 years 6 months ago
A Lattice-Based Threshold Ring Signature Scheme
In this article, we propose a new lattice-based threshold ring signature scheme, modifying Aguilar’s code-based solution to use the short integer solution (SIS) problem as securi...
Pierre-Louis Cayrel, Richard Lindner, Markus R&uum...
CORR
2008
Springer
96views Education» more  CORR 2008»
13 years 7 months ago
New Extensions of Pairing-based Signatures into Universal (Multi) Designated Verifier Signatures
The concept of universal designated verifier signatures was introduced by Steinfeld, Bull, Wang and Pieprzyk at Asiacrypt 2003. These signatures can be used as standard publicly ve...
Damien Vergnaud