Efficient Accumulators without Trapdoor Extended Abstracts
暂无分享,去创建一个
[1] G. Hardy,et al. An Introduction to the Theory of Numbers , 1938 .
[2] Ralph C. Merkle,et al. Protocols for Public Key Cryptosystems , 1980, 1980 IEEE Symposium on Security and Privacy.
[3] Adi Shamir,et al. On the generation of cryptographically strong pseudorandom sequences , 1981, TOCS.
[4] David Naccache,et al. On blind signatures and perfect crimes , 1992, Comput. Secur..
[5] Josh Benaloh,et al. One-Way Accumulators: A Decentralized Alternative to Digital Sinatures (Extended Abstract) , 1994, EUROCRYPT.
[6] Markus Jakobsson,et al. Revokable and versatile electronic money (extended abstract) , 1996, CCS '96.
[7] Kaisa Nyberg,et al. Fast Accumulated Hashing , 1996, FSE.
[8] Tatsuaki Okamoto,et al. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations , 1997, CRYPTO.
[9] Burton S. Kaliski. Advances in Cryptology - CRYPTO '97 , 1997 .
[10] Birgit Pfitzmann,et al. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees , 1997, EUROCRYPT.
[11] Jan Camenisch,et al. A Group Signature Scheme with Improved Efficiency , 1998, ASIACRYPT.
[12] Michael Wiener,et al. Advances in Cryptology — CRYPTO’ 99 , 1999 .
[13] Amnon Ta-Shma,et al. Auditable, Anonymous Electronic Cash Extended Abstract , 1999, CRYPTO.
[14] Amnon Ta-Shma,et al. Auditable, anonymous electronic cash , 1999 .
[15] Walter Fumy,et al. Advances in Cryptology — EUROCRYPT ’97 , 2001, Lecture Notes in Computer Science.
[16] Tor Helleseth,et al. Advances in Cryptology — EUROCRYPT ’93 , 2001, Lecture Notes in Computer Science.