Revisiting Cryptographic Accumulators, Additional Properties and Relations to other Primitives

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 membership in the accumulator. However, it is computationally infeasible to find a witness for any non-accumulated value. Since their introduction, various accumulator schemes for numerous practical applications and with different features have been proposed. Unfortunately, to date there is no unifying model capturing all existing features. Such a model can turn out to be valuable as it allows to use accumulators in a black-box fashion.

[1]  Philippe Camacho,et al.  On the Impossibility of Batch Update for Cryptographic Accumulators , 2010, LATINCRYPT.

[2]  Henrich Christopher Pöhls,et al.  On Updatable Redactable Signatures , 2014, ACNS.

[3]  Silvio Micali,et al.  Zero-knowledge sets , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[4]  Moti Yung,et al.  Blind, Auditable Membership Proofs , 2000, Financial Cryptography.

[5]  Stanislaw Jarecki,et al.  Cryptographic Primitives Enforcing Communication and Storage Complexity , 2002, Financial Cryptography.

[6]  Claudio Soriente,et al.  An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials , 2009, IACR Cryptol. ePrint Arch..

[7]  Roberto Tamassia,et al.  Verifiable Member and Order Queries on a List in Zero-Knowledge , 2014, IACR Cryptol. ePrint Arch..

[8]  Peishun Wang,et al.  A New Dynamic Accumulator for Batch Updates , 2007, ICICS.

[9]  Marcos A. Kiwi,et al.  Strong accumulators from collision-resistant hashing , 2008, International Journal of Information Security.

[10]  Peeter Laud,et al.  Eliminating Counterevidence with Applications to Accountable Certificate Management , 2002, J. Comput. Secur..

[11]  Daniel Slamanig.  Dynamic Accumulator Based Discretionary Access Control for Outsourced Storage with Unlinkable Access - (Short Paper) , 2012, Financial Cryptography.

[12]  Joachim Posegga,et al.  Redactable Signature Schemes for Trees with Signer-Controlled Non-Leaf-Redactions , 2012, ICETE.

[13]  Ninghui Li,et al.  Universal Accumulators with Efficient Nonmembership Proofs , 2007, ACNS.

[14]  Helger Lipmaa,et al.  Secure Accumulators from Euclidean Rings without Trusted Setup , 2012, ACNS.

[15]  Kaisa Nyberg,et al.  Fast Accumulated Hashing , 1996, FSE.

[16]  H. D. Meer,et al.  Indistinguishability of One-Way Accumulators , 2013 .

[17]  Nelly Fazio,et al.  Cryptographic Accumulators: Definitions, Constructions and Applications , 2002 .

[18]  Dan Boneh,et al.  Short Signatures Without Random Oracles , 2004, EUROCRYPT.

[19]  Joachim Posegga,et al.  Malleable Signatures for Resource Constrained Platforms , 2013, WISTP.

[20]  Serge Vaudenay,et al.  A Fully Dynamic Universal Accumulator , 2013 .

[21]  Nobuo Funabiki,et al.  Efficient Proofs of Attributes in Pairing-Based Anonymous Credential System , 2011, PETS.

[22]  Yi Mu,et al.  Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems , 2009, CT-RSA.

[23]  Tomas Sander,et al.  Efficient Accumulators without Trapdoor Extended Abstracts , 1999, ICICS.

[24]  Lan Nguyen,et al.  Accumulators from Bilinear Pairings and Applications , 2005, CT-RSA.

[25]  Tal Malkin,et al.  Mercurial Commitments with Applications to Zero-Knowledge Sets , 2005, EUROCRYPT.

[26]  Bingsheng Zhang,et al.  Efficient Non-Interactive Zero Knowledge Arguments for Set Operations , 2014, Financial Cryptography.

[27]  Tolga Acar,et al.  Revocation for Delegatable Anonymous Credentials , 2011, Public Key Cryptography.

[28]  Dan Boneh,et al.  Bivariate Polynomials Modulo Composites and their Applications , 2014, IACR Cryptol. ePrint Arch..

[29]  Abhi Shelat,et al.  Computing on Authenticated Data , 2012, TCC.

[30]  Michael T. Goodrich,et al.  An Efficient Dynamic and Distributed Cryptographic Accumulator , 2002, ISC.

[31]  Matthew Green,et al.  Zerocoin: Anonymous Distributed E-Cash from Bitcoin , 2013, 2013 IEEE Symposium on Security and Privacy.

[32]  Kun Peng,et al.  Vulnerability of a non-membership proof scheme , 2010, 2010 International Conference on Security and Cryptography (SECRYPT).

[33]  Sébastien Canard,et al.  On Extended Sanitizable Signature Schemes , 2010, CT-RSA.

[34]  Dario Fiore,et al.  Vector Commitments and Their Applications , 2013, Public Key Cryptography.

[35]  Ivan Damgård,et al.  Supporting Non-membership Proofs with Bilinear-map Accumulators , 2008, IACR Cryptol. ePrint Arch..

[36]  Shouhuai Xu,et al.  Accumulating Composites and Improved Group Signing , 2003, ASIACRYPT.

[37]  Jan Camenisch,et al.  Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.

[38]  Peeter Laud,et al.  Accountable certificate management using undeniable attestations , 2000, CCS.

[39]  Birgit Pfitzmann,et al.  Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.

[40]  Ian Goldberg,et al.  Constant-Size Commitments to Polynomials and Their Applications , 2010, ASIACRYPT.