Skip to main content
Conference ProceedingsOPEN ACCESS

Practical threshold signatures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2000) 1807 207-220
DOI: 10.1007/3-540-45539-6_15
561Citations
Citations of this article
164Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We present an RSA threshold signature scheme. The scheme enjoys the following properties: 1. it is unforgeable and robust in the random oracle model, assuming the RSA problem is hard; 2. signature share generation and verification is completely non-interactive; 3. the size of an individual signature share is bounded by a constant times the size of the RSA modulus.

Cite

CITATION STYLE

APA

Shoup, V. (2000). Practical threshold signatures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1807, pp. 207–220). Springer Verlag. https://doi.org/10.1007/3-540-45539-6_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free