搜索结果: 1-15 共查到“军队指挥学 accumulators”相关记录15条 . 查询时间(0.062 秒)
Accumulators, first introduced by Benaloh and de Mare (Eurocrypt 1993), are compact representations of arbitrarily large sets and can be used to prove claims of membership or non-membership about the ...
Batching Techniques for Accumulators with Applications to IOPs and Stateless Blockchains
accumulators zero knowledge commitments
2018/12/11
We present batching techniques for cryptographic accumulators and vector commitments in groups of unknown order. Our techniques are tailored for decentralized settings where no trusted accumulator man...
Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives
privacy-preserving cryptography provable security accumulator
2017/11/29
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures...
Accumulators with Applications to Anonymity-Preserving Revocation
accumulators anonymous credentials revocation
2017/2/20
Membership revocation is essential for cryptographic applications, from traditional PKIs to group signatures and anonymous credentials. Of the various solutions for the revocation problem that have be...
Functional Commitment Schemes: From Polynomial Commitments to Pairing-Based Accumulators from Simple Assumptions
Commitment schemes functional commitments accumulators
2016/12/10
We propose a construction of functional commitment (FC) for linear functions based on constant-size assumptions in composite order groups endowed with a bilinear map. The construction has commitments ...
Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives
static dynamic universal cryptographic accumulators
2016/1/4
Cryptographic accumulators allow to accumulate a finite set of values
into a single succinct accumulator. For every accumulated value, one can
efficiently compute a witness, which certifies its memb...
Zero-Knowledge Accumulators and Set Operations
zero-knowledge accumulators cryptographic accumulators secure set-operations
2015/12/31
Accumulators provide a way to succinctly represent a set with elements drawn from a given domain, using
an accumulation value. Subsequently, short proofs for the set-membership (or non-membership) of...
Cryptographic accumulators are a tool for compact set representation
and secure set membership proofs. When an element is added
to a set by means of an accumulator, a membership witness is generated...
New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
hashing obfuscation
2015/12/23
A somewhere statistically binding (SSB) hash, introduced by Hubⅴaⅶcek and Wichs (ITCS ’15), can be
used to hash a long string x to a short digest y = Hhk(x) using a public hashing-key hk. Furthermore...
Cryptographic Accumulators for Authenticated Hash Tables
Cryptographic Accumulators Authenticated Hash Tables
2009/12/29
Hash tables are fundamental data structures that optimally answer membership queries.
Suppose a client stores n elements in a hash table that is outsourced at a remote server. Authenticating the hash...
On the Impossibility of Batch Update for Cryptographic Accumulators
Batch Update Cryptographic Accumulators
2009/12/29
A cryptographic accumulator is a scheme where a set of elements is represented by a
single short value. This value, along with another value called witness allows to prove
membership into the set. I...
Supporting Non-membership Proofs with Bilinear-map Accumulators
Non-membership Proofs Bilinear-map Accumulators RSA accumulator
2009/6/11
In this short note, we present an extension of Nguyen’s bilinear-map based accumulator scheme [8]
to support non-membership witnesses and corresponding non-membership proofs, i.e., cryptographic
pro...
Practical Anonymous Divisible E-Cash From Bounded Accumulators
Practical Anonymous Divisible E-Cash Bounded Accumulators
2009/6/2
We present an efficient off-line divisible e-cash scheme which
is truly anonymous without a trusted third party. This is the second
scheme in the literature which achieves full unlinkability and ano...
Accumulators from Bilinear Pairings and Applications to ID-based Ring Signatures and
Dynamic accumulators ID-based ring signatures ad-hoc anonymous identification
2009/2/5
We propose a dynamic accumulator scheme from bilinear
pairings, whose security is based on the Strong Diffie-Hellman assumption.
We show applications of this accumulator in constructing an identityb...
Practical Anonymous Divisible E-Cash From Bounded Accumulators
Practical Anonymous Divisible E-Cash From Bounded Accumulators
2008/5/21
We present an e±cient o®-line divisible e-cash scheme which
is truly anonymous without a trusted third party. This is the second
scheme in the literature which achieves full unlinkability and an...