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: | O. V. Kazarin |
---|---|
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 |
Similar Items
-
Interactive Verifiable Secret Sharing Scheme
by: O.V. Kazarin
Published: (2011-03-01) -
cryptographic Primitives: Insertions, Examples and Open Problems
by: Stanislav Olegovich Dordzhiev, et al.
Published: (2014-02-01) -
A Shared-Key Security Protocol and Its Flaw
by: Waseem Akhtar Mufti
Published: (2005-06-01) -
SECURE VISUAL SECRET SHARING BASED ON DISCRETE WAVELET TRANSFORM
by: S. Jyothi Lekshmi, et al.
Published: (2015-08-01) -
Statistical assessment – as a part of security assessment applied to a block cipher
by: Ioana Roxana Dragomir, et al.
Published: (2016-09-01)