Sciweavers

346 search results - page 16 / 70
» Security Arguments for Digital Signatures and Blind Signatur...
Sort
View
IJNSEC
2007
118views more  IJNSEC 2007»
15 years 1 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
133
Voted
ACNS
2007
Springer
129views Cryptology» more  ACNS 2007»
15 years 8 months 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
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
15 years 5 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
ISW
1997
Springer
15 years 5 months ago
Signcryption and Its Applications in Efficient Public Key Solutions
Signcryption is a new paradigm in public key cryptography that simultaneously fulfills both the functions of digital signature and public key encryption in a logically single step,...
Yuliang Zheng
WAIFI
2007
Springer
110views Mathematics» more  WAIFI 2007»
15 years 7 months ago
On Kabatianskii-Krouk-Smeets Signatures
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of ...
Pierre-Louis Cayrel, Ayoub Otmani, Damien Vergnaud