Interactive Verifiable Secret Sharing Scheme
Commitment schemes, secret sharing schemes, interactive zero-knowledge proofs which underlie the offered interactive secrete sharing schemes are considered. Such schemes are one of the main computing primitives in the theory of secure computations. Base elements of the theory of secure computations...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2010-09-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/693 |
| Summary: | Commitment schemes, secret sharing schemes, interactive zero-knowledge proofs which underlie the offered interactive secrete sharing schemes are considered. Such schemes are one of the main computing primitives in the theory of secure computations. Base elements of the theory of secure computations and schemes of construction of synchronous verifiable secrete sharing as schemes of secure function evaluation are resulted. |
|---|---|
| ISSN: | 2074-7128 2074-7136 |