Interactive Verifiable Secret Sharing Scheme
Commitment schemes, secret sharing schemes, interactive zero-knowledge proofs which underlie the offered interactive secrete sharing schemes are considered. Besides independent interest such schemes are one of the main computing primitives in the theory of secure computations. Base elements of the t...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Joint Stock Company "Experimental Scientific and Production Association SPELS
2011-03-01
|
| Series: | Безопасность информационных технологий |
| Subjects: | |
| Online Access: | https://bit.mephi.ru/index.php/bit/article/view/644 |
| _version_ | 1827845927112540160 |
|---|---|
| author | O.V. Kazarin |
| author_facet | O.V. Kazarin |
| author_sort | O.V. Kazarin |
| collection | DOAJ |
| description | Commitment schemes, secret sharing schemes, interactive zero-knowledge proofs which underlie the offered interactive secrete sharing schemes are considered. Besides independent interest 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. |
| first_indexed | 2024-03-12T09:06:24Z |
| format | Article |
| id | doaj.art-1adda698a2fd441fb6e791f5040b6600 |
| institution | Directory Open Access Journal |
| issn | 2074-7128 2074-7136 |
| language | English |
| last_indexed | 2024-03-12T09:06:24Z |
| publishDate | 2011-03-01 |
| publisher | Joint Stock Company "Experimental Scientific and Production Association SPELS |
| record_format | Article |
| series | Безопасность информационных технологий |
| spelling | doaj.art-1adda698a2fd441fb6e791f5040b66002023-09-02T15:15:55ZengJoint Stock Company "Experimental Scientific and Production Association SPELSБезопасность информационных технологий2074-71282074-71362011-03-011816167634Interactive Verifiable Secret Sharing SchemeO.V. KazarinCommitment schemes, secret sharing schemes, interactive zero-knowledge proofs which underlie the offered interactive secrete sharing schemes are considered. Besides independent interest 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.https://bit.mephi.ru/index.php/bit/article/view/644cryptographic protocolscryptographic primitivesinteractive zero-knowledge proofssecrete sharing schemes |
| spellingShingle | O.V. Kazarin Interactive Verifiable Secret Sharing Scheme Безопасность информационных технологий cryptographic protocols cryptographic primitives interactive zero-knowledge proofs secrete sharing schemes |
| title | Interactive Verifiable Secret Sharing Scheme |
| title_full | Interactive Verifiable Secret Sharing Scheme |
| title_fullStr | Interactive Verifiable Secret Sharing Scheme |
| title_full_unstemmed | Interactive Verifiable Secret Sharing Scheme |
| title_short | Interactive Verifiable Secret Sharing Scheme |
| title_sort | interactive verifiable secret sharing scheme |
| topic | cryptographic protocols cryptographic primitives interactive zero-knowledge proofs secrete sharing schemes |
| url | https://bit.mephi.ru/index.php/bit/article/view/644 |
| work_keys_str_mv | AT ovkazarin interactiveverifiablesecretsharingscheme |