Shared Secret Reconstruction

Authors:
Jingmin He;Ed Dawson
Affiliations:
Information Security Research Center, Queensland University of Technology, Gardens Point, GPO Box 2434, Brisbane QLD 4001, Australia;Information Security Research Center, Queensland University of Technology, Gardens Point, GPO Box 2434, Brisbane QLD 4001, Australia
Venue:
Designs, Codes and Cryptography
Year:
1998

Citing 11
Cited 1

Fair exchange of secrets

Proceedings of CRYPTO 84 on Advances in cryptology
Verifiable secret sharing and multiparty protocols with honest majority

STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Robust sharing of secrets when the dealer is honest or cheating

Journal of the ACM (JACM)
How to share a secret

Communications of the ACM
Multiparty Computations Ensuring Privacy of Each Party's Input and Correctness of the Result

CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
The Detection of Cheaters in Threshold Schemes

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Generalized Secret Sharing and Monotone Functions

CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Fair Computation of General Functions in Presence of Immoral Majority

CRYPTO '90 Proceedings of the 10th Annual International Cryptology Conference on Advances in Cryptology
Verifiable secret sharing and achieving simultaneity in the presence of faults

SFCS '85 Proceedings of the 26th Annual Symposium on Foundations of Computer Science
How to generate and exchange secrets

SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Multiparty computation with faulty majority

SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science

Detection and identification of cheaters in (t, n) secret sharing scheme

Designs, Codes and Cryptography

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we consider the secret reconstructionproblem in a secret sharing scheme. We emphasize that a sharedsecret should be reconstructed in a fair way, i.e., all involvedparticipants should have the same chance to be able to reconstructthe shared secret. We propose and analyze several methods toachieve such a fair reconstruction of shared secrets.