Two efficient and provably secure schemes for server-assisted threshold signatures

Authors:
Shouhuai Xu;Ravi Sandhu
Affiliations:
Department of Information and Computer Science, University of California at Irvine;SingleSignOn.Net and Laboratory for Information Security Technology, George Mason University
Venue:
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Year:
2003

Citing 5
Cited 6

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms

The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
A survey of fast exponentiation methods

Journal of Algorithms
Elliptic curves in cryptography

Elliptic curves in cryptography
Efficient Algorithms for Pairing-Based Cryptosystems

CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
The Weil and Tate Pairings as Building Blocks for Public Key Cryptosystems

ANTS-V Proceedings of the 5th International Symposium on Algorithmic Number Theory

Exploiting social networks for threshold signing: attack-resilience vs. availability

Proceedings of the 2008 ACM symposium on Information, computer and communications security
A scalable and secure cryptographic service

Proceedings of the 21st annual IFIP WG 11.3 working conference on Data and applications security
Password-protected secret sharing

Proceedings of the 18th ACM conference on Computer and communications security
A proactive secret sharing for server assisted threshold signatures

HPCC'06 Proceedings of the Second international conference on High Performance Computing and Communications
Distributing security-mediated PKI revisited

EuroPKI 2006 Proceedings of the Third European conference on Public Key Infrastructure: theory and Practice
Securing admission control in ubiquitous computing environment

ICN'05 Proceedings of the 4th international conference on Networking - Volume Part II

Quantified Score

Hi-index	0.01

Visualization

Abstract

We present an algorithm which speeds scalar multiplication on a general elliptic curve by an estimated 3.8% to 8.5% over the best known general methods when using affine coordinates. This is achieved by eliminating a field multiplication when we compute 2P +Q from given points P, Q on the curve. We give applications to simultaneous multiple scalar multiplication and to the Elliptic Curve Method of factorization. We show how this improvement together with another idea can speed the computation of the Weil and Tate pairings by up to 7.8%.