Sciweavers

326 search results - page 4 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
IJNSEC
2008
154views more  IJNSEC 2008»
13 years 7 months ago
ID-based Weak Blind Signature From Bilinear Pairings
In a blind signature scheme, the user can get a signature sig(m) on message m generated from the signer's blind signature sig(m ) on blinded message m , but the signer can�...
Ze-mao Zhao
IJNSEC
2007
118views more  IJNSEC 2007»
13 years 7 months ago
Code-based Ring Signature Scheme
McEliece is one of the oldest known public key cryptosystems, however it was not quite as successful as RSA. One main reason is that it is widely believed that code-based cryptosy...
Dong Zheng, Xiangxue Li, Kefei Chen
DCC
2003
IEEE
14 years 7 months ago
On the Security of Digital Signature Schemes Based on Error-Correcting Codes
In this paper we discuss the security of digital signature schemes based on error? correcting codes. Several attacks to the Xinmei scheme are surveyed, and some reasons given to e...
Sheng-Bo Xu, Jeroen Doumen, Henk C. A. van Tilborg
EUROCRYPT
2012
Springer
11 years 10 months ago
Lattice Signatures without Trapdoors
We provide an alternative method for constructing lattice-based digital signatures which does not use the “hash-and-sign” methodology of Gentry, Peikert, and Vaikuntanathan (ST...
Vadim Lyubashevsky
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...