One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract)

By Josh Benaloh, Michael de Mare. 1994

How researchers see this paper

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

Citations in the corpus

Bulletproofs: Short Proofs for Confidential Transactions and More (2018, methodology): “They show that their scheme can be instantiated securely using both RSA accumulators [59] and the Boneh-Boyen signature scheme [60].”
Vector Commitments and Their Applications (2013, unknown): “Fully Dynamic Universal Accumulators.”
Vanish: Increasing Data Privacy with Self-Destructing Data (2009, background): “For similar reasons, plus our desire to avoid introducing new trusted agents or secure hardware, we do not use other cryptographic approaches like key-insulated [5, 23] and intrusion-resilient [21, 22] cryptography.”
An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials (2009, background): “The second kind [16, 17] employs cryptographic accumulators [18].”
Anonymous Identification in Ad Hoc Groups (2004, methodology): “We briefly review some definitions [7, 4] regarding the computational assumption underlying our efficient construction in Section 5.”
On-the-fly verification of rateless erasure codes for efficient content distribution (2004, methodology): “One-way accumulators [35], [36] and incremental hashing [21], based on RSA and DL constructions respectively, examine commutative hash functions that yield an output independent of the operations’ order.”
Privacy-preserving distributed mining of association rules on horizontally partitioned data (2004, background): “The construction of one-way accumulators of Benaloh and de Mare [4] can be easily modified to let us to retrieve the x value.”
Random projection-based multiplicative data perturbation for privacy preserving distributed data mining (2006, methodology): “The circuit evaluation protocol, oblivious transfer and oblivious polynomial evaluation [19], homomorphic encryption [20], commutative encryption [ 21 ], Yao’s millionaire problem (secure comparison) [22] and some other cryptographic techniques serve as the building blocks of SMC.”