Security and Privacy in Communication Networks. 6th Iternational ICST Conference, SecureComm 2010, Singapore, September 7-9, 2010. Proceedings

Research Article

Impossibility of Finding Any Third Family of Server Protocols Integrating Byzantine Quorum Systems with Threshold Signature Schemes

Download158 downloads
  • @INPROCEEDINGS{10.1007/978-3-642-16161-2_18,
        author={Jingqiang Lin and Peng Liu and Jiwu Jing and Qiongxiao Wang},
        title={Impossibility of Finding Any Third Family of Server Protocols Integrating Byzantine Quorum Systems with Threshold Signature Schemes},
        proceedings={Security and Privacy in Communication Networks. 6th Iternational ICST Conference, SecureComm 2010, Singapore, September 7-9, 2010. Proceedings},
        proceedings_a={SECURECOMM},
        year={2012},
        month={5},
        keywords={Byzantine fault tolerance Byzantine quorum systems threshold signature schemes},
        doi={10.1007/978-3-642-16161-2_18}
    }
    
  • Jingqiang Lin
    Peng Liu
    Jiwu Jing
    Qiongxiao Wang
    Year: 2012
    Impossibility of Finding Any Third Family of Server Protocols Integrating Byzantine Quorum Systems with Threshold Signature Schemes
    SECURECOMM
    Springer
    DOI: 10.1007/978-3-642-16161-2_18
Jingqiang Lin, Peng Liu1, Jiwu Jing2, Qiongxiao Wang2
  • 1: The Pennsylvania State University
  • 2: Graduate University of CAS

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 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 to find any third family of valid TSS-BQS systems. To obtain this proof, we develop a 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.