A New Dynamic Accumulator for Batch Updates

Wang, Peishun; Wang, Huaxiong; Pieprzyk, Josef

doi:10.1007/978-3-540-77048-0_8

Cited by 17 publications

(30 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In [22], the authors propose a dynamic accumulator for batch update. Users who missed many witness updates, can request update information to the issuer and update their witness with one multiplication.…”

Section: Introductionmentioning

confidence: 99%

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

Camenisch

Kohlweiss

Soriente

2009

Public Key Cryptography – PKC 2009

215

202

View full text Add to dashboard Cite

Abstract. The success of electronic authentication systems, be it e-ID card systems or Internet authentication systems such as CardSpace, highly depends on the provided level of user-privacy. Thereby, an important requirement is an efficient means for revocation of the authentication credentials. In this paper we consider the problem of revocation for certificate-based privacy-protecting authentication systems. To date, the most efficient solutions for revocation for such systems are based on cryptographic accumulators. Here, an accumulate of all currently valid certificates is published regularly and each user holds a witness enabling her to prove the validity of her (anonymous) credential while retaining anonymity. Unfortunately, the users' witnesses must be updated at least each time a credential is revoked. For the know solutions, these updates are computationally very expensive for users and/or certificate issuers which is very problematic as revocation is a frequent event as practice shows.In this paper, we propose a new dynamic accumulator scheme based on bilinear maps and show how to apply it to the problem of revocation of anonymous credentials. In the resulting scheme, proving a credential's validity and updating witnesses both come at (virtually) no cost for credential owners and verifiers. In particular, updating a witness requires the issuer to do only one multiplication per addition or revocation of a credential and can also be delegated to untrusted entities from which a user could just retrieve the updated witness. We believe that thereby we provide the first authentication system offering privacy protection suitable for implementation with electronic tokens such as eID cards or drivers' licenses.

show abstract

Section: Introductionmentioning

confidence: 99%

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

Camenisch

Kohlweiss

Soriente

2009

Public Key Cryptography – PKC 2009

215

202

View full text Add to dashboard Cite

show abstract

“…Accumulators [2,9,37,29,8,38] provide another mechanism for giving membership proofs. An accumulator is a succinct aggregate of a set of values where it is possible to issue membership proofs for each accumulated value.…”

Section: Membership Proofs Andmentioning

confidence: 99%

Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists

Bayer

Groth

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Verification of a polynomial's evaluation in a secret committed value plays a role in cryptographic applications such as non-membership or membership proofs. We construct a novel special honest verifier zero-knowledge argument for correct polynomial evaluation. The argument has logarithmic communication cost in the degree of the polynomial, which is a significant improvement over the state of the art with cubic root complexity at best. The argument is relatively efficient to generate and very fast to verify compared to previous work. The argument has a simple public-coin 3-move structure and only relies on the discrete logarithm assumption.The polynomial evaluation argument can be used as a building block to construct zero-knowledge membership and non-membership arguments with communication that is logarithmic in the size of the blacklist. Non-membership proofs can be used to design anonymous blacklisting schemes allowing online services to block misbehaving users without learning the identity of the user. They also allow the blocking of single users of anonymization networks without blocking the whole network.

show abstract

“…A first step towards a different direction, where we assume that we cannot trust the prover and therefore the trapdoor information is kept secret, was made in [21] (however this work is not applicable to the two-party model), achieving O(n ) bounds. An authenticated data structure that combines hierarchical hashing with the accumulation-based scheme of [21] is presented in [22] and accumulators using other cryptographic primitives (e.g., general groups with bilinear pairings) the security of which is based on other assumptions (e.g., hardness of strong Diffie-Hellman problem) are introduced in [11,32,42]. Non-membership proofs for accumulators are presented in [3,16,26].…”

Section: Related Workmentioning

confidence: 99%

Optimal Authenticated Data Structures with Multilinear Forms

Papamanthou

Tamassia

Triandopoulos

2010

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. Cloud computing and cloud storage are becoming increasingly prevalent. In this paradigm, clients outsource their data and computations to third-party service providers. Data integrity in the cloud therefore becomes an important factor for the functionality of these web services. Authenticated data structures, implemented with various cryptographic primitives, have been widely studied as a means of providing efficient solutions to data integrity problems (e.g., Merkle trees). In this paper, we introduce a new authenticated dictionary data structure that employs multilinear forms, a cryptographic primitive proposed by Silverberg and Boneh in 2003 [10], the construction of which, however, remains an open problem to date. Our authenticated dictionary is optimal, that is, it does not add any extra asymptotic cost to the plain dictionary data structure, yielding proofs of constant size, i.e., asymptotically equal to the size of the answer, while maintaining other relevant complexities logarithmic. Instead, solutions based on cryptographic hashing (e.g., Merkle trees) require proofs of logarithmic size [40]. Because multilinear forms are not known to exist yet, our result can be viewed from a different angle: if one could prove that optimal authenticated dictionaries cannot exist in the computational model, irrespectively of cryptographic primitives, then our solution would imply that cryptographically interesting multilinear form generators cannot exist as well (i.e., it can be viewed as a reduction). Thus, we provide an alternative avenue towards proving the nonexistence of multilinear form generators in the context of general lower bounds for authenticated data structures [40] and for memory checking [18], a model similar to the authenticated data structures model.

show abstract

A New Dynamic Accumulator for Batch Updates

Cited by 17 publications

References 14 publications

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials

Zero-Knowledge Argument for Polynomial Evaluation with Application to Blacklists

Optimal Authenticated Data Structures with Multilinear Forms

Contact Info

Product

Resources

About