EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
An interactive identification scheme based on discrete logarithms and factoring (extended abstract)
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
An interactive identification scheme based on discrete logarithms and factoring
Journal of Cryptology - Eurocrypt '90
SIAM Journal on Computing
New Constructions of Fail-Stop Signatures and Lower Bounds (Extended Abstract)
CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
RSA-Based Fail-Stop Signature Schemes
ICPP '99 Proceedings of the 1999 International Workshops on Parallel Processing
A computational introduction to number theory and algebra
A computational introduction to number theory and algebra
Provably secure fail-stop signature schemes based on RSA
International Journal of Wireless and Mobile Computing
Collision-free accumulators and fail-stop signature schemes without trees
EUROCRYPT'97 Proceedings of the 16th annual international conference on Theory and application of cryptographic techniques
How intractable is the discrete logarithm for a general finite group?
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Identity-based partial message recovery signatures (or how to shorten ID-Based signatures)
FC'05 Proceedings of the 9th international conference on Financial Cryptography and Data Security
New directions in cryptography
IEEE Transactions on Information Theory
Provably secure pairing-based convertible undeniable signature with short signature length
Pairing'07 Proceedings of the First international conference on Pairing-Based Cryptography
A multisignature scheme based on the SDLP and on the IFP
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
CISIS'11 Proceedings of the 4th international conference on Computational intelligence in security for information systems
Efficient fail-stop signatures from the factoring assumption
ISC'11 Proceedings of the 14th international conference on Information security
Hi-index | 5.23 |
Fail-stop signature (FSS) schemes protect a signer against a forger with unlimited computational power by enabling the signer to provide a proof of forgery, if it occurs. A decade after its invention, there have been several FSS schemes proposed in the literature. Nonetheless, the notion of short FSS scheme has not been addressed yet. Furthermore, the short size in signature schemes has been done mainly with the use of pairings. In this paper, we propose a construction of short FSS scheme based on factorization and discrete logarithm assumption. However, in contrast to the known notion in the literature, our signature scheme does not incorporate any pairing operations. Nonetheless, our scheme is the shortest FSS scheme compared to all existing schemes in the literature that are based on the same assumption. The efficiency of our scheme is comparable to the best known FSS scheme, that is based on the discrete logarithm assumption.