Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters

DOI10.1007/978-3-540-73458-1_11zbMath1213.94148OpenAlexW1596090937MaRDI QIDQ3608911

Toshinori Araki

Publication date: 6 March 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73458-1_11

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Related Items (5)

Ramp secret sharing with cheater identification in presence of rushing cheaters ⋮ Efficient Threshold Secret Sharing Schemes Secure Against Rushing Cheaters ⋮ Cheating detectable threshold scheme against most powerful cheaters for long secrets ⋮ Leakage Resilient Cheating Detectable Secret Sharing Schemes ⋮ Detection and identification of cheaters in \((t,n)\) secret sharing scheme

This page was built for publication: Efficient (k,n) Threshold Secret Sharing Schemes Secure Against Cheating from n − 1 Cheaters