搜索结果: 1-14 共查到“密码学 Commitment Scheme”相关记录14条 . 查询时间(0.072 秒)
Transparent Polynomial Commitment Scheme with Polylogarithmic Communication Complexity
polynomial commitments zero-knowledge proofs proximity testing
2019/9/16
We introduce novel efficient and transparent construction of the polynomial commitment scheme. A polynomial commitment scheme allows one side (the prover) to commit to a polynomial of predefined degre...
A Post-Quantum UC-Commitment Scheme in the Global Random Oracle Model from Code-Based Assumptions
Commitment Scheme Universal Composability
2019/2/27
In this work, we propose the first post-quantum UC-commitment scheme in the Global Random Oracle Model, where only one non-programmable random oracle is available. The security of our proposal is base...
Unconditionally secure multi-party quantum commitment scheme
public-key cryptography quantum information
2017/12/19
A new unconditionally secure multi-party quantum commitment is proposed in this paperby encoding the committed message to the phase of a quantum state. Multi-party means that there are more than one r...
Efficient, Round-optimal, Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security
Oblivious Transfer Commitment Schemes Universal Composability
2017/12/1
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it m...
An Unconditionally Hiding and Long-Term Binding Post-Quantum Commitment Scheme
unconditionally hiding commitments post-quantum lattice-based cryptography
2015/12/29
Commitment schemes are among cryptography’s most important
building blocks. Besides their basic properties, hidingness and
bindingness, for many applications it is important that the schemes applied...
A Perfectly Binding Commitment Scheme Against Quantum Attacks
secret-key cryptography / commitment scheme lattice quantum attack
2012/3/28
It's known that perfectly binding quantum computationally hiding commitment schemes can be constructed from any quantum one-way permutation. Since no quantum one-way permutations are known, it has bee...
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 ...
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
commitment schemes adaptivity deniability
2009/11/18
It is known that composable secure commitments, that is, concurrent non-malleable commitments
exist in the plain model, based only on standard assumptions such as the existence of claw-free
permutat...
An Efficient Adaptive-Deniable-Concurrent Non-malleable Commitment Scheme
commitment schemes adaptivity deniability
2009/11/18
It is known that composable secure commitments, that is, concurrent non-malleable commitments
exist in the plain model, based only on standard assumptions such as the existence of claw-free
permutat...
Perfectly Hiding Commitment Scheme with Two-Round from Any One-Way Permutation
Cryptography perfectly iding commitments one-way permutation
2009/6/2
Commitment schemes are arguably among the most important and useful primitives in cryp-
tography. According to the computational power of receivers, commitments can be classi¯ed
into three poss...
the authors give the first mathematical formalization of an unconditionally secure commitment scheme. Their construction has some similarities to one used to build authentication codes, so they raise ...
An Efficient Range-Bounded Commitment Scheme
range-bounded commitment knowledge of a discrete logarithm zeroknowledge proof
2008/7/31
Checking whether a committed integer lies in a specific interval has many
cryptographic applications. In Eurocrypt'98, Chan et al. proposed an instantiation
(CFT for short). Based on CFT, Boudot pre...
An E±cient Range-Bounded Commitment Scheme
range-bounded commitment knowledge of a discrete logarithm zero-knowledge proof
2008/5/26
Checking whether a committed integer lies in a speci¯c interval has many
cryptographic applications. In Eurocrypt'98, Chan et al. proposed an instantiation
(CFT for short). Based on CFT, Boudot...