搜索结果: 1-9 共查到“VSS”相关记录9条 . 查询时间(0.051 秒)
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...
α稳定分布噪声下基于梯度范数的VSS-NLMP算法
分数低阶统计量 自适应滤波 变步长归一化最小平均p范数算法
2013/5/22
针对α稳定分布噪声环境下的自适应滤波问题，提出一种新的基于梯度范数的变步长归一化最小平均p范数(variable step size normalized least mean p norm, VSS-NLMP)算法。该算法首先对梯度矢量进行加权平滑，以减小梯度噪声的影响，然后利用梯度矢量能够跟踪自适应过程的均方偏差这一特点，利用梯度矢量的欧氏范数控制步长的变化。给出了新算法的迭代过程，然后对其收...
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...
VSS在邮政代理保险项目中的应用研究
配置 管理 标准 保险
2009/7/8
文章介绍了配置管理工作在软件工程中的重要地位、常用的方法 、工作要求以及普遍使用的国际、国内标准，并介绍了邮政代理保险项目使用相关配置管理方法和工具的过程，总结了配置管理工作所取得的经验。
Confirmation of halo substructure using quest rr lyrae data：the new virgo stellar stream (VSS)
halo substructure virgo stellar rr lyrae data
2009/6/25
Confirmation of halo substructure using quest rr lyrae data：the new virgo stellar stream (VSS)。
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...