Proxy signatures for delegating signing operation
CCS '96 Proceedings of the 3rd ACM conference on Computer and communications security
Proactive public key and signature systems
Proceedings of the 4th ACM conference on Computer and communications security
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
On Zhang's Nonrepudiable Proxy Signature Schemes
ACISP '98 Proceedings of the Third Australasian Conference on Information Security and Privacy
ICICS '97 Proceedings of the First International Conference on Information and Communication Security
Society and Group Oriented Cryptography: A New Concept
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Shared Generation of Authenticators and Signatures (Extended Abstract)
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
A Practical (t, n) Threshold Proxy Signature Scheme Based on the RSA Cryptosystem
IEEE Transactions on Knowledge and Data Engineering
An efficient and practical (t, n) threshold proxy signature scheme with known signers
Fundamenta Informaticae
An efficient nonrepudiable threshold proxy signature scheme with known signers
Computer Communications
Security Analysis of the Pomykala-Barabasz Scheme
Fundamenta Informaticae
The Diffie---Hellman Problem in Lie Algebras
RSEISP '07 Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms
Breaking Pomykala-Barabasz Threshold Proxy Signature Scheme
Fundamenta Informaticae
Strongly unforgeable proxy signature scheme secure in the standard model
Journal of Systems and Software
Hi-index | 0.00 |
In the article we present a new (t,n) threshold proxy signature scheme with known signers. It is based on the elliptic curve cryptosystem whose security refers to the discrete logarithm problem (DLP) in the group E(E$_p$) of rational points of elliptic curve over the finite field. In comparision to similar schemes based on the RSA or DSS systems our solution requires application of significantly shorter cryptographic keys. The scheme is relatively simple in construction, has the property of unforgeability, non-repudation and admits the proactive security.