A rational secret sharing protocol with unconditional security in the synchronous setting

DOI10.1007/978-3-642-39059-3_28zbMATH Open1319.94097OpenAlexW127548531MaRDI QIDQ5300960FDOQ5300960

Authors: Yang Yu, Zhanfei Zhou 

Publication date: 28 June 2013

Published in: Information Security and Privacy (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-39059-3_28

Recommendations

• Unconditionally secure rational secret sharing in standard communication networks
• An efficient rational secret sharing protocol resisting against malicious adversaries over synchronous channels
• An efficient rational secret sharing scheme based on the Chinese remainder theorem
• Efficient rational secret sharing in standard communication networks
• An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials

zbMATH Keywords

synchronousunconditionally securecoalitionstrict Nash equilibriumrational secret sharing

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)

Cited In (8)

• UNCONDITIONALLY SECURE FAIR (t-n)-SECRET SHARING SCHEME
• An efficient rational secret sharing protocol resisting against malicious adversaries over synchronous channels
• Unconditionally secure rational secret sharing in standard communication networks
• Scalable rational secret sharing
• Title not available (Why is that?)
• An efficient rational secret sharing scheme based on the Chinese remainder theorem
• Efficient rational secret sharing in standard communication networks
• An efficient and information theoretically secure rational secret sharing scheme based on symmetric bivariate polynomials

This page was built for publication: A rational secret sharing protocol with unconditional security in the synchronous setting

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300960)