Article

The optimized key distribution scheme in threshold RSA

Authors:

CUI Jing-Song,

Peng Rong,

Wang Li-NaAuthors Info & Claims

InfoSecu '04: Proceedings of the 3rd international conference on Information security

Pages 18 - 21

https://doi.org/10.1145/1046290.1046295

Published: 14 November 2004 Publication History

Get Access

Abstract

The (t, n) threshold RSA algorithm enables the system to keep the security and availability of the private key without a trusted dealer when parts of system are already under attack. In the traditional threshold RSA sub key distribution scheme, each party that shares the private key must keeps C^t_nsub keys secretly in order to enable the whole system to reconstruct the original private key by any t out of n parties. This paper presents a scalable searching algorithm, which can find out the optimized sub key distribution scheme that can significantly decrease the number of sub keys that should be held by each party without weakening the system's security. Thus it can reduce the complexity of key management and related operations.

References

[1]

Dan Boneh, Matthew Franklin, Efficient Generation of Shared RSA keys, Proc. Of Crypto'97, Springer-Verlag LNCS 1233.

Digital Library

Google Scholar

[2]

T. Rabin, A simplified approach to threshold and proactive RSA, in H. Krawczyk (ed.), CRYPTO '98, Springer LNCS 1462 (1998) 89--104.

Digital Library

Google Scholar

[3]

Michael Malkin, Thomas Wu, Dan Boneh, Experimenting with Shared Generation of RSA keys, Proceedings of the Internet Society's 1999 Symposium on Network and Distributed System Security (SNDSS)

Google Scholar

[4]

Thomas Wu, Michael Malkin, Dan Boneh, Building Intrusion Tolerant Applications, In Proceedings of the 8th USENIX Security Symposium, pages 79--91

Digital Library

Google Scholar

Index Terms

The optimized key distribution scheme in threshold RSA

Recommendations

Robust and Efficient Sharing of RSA Functions

We present two efficient protocols which implement robust threshold RSA signature schemes, where the power to sign is shared by N players such that any subset of T+1 or more signers can collaborate to produce a valid RSA signature on any given message,...
Threshold Undeniable RSA Signature Scheme
ICICS '01: Proceedings of the Third International Conference on Information and Communications Security

Undeniable signature has been extensively researched after Chaum and Antwerpen first proposed the concept of this special digital signature ten years ago. Up to now, however, almost all the existed schemes are based on discrete logarithm cryptosystems. ...
Provably secure non-interactive key distribution based on pairings
Special issue: Coding and cryptography

We define a security notion for non-interactive key distribution protocols. We identify an apparently hard computational problem related to pairings, the Bilinear Diffie-Hellman problem (BDH). After extending Sakai, Ohgishi, and Kasahara's pairing based ...

Comments

Information & Contributors

Information

Published In

InfoSecu '04: Proceedings of the 3rd international conference on Information security

November 2004

266 pages

ISBN:1581139551

DOI:10.1145/1046290

Conference Chairs:
John R. White
ACM
,
Huanye Sheng
SCS

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 November 2004

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Article

Conference

INFOSECU04

Sponsor:

INFOSECU04: International Conference on Information Security

November 14 - 16, 2004

Shanghai, China

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

0
Total Citations
263
Total Downloads

Downloads (Last 12 months)1
Downloads (Last 6 weeks)1

Reflects downloads up to 09 Jan 2025

Other Metrics

View Author Metrics

Citations

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Index Terms

Recommendations

Robust and Efficient Sharing of RSA Functions

Threshold Undeniable RSA Signature Scheme

Provably secure non-interactive key distribution based on pairings