TY - GEN
T1 - On cheater identifiable secret sharing schemes secure against rushing adversary
AU - Xu, Rui
AU - Morozov, Kirill
AU - Takagi, Tsuyoshi
PY - 2013
Y1 - 2013
N2 - At EUROCRYPT 2011, Obana proposed a k-out-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 - ε under the condition t < k/3. In that scheme, the share size |Vi| satisfies |Vi| = |S|/ε, which is almost optimal. However, Obana's scheme is known to be vulnerable to attacks by rushing adversary who can observe the messages sent by the honest participants prior to deciding her own messages. In this paper, we present a new scheme, which is secure against rushing adversary, with |Vi| = |S|/εn-t+1, assuming t < k/3. We note that the share size of our proposal is substantially smaller compared to |V i| = |S|(t + 1)3n/ε3n in the scheme by Choudhury at PODC 2012 when the secret is a single field element. A modification of the later scheme is secure against rushing adversary under a weaker t < k/2 condition. Therefore, our scheme demonstrates an improvement in share size achieved for the price of strengthening the assumption on t.
AB - At EUROCRYPT 2011, Obana proposed a k-out-of-n secret sharing scheme capable of identifying up to t cheaters with probability 1 - ε under the condition t < k/3. In that scheme, the share size |Vi| satisfies |Vi| = |S|/ε, which is almost optimal. However, Obana's scheme is known to be vulnerable to attacks by rushing adversary who can observe the messages sent by the honest participants prior to deciding her own messages. In this paper, we present a new scheme, which is secure against rushing adversary, with |Vi| = |S|/εn-t+1, assuming t < k/3. We note that the share size of our proposal is substantially smaller compared to |V i| = |S|(t + 1)3n/ε3n in the scheme by Choudhury at PODC 2012 when the secret is a single field element. A modification of the later scheme is secure against rushing adversary under a weaker t < k/2 condition. Therefore, our scheme demonstrates an improvement in share size achieved for the price of strengthening the assumption on t.
UR - http://www.scopus.com/inward/record.url?scp=84891951784&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84891951784&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-41383-4_17
DO - 10.1007/978-3-642-41383-4_17
M3 - Conference contribution
AN - SCOPUS:84891951784
SN - 9783642413827
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 258
EP - 271
BT - Advances in Information and Computer Security - 8th International Workshop on Security, IWSEC 2013, Proceedings
T2 - 8th International Workshop on Security, IWSEC 2013
Y2 - 18 November 2013 through 20 November 2013
ER -