RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS
From MaRDI portal
Publication:5401562
DOI10.1142/S012905411350024XzbMath1283.94106MaRDI QIDQ5401562
Publication date: 10 March 2014
Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)
Applications of game theory (91A80) Network protocols (68M12) Authentication, digital signatures and secret sharing (94A62) Decision theory for games (91A35)
Related Items (1)
Cites Work
- Utility dependence in correct and fair rational secret sharing
- A new \((t,n)\) multi-secret sharing scheme based on Shamir's secret sharing
- How to share a secret
- AN EFFICIENT AND INFORMATION THEORETICALLY SECURE RATIONAL SECRET SHARING SCHEME BASED ON SYMMETRIC BIVARIATE POLYNOMIALS
- Secret sharing schemes from three classes of linear codes
- Multiplicative Linear Secret Sharing Schemes Based on Connectivity of Graphs
- The Byzantine Generals Problem
This page was built for publication: RATIONAL MULTI-SECRET SHARING SCHEME IN STANDARD POINT-TO-POINT COMMUNICATION NETWORKS