Sciweavers

326 search results - page 11 / 66
» Digital Signature Scheme Based on a New Hard Problem
Sort
View
IJNSEC
2007
128views more  IJNSEC 2007»
13 years 7 months ago
LFSR-based Signatures with Message Recovery
In order to reduce key sizes and bandwidth, several LFSRbased (linear feedback shift register) public key cryptosystems and signature schemes have been proposed. Digital signature...
Xiangxue Li, Dong Zheng, Kefei Chen
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 11 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
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
SETA
2004
Springer
122views Mathematics» more  SETA 2004»
14 years 27 days ago
New LFSR-Based Cryptosystems and the Trace Discrete Log Problem (Trace-DLP)
In order to reduce key sizes and bandwidth, cryptographic systems have been proposed using minimal polynomials to represent finite field elements. These systems are essentially e...
Kenneth J. Giuliani, Guang Gong
WWW
2005
ACM
14 years 8 months ago
An abuse-free fair contract signing protocol based on the RSA signature
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
Guilin Wang