Browse by author
Lookup NU author(s): Professor Feng Hao
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Threshold password-authenticated secret sharing (TPASS) protocols allow a client to secret-share a secret s among n servers and protect it with a password pw, so that the client can later recover s from any subset of t of the servers using the password pw, but so that no coalition smaller than t learns anything about s or can mount an offline dictionary attack on the password pw. Some TPASS protocols have appeared in the literature recently. The protocol by Bagherzandi et al. (CCS 2011) leaks the password if a client mistakenly executes the protocol with malicious servers. The first t-out-of-n TPASS protocol for any n > t that does not suffer from this shortcoming was given by Camenisch et al. (CRYPTO 2014). This protocol, proved to be secure in the UC framework, requires the client to involve in many communication rounds so that it becomes impractical for the client. In this paper, we present a practical TPASS protocol which is in particular efficient for the client, who only needs to send a request and receive a response. In addition, we have provided a rigorous proof of security for our protocol in the standard model.
Author(s): Yi X, Hao F, Chen LQ, Liu JK
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: Computer Security (ESORICS 2015)
Year of Conference: 2015
Online publication date: 13/01/2016
Acceptance date: 01/01/1900
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science