搜索结果: 1-15 共查到“军事学 Verifiable Secret Sharing”相关记录15条 . 查询时间(0.185 秒)
Non-Interactive Verifiable Secret Sharing For Monotone Circuits
cryptographic protocols computational secret-sharing
2016/2/24
We propose a computationally secure and non-interactive verifiable secret sharing scheme
that can be efficiently constructed from any monotone Boolean circuit. By non-interactive we mean that
the de...
Dealer-Leakage Resilient Verifiable Secret Sharing
secret sharing Verifiable Secret Sharing
2016/1/7
Verifiable Secret Sharing (VSS) guarantees that honest parties reconstruct a consistent secret even in
the presence of a malicious dealer that distributes invalid shares. We empower the dishonest dea...
Computational Verifiable Secret Sharing Revisited
cryptographic protocols / Verifiable Secret Sharing Round Complexity Commitments Homomorphism
2012/3/28
Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that allows a dealer to share a secret among n parties in the presence of an adversary controlling at most t of th...
Computational Verifiable Secret Sharing Revisited
Verifiable Secret Sharing Round Complexity Commitments Homomorphism
2011/6/9
Verifiable secret sharing (VSS) is an important primitive in distributed cryptography that allows a dealer to share a secret among n parties in the presence of an adversary controlling at most t of th...
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme
Secret Sharing Asynchronous Network Information Theoretic Security
2011/1/20
In this paper, we propose a new asynchronous primitive called asynchronous weak commitment scheme} (AWCS), which has weaker requirements than AWSS and which is first of its kind. Due to its weaker req...
Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme
cryptographic protocols
2012/3/30
In this paper, we consider the problem of statistical Asynchronous Verifiable Secret Sharing (AVSS) with optimal resilience, involving n = 3t+1 parties over a completely asynchronous network, who are ...
A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
Secret sharing non-interactive PVSS general Diffie-Hellman exponent problem
2010/9/26
A publicly verifiable secret sharing (PVSS) scheme, proposed by Stadler in \cite{DBLP:conf/eurocrypt/Stadler96}, is a VSS scheme in which anyone, not only the shareholders, can verify that the secret ...
Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation
Verifiable Secret Byzantine Agreement Multiparty Computation
2010/7/13
In brief, our work in this thesis has made significant advancement in the state-of-the-art research on VSS, BA and MPC by presenting several inherent lower bounds and efficient/optimal solutions for t...
Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience
Asynchronous Networks AVSS Optimal Resilience
2009/11/18
In this paper, we present a new statistical asynchronous verifiable secret sharing (AVSS) protocol
with optimal resilience; i.e. with n = 3t+1, where n is the total number of participating parties an...
Universally Composable and Statistically Secure Verifiable Secret Sharing Scheme Based on Pre-Distributed Data
Verifiable Secret Sharing Dishonest Majority Pre-distributed Data
2009/6/15
This paper presents a non-interactive verifiable secret sharing
scheme (VSS) tolerating a dishonest majority based on data predistributed
by a trusted authority. As an application of this VSS scheme...
Asynchronous Verifiable Secret Sharing and Proactive Cryptosystems
Asynchronous Verifiable Secret Proactive Cryptosystems
2009/4/15
Verifiable secret sharing is an important primitive in distributed cryptography. With the growing
interest in the deployment of threshold cryptosystems in practice, the traditional assumption of a
s...
A Verifiable Secret Sharing Scheme with Statistical Zero-Knowledge
secret sharing verifiable secret sharing statistical zero-knowledge
2009/4/10
In this paper, we first propose a protocol in which the prover can
show that a = b holds for two committed integers a and b; also, we
present a protocol in which the prover can prove that a 6= 0 hol...
On a Relation Between Verifiable Secret Sharing Schemes and a Class of Error-Correcting Codes
Verifiable Secret Sharing Schemes Error-Correcting Codes
2009/4/10
In this paper we try to shed a new insight on Verifiable Secret Sharing
Schemes (VSS). We first define a new “metric” (with slightly different properties
than the standard Hamming metric). Using thi...
On alternative approach for verifiable secret sharing
alternative approach verifiable secret sharing
2009/4/8
approach works for any underlying secret sharing scheme. It is based on the concept of verification sets of participants, related to authorized set of participants.
The participants interact (no thir...
Non-Interactive and Information-Theoretic Secure Publicly Verifiable Secret Sharing
secret sharing publicly verifiable secret sharing information-theoretic
2009/3/27
A publicly verifiable secret sharing scheme is more applicable than a verifiable secret
sharing because of the property that the validity of the shares distributed by the dealer can
be verified by a...