搜索结果: 1-15 共查到“accumulators”相关记录19条 . 查询时间(0.092 秒)
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 ...
17th International Conference Advanced Batteries, Accumulators and Fuel Cells [ABAF 17th]
Accumulators Fuel Cells
2016/7/25
The International Conference “Advanced Batteries, Accumulators and Fuel cells 17th” will be prepared and held in days from Aug. 28th to Aug. 31st, 2016 in City of Brno (Czech Republic).
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...
Simulation of dynamic processes in hydraulic accumulators
hydraulic system hydraulic accumulator diffusion of pressure waves method of characteristics dynamic processes
2010/10/29
The article focuses on pressure pulsations in hydraulic systems, the means reducing them and examines the structure of hydraulic accumulators, including their features and differences. Using the metho...
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...
Ensuring Authentication of Digital Information using Cryptographic Accumulators
Stream Authentication Polynomial Reconstruction Erasure Channel Adversarial Channel Cryptographic Accumulator
2012/12/3
In this paper, we study the broadcast authentication problem for both erasure and adversarial networks. Two important concerns for authentication protocols are the authentication delay and the packet ...
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...