Supporting Non-membership Proofs with Bilinear-map Accumulators
暂无分享,去创建一个
[1] Tomas Sander,et al. Efficient Accumulators without Trapdoor Extended Abstracts , 1999, ICICS.
[2] Lan Nguyen,et al. Accumulators from Bilinear Pairings and Applications , 2005, CT-RSA.
[3] Jan Camenisch,et al. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials , 2002, CRYPTO.
[4] Michael T. Goodrich,et al. An Efficient Dynamic and Distributed Cryptographic Accumulator , 2002, ISC.
[5] Hovav Shacham,et al. Short Group Signatures , 2004, CRYPTO.
[6] Birgit Pfitzmann,et al. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.
[7] Ninghui Li,et al. Universal Accumulators with Efficient Nonmembership Proofs , 2007, ACNS.
[8] Yi Mu,et al. Compact E-Cash from Bounded Accumulator , 2007, CT-RSA.
[9] Roberto Tamassia,et al. Authenticated hash tables , 2008, CCS.
[10] Peishun Wang,et al. A New Dynamic Accumulator for Batch Updates , 2007, ICICS.
[11] Josh Benaloh,et al. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) , 1994, EUROCRYPT.
[12] Shouhuai Xu,et al. Accumulating Composites and Improved Group Signing , 2003, ASIACRYPT.