Accumulators from Bilinear Pairings and Applications

By Lan Duy Nguyen. The Cryptographer's Track at RSA Conference, 2005

480 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Constant-Size Commitments to Polynomials and Their Applications (2010, background): “This assumption was implicitly made by [1, 2] to support their claim that the accumulator of [29] is bounded.”
Constant-Size Dynamic k-TAA (2006, methodology): “Our construction is built based on the accumulator with oneway domain due to [15].”
Vector Commitments and Their Applications (2013, background): “It is worth noting that all known constructions of cryptographic accumulators (dynamic and universal) secure without random oracles either work over composite order groups and use expensive operations for mapping set elements to prime numbers [2] [8], or they work in prime order groups but rely on r”
Verifiable Delegation of Computation over Large Datasets (2011, background): “This issue has been addressed in the line of works on cryptographic accumulators [16,47,53], and, using different techniques, in the authenticated datastructures literature [48,41,52,59].”
Zerocoin: Anonymous Distributed E-Cash from Bitcoin (2013, background): “One-way accumulators [10] [11] [12] [13] [14], first proposed by Benaloh and de Mare [10], allow parties to combine many elements into a constant-sized data structure, while efficiently proving that one specific value is contained within the set.”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “Nguyen [21] constructs a dynamic accumulator from bilinear pairings.”