Reconstruction methodology for rational secret sharing based on mechanism design

1. Halpern J, Teague V. Rational secret sharing and multiparty computation: extended abstract. In: Proceedings of the 36th Annual ACM Symposium on Theory of Computing, Chicago, 2004. 623–632

   MATH  Google Scholar 

2. Osborn M J, Rubinstein A. A Course in Game Theory. Cambridge: MIT Press, 1994

   Google Scholar 

3. Shamir A. How to share a secret. Commun ACM, 1979, 22: 612–613

   Article  MathSciNet  MATH  Google Scholar 

4. Asharov G, Lindell Y. Utility dependence in correct and fair rational secret sharing. J Cryptol, 2011, 24: 157–202

   Article  MathSciNet  MATH  Google Scholar 

5. Ong S J, Parkes D C, Rosen A, et al. Fairness with an honest minority and a rational majority. In: Proceedings of the 6th Theory of Cryptography Conference, San Francisco, 2009. 36–53

   MATH  Google Scholar 

6. Sourya J D, Asim K P. Achieving correctness in fair rational secret sharing. In: Proceedings of the 12th International Conference on Cryptology and Network Security, Paraty, 2013. 139–161

   Google Scholar 

7. Nisan N, Ronen A. Algorithmic mechanism design. Games Econ Behavior, 2001, 35: 166–196

   Article  MathSciNet  MATH  Google Scholar 

8. Fuchsbauer G, Katz J, Naccache D. Efficient secret sharing in the standard communication model. In: Proceedings of the 7th Theory of Cryptography Conference, Zurich, 2010. 419–436

   MATH  Google Scholar 

9. Asmuth C, Bloom J. A modular approach to key safeguarding. IEEE Trans Inf Theory, 1983, 29: 208–210

   Article  MathSciNet  Google Scholar 

Download references