On distributed cryptographic protocols for threshold RSA signing and decrypting with no dealer

Shingo Miyazaki, Kouichi Sakurai, Moti Yung

Research output: Contribution to journalArticle

1 Citation (Scopus)

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.

Original languageEnglish
Pages (from-to)1177-1184
Number of pages8
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE84-A
Issue number5
Publication statusPublished - Jan 1 2001

Fingerprint

Distributed Protocol
Cryptographic Protocols
Shareholders
Key Distribution
Attack
Demonstrate

All Science Journal Classification (ASJC) codes

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Cite this

On distributed cryptographic protocols for threshold RSA signing and decrypting with no dealer. / Miyazaki, Shingo; Sakurai, Kouichi; Yung, Moti.

In: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences, Vol. E84-A, No. 5, 01.01.2001, p. 1177-1184.

Research output: Contribution to journalArticle

@article{8d21b7d8768747aaa1a9129d9ded477b,
title = "On distributed cryptographic protocols for threshold RSA signing and decrypting with no dealer",
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.",
author = "Shingo Miyazaki and Kouichi Sakurai and Moti Yung",
year = "2001",
month = "1",
day = "1",
language = "English",
volume = "E84-A",
pages = "1177--1184",
journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
issn = "0916-8508",
publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
number = "5",

}

TY - JOUR

T1 - On distributed cryptographic protocols for threshold RSA signing and decrypting with no dealer

AU - Miyazaki, Shingo

AU - Sakurai, Kouichi

AU - Yung, Moti

PY - 2001/1/1

Y1 - 2001/1/1

N2 - 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.

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.

UR - http://www.scopus.com/inward/record.url?scp=0035338664&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035338664&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0035338664

VL - E84-A

SP - 1177

EP - 1184

JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

SN - 0916-8508

IS - 5

ER -