搜索结果: 16-30 共查到“军事学 commitments”相关记录49条 . 查询时间(0.072 秒)
UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens
universal composability commitments attribute tokens
2016/6/7
Complex cryptographic protocols are often designed from simple cryptographic primitives, such as signature schemes, encryption schemes, verifiable random functions, and zero-knowledge proofs, by bridg...
Concurrent Non-Malleable Commitments (and More) in 3 Rounds
non-malleability commitments PoKs
2016/6/6
The round complexity of commitment schemes secure against man-in-the-middle attacks has
been the focus of extensive research for about 25 years. The recent breakthrough of Goyal,
Pandey and Richelso...
Collapse-binding quantum commitments without random oracles
Quantum cryptography commitments hash functions
2016/5/26
We construct collapse-binding commitments in the standard model. Collapse-binding commitments were introduced by Unruh (Eurocrypt 2016) to model the computational-binding property of commitments again...
Slow Motion Zero Knowledge Identifying With Colliding Commitments
Authentication protocols Zero-Knowledge Proof Systems
2016/4/22
Discrete-logarithm authentication protocols are known to present two interesting features: The first is that the prover's commitment, x=gr, claims most of the prover's computational effort. The second...
On the Composition of Two-Prover Commitments, and Applications to Multi-Round Relativistic Commitments
bit commitment two provers
2016/2/23
We consider the related notions of two-prover and of relativistic
commitment schemes. In recent work, Lunghi et al. proposed a
new relativistic commitment scheme with a multi-round sustain phase
th...
Rate-1, Linear Time and Additively Homomorphic UC Commitments
commitment asymptotic efficiency universal composability
2016/2/23
We propose the first UC commitment scheme for binary
strings with the optimal properties of rate approaching 1 and linear time
(in the amortised sense, using a small number of seed OTs). On top of
...
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...
Additively Homomorphic UC commitments with Optimal Amortized Overhead
universal composability commitment VSS
2016/1/6
We propose the first UC secure commitment scheme with
(amortized) computational complexity linear in the size of the string
committed to. After a preprocessing phase based on oblivious transfer,
th...
Efficient Zero-Knowledge Proofs for Commitments from Learning With Errors over Rings
Commitment Schemes Ring Learning with Errors Zero-Knowledge Proofs of Knowledge
2016/1/6
We design an efficient commitment scheme, and companion zero-knowledge proofs of knowledge,
based on the learning with errors over rings (RLWE) problem. In particular, for rings in which almost all
...
Efficient Generic Zero-Knowledge Proofs from Commitments
cryptographic protocols Zero-knowledge commitments
2016/1/5
Even though Zero-knowledge has existed for more than 30 years, few generic constructions for Zero-knowledge exist. In this paper we present a new kind of commitment scheme on which we build a novel an...
Computationally binding quantum commitments
Quantum commitments computationally binding rewinding
2015/12/31
We present a new definition of computationally binding commitment
schemes in the quantum setting, which we call “collapse-binding”. The definition
applies to string commitments, composes in parallel...
Multi-Prover Commitments Against Non-Signaling Attacks
non-signaling bit-commitment multi-prover
2015/12/30
We reconsider the concept of two-prover (and more generally:
multi-prover) commitments, as introduced in the late eighties in the
seminal work by Ben-Or et al. As was recently shown by Cr磂peau et al...
How to Securely Prolong the Computational Bindingness of Pedersen Commitments
unconditionally hiding commitments long-term security perfect zero-knowledge proofs
2015/12/29
Pedersen commitments are important cryptographic primitives.
They allow a prover to commit to a certain value without revealing
any information about it and without the prover being able to change i...
We present a new constant round additively homomorphic commitment scheme with
(amortized) computational and communication complexity linear in the size of the string committed to.
Our scheme is base...
The protocol has only three rounds of interaction. Pass (TCC 2013) showed an impossibility result
for a two-round non-malleable commitment scheme w.r.t. a black-box reduction to any “standard"
intra...