We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. The first solution is a combination of two techniques by [9] and [7] . It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The second solution is another approach making the distributed key distribution simpler and alleviating a burden of each shareholder in comparison with the first scheme. The latter scheme is newly developed technique based on [9] and further inspired by Simmons' protocol-failure of RSA (we believe that it is very interesting that a "protocol failure attack" be turned into a constructive method). Our comparison between these two schemes indicates a new measure of the performance of a distributed cryptographic protocol that consists of multiple stages.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Shingo MIYAZAKI, Kouichi SAKURAI, Moti YUNG, "On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 5, pp. 1177-1183, May 2001, doi: .
Abstract: We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. The first solution is a combination of two techniques by [9] and [7] . It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The second solution is another approach making the distributed key distribution simpler and alleviating a burden of each shareholder in comparison with the first scheme. The latter scheme is newly developed technique based on [9] and further inspired by Simmons' protocol-failure of RSA (we believe that it is very interesting that a "protocol failure attack" be turned into a constructive method). Our comparison between these two schemes indicates a new measure of the performance of a distributed cryptographic protocol that consists of multiple stages.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_5_1177/_p
Copy
@ARTICLE{e84-a_5_1177,
author={Shingo MIYAZAKI, Kouichi SAKURAI, Moti YUNG, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer},
year={2001},
volume={E84-A},
number={5},
pages={1177-1183},
abstract={We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. The first solution is a combination of two techniques by [9] and [7] . It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The second solution is another approach making the distributed key distribution simpler and alleviating a burden of each shareholder in comparison with the first scheme. The latter scheme is newly developed technique based on [9] and further inspired by Simmons' protocol-failure of RSA (we believe that it is very interesting that a "protocol failure attack" be turned into a constructive method). Our comparison between these two schemes indicates a new measure of the performance of a distributed cryptographic protocol that consists of multiple stages.},
keywords={},
doi={},
ISSN={},
month={May},}
Copy
TY - JOUR
TI - On Distributed Cryptographic Protocols for Threshold RSA Signing and Decrypting with No Dealer
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1177
EP - 1183
AU - Shingo MIYAZAKI
AU - Kouichi SAKURAI
AU - Moti YUNG
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 5
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - May 2001
AB - We consider methods for threshold RSA decryption among distributed agencies without any dealer or trusted party. The first solution is a combination of two techniques by [9] and [7] . It demonstrates the feasibility of combining the distributed key generation and the RSA secure function application. The second solution is another approach making the distributed key distribution simpler and alleviating a burden of each shareholder in comparison with the first scheme. The latter scheme is newly developed technique based on [9] and further inspired by Simmons' protocol-failure of RSA (we believe that it is very interesting that a "protocol failure attack" be turned into a constructive method). Our comparison between these two schemes indicates a new measure of the performance of a distributed cryptographic protocol that consists of multiple stages.
ER -