An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (Q3012992): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/978-3-642-22497-3_17 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W1267745471 / rank | |||
Normal rank | |||
Latest revision as of 00:07, 20 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem |
scientific article |
Statements
An Efficient Rational Secret Sharing Scheme Based on the Chinese Remainder Theorem (English)
0 references
7 July 2011
0 references
rational cryptography
0 references
computational strict Nash equilibrium
0 references
stability with respect to trembles
0 references
Asmuth-Bloom sharing scheme
0 references
