搜索结果: 1-6 共查到“军事学 VSS”相关记录6条 . 查询时间(0.109 秒)
We present a new compact verifiable secret sharing scheme,
based on this we present the first construction of a homomorphic UC
commitment scheme that requires only cheap symmetric cryptography,
exc...
The Round Complexity of General VSS
Round Complexity VSS Non-threshold Byzantine Unbounded Computing Power
2010/11/30
The round complexity of verifiable secret sharing (VSS) schemes has been studied extensively for threshold adversaries. In particular, Fitzi et al. showed an efficient 3-round VSS for $n \geq 3t+1$ \c...
Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience
Verifiable Secret Sharing Multiparty Computation
2010/1/18
Verifiable Secret Sharing (VSS) is a fundamental primitive
used in many distributed cryptographic tasks, such as Multiparty Computation
(MPC) and Byzantine Agreement (BA). It is a two phase (sharing...
On Round Complexity of Unconditionally Secure VSS
Verifiable Secret Sharing Error Probability Information Theoretic Security
2009/6/3
In this work, we initiate the study of round complexity of unconditionally secure weak secret
sharing (UWSS) and unconditionally secure veri¯able secret sharing (UVSS) 1 in the presence of an
a...
Adaptively Secure Feldman VSS and Applications to Universally-Composable Threshold Cryptography
Adaptively Secure Feldman VSS Universally-Composable Threshold Cryptography
2009/3/26
We propose the first distributed discrete-log key generation (DLKG) protocol from
scratch which is adaptively-secure in the non-erasure model, and at the same time completely
avoids the use of inter...
Improving the Round Complexity of VSS in Point-to-Point Networks
VSS Point-to-Point Networks Round Complexity
2008/5/28
We revisit the following question: what is the optimal round complexity of verifiable secret
sharing (VSS)?We focus here on the case of perfectly-secure VSS where the number of corrupted
parties t s...
