Realistic versus Rational Secret Sharing
From MaRDI portal
Publication:3297660
DOI10.1007/978-3-030-32430-8_10zbMath1452.94101arXiv1908.07581OpenAlexW2982651463MaRDI QIDQ3297660
Yvo G. Desmedt, Arkadii M. Slinko
Publication date: 20 July 2020
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1908.07581
Cites Work
- Unnamed Item
- Unnamed Item
- Non-cooperative computation: Boolean functions with correctness and exclusivity
- Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
- How to share a secret
- Rational Secret Sharing, Revisited
- Rational secret sharing and multiparty computation
- Perfectly secure message transmission
- Socio-Rational Secret Sharing as a New Direction in Rational Cryptography
- Truly Efficient $2$-Round Perfectly Secure Message Transmission Scheme
- Perfectly-Secure MPC with Linear Communication Complexity
- Cryptography and Game Theory: Designing Protocols for Exchanging Information