Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes

Jingqiang Lin, Peng Liu, Jiwu Jing, Qiongxiao Wang

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

In order to tolerate servers' Byzantine failures, a distributed storage service of self-verifying data (e.g., certificates) needs to make three security properties be Byzantine fault tolerant (BFT): data consistency, data availability, and confidentiality of the (signing service's) private key. Building such systems demands the integration of Byzantine quorum systems (BQS), which only make data consistency and availability be BFT, and threshold signature schemes (TSS), which only make confidentiality of the private key be BFT. Two families of correct or valid TSS-BQS systems (of which the server protocols carry all the design options) have been proposed in the literature. Motivated by the failures in finding a third family of valid server protocols, we study the reverse problem and formally prove that it is impossible to find any third family of valid TSS-BQS systems. To obtain this proof, we develop a validity theory on server protocols of TSS-BQS systems. It is shown that the only two families of valid server protocols, "predicted" (or deduced) by the validity theory, precisely match the existing protocols.

Original languageEnglish (US)
Title of host publicationSecurity and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings
Pages307-325
Number of pages19
DOIs
StatePublished - Dec 1 2010
Event6th International Conference on Security and Privacy in Communication Networks, SecureComm 2010 - Singapore, Singapore
Duration: Sep 7 2010Sep 9 2010

Publication series

NameLecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering
Volume50 LNICST
ISSN (Print)1867-8211

Other

Other6th International Conference on Security and Privacy in Communication Networks, SecureComm 2010
CountrySingapore
CitySingapore
Period9/7/109/9/10

Fingerprint

Computer systems
Servers
Network protocols
Availability

All Science Journal Classification (ASJC) codes

  • Computer Networks and Communications

Cite this

Lin, J., Liu, P., Jing, J., & Wang, Q. (2010). Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes. In Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings (pp. 307-325). (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 50 LNICST). https://doi.org/10.1007/978-3-642-16161-2_18
Lin, Jingqiang ; Liu, Peng ; Jing, Jiwu ; Wang, Qiongxiao. / Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes. Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings. 2010. pp. 307-325 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).
@inproceedings{e5af30d969ec4039ba551e9b86f9ecc2,
title = "Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes",
abstract = "In order to tolerate servers' Byzantine failures, a distributed storage service of self-verifying data (e.g., certificates) needs to make three security properties be Byzantine fault tolerant (BFT): data consistency, data availability, and confidentiality of the (signing service's) private key. Building such systems demands the integration of Byzantine quorum systems (BQS), which only make data consistency and availability be BFT, and threshold signature schemes (TSS), which only make confidentiality of the private key be BFT. Two families of correct or valid TSS-BQS systems (of which the server protocols carry all the design options) have been proposed in the literature. Motivated by the failures in finding a third family of valid server protocols, we study the reverse problem and formally prove that it is impossible to find any third family of valid TSS-BQS systems. To obtain this proof, we develop a validity theory on server protocols of TSS-BQS systems. It is shown that the only two families of valid server protocols, {"}predicted{"} (or deduced) by the validity theory, precisely match the existing protocols.",
author = "Jingqiang Lin and Peng Liu and Jiwu Jing and Qiongxiao Wang",
year = "2010",
month = "12",
day = "1",
doi = "10.1007/978-3-642-16161-2_18",
language = "English (US)",
isbn = "364216160X",
series = "Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering",
pages = "307--325",
booktitle = "Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings",

}

Lin, J, Liu, P, Jing, J & Wang, Q 2010, Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes. in Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings. Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, vol. 50 LNICST, pp. 307-325, 6th International Conference on Security and Privacy in Communication Networks, SecureComm 2010, Singapore, Singapore, 9/7/10. https://doi.org/10.1007/978-3-642-16161-2_18

Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes. / Lin, Jingqiang; Liu, Peng; Jing, Jiwu; Wang, Qiongxiao.

Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings. 2010. p. 307-325 (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering; Vol. 50 LNICST).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes

AU - Lin, Jingqiang

AU - Liu, Peng

AU - Jing, Jiwu

AU - Wang, Qiongxiao

PY - 2010/12/1

Y1 - 2010/12/1

N2 - In order to tolerate servers' Byzantine failures, a distributed storage service of self-verifying data (e.g., certificates) needs to make three security properties be Byzantine fault tolerant (BFT): data consistency, data availability, and confidentiality of the (signing service's) private key. Building such systems demands the integration of Byzantine quorum systems (BQS), which only make data consistency and availability be BFT, and threshold signature schemes (TSS), which only make confidentiality of the private key be BFT. Two families of correct or valid TSS-BQS systems (of which the server protocols carry all the design options) have been proposed in the literature. Motivated by the failures in finding a third family of valid server protocols, we study the reverse problem and formally prove that it is impossible to find any third family of valid TSS-BQS systems. To obtain this proof, we develop a validity theory on server protocols of TSS-BQS systems. It is shown that the only two families of valid server protocols, "predicted" (or deduced) by the validity theory, precisely match the existing protocols.

AB - In order to tolerate servers' Byzantine failures, a distributed storage service of self-verifying data (e.g., certificates) needs to make three security properties be Byzantine fault tolerant (BFT): data consistency, data availability, and confidentiality of the (signing service's) private key. Building such systems demands the integration of Byzantine quorum systems (BQS), which only make data consistency and availability be BFT, and threshold signature schemes (TSS), which only make confidentiality of the private key be BFT. Two families of correct or valid TSS-BQS systems (of which the server protocols carry all the design options) have been proposed in the literature. Motivated by the failures in finding a third family of valid server protocols, we study the reverse problem and formally prove that it is impossible to find any third family of valid TSS-BQS systems. To obtain this proof, we develop a validity theory on server protocols of TSS-BQS systems. It is shown that the only two families of valid server protocols, "predicted" (or deduced) by the validity theory, precisely match the existing protocols.

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

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

U2 - 10.1007/978-3-642-16161-2_18

DO - 10.1007/978-3-642-16161-2_18

M3 - Conference contribution

SN - 364216160X

SN - 9783642161605

T3 - Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering

SP - 307

EP - 325

BT - Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings

ER -

Lin J, Liu P, Jing J, Wang Q. Impossibility of finding any third family of server protocols integrating Byzantine quorum systems with threshold signature schemes. In Security and Privacy in Communication Networks - 6th Iternational ICST Conference, SecureComm 2010, Proceedings. 2010. p. 307-325. (Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering). https://doi.org/10.1007/978-3-642-16161-2_18