Universal accumulators with efficient nonmembership proofs

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4521 LNCS, Issue , 2007, Pages 253-269

  Li, Jiangtao ^a   Li, Ninghui ^b   Xue, Rui ^c  

^a INTEL CORPORATION   (United States)

^b PURDUE UNIVERSITY   (United States)

^c INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; MEMBERSHIP FUNCTIONS; SECURITY OF DATA; SECURITY SYSTEMS;

COMPUTATIONAL COSTS; NONMEMBERSHIP PROOFS; UNIVERSAL ACCUMULATORS;

CRYPTOGRAPHY;

EID: 38049029638     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-72738-5_17     Document Type: Conference Paper

References (23)

1. G. Ateniese, J. Camenisch, M. Joye, and G. Tsudik. A practical and provably secure coalition-resistant group signature scheme. In Advances in Cryptology - CRYPTO '00, pages 255-270, 2000.
2. G. Ateniese, D. Song, and G. Tsudik. Quasi-efficient revocation of group signatures. In Proceedings of Financial Cryptography, pages 183-197, 2001.
3. N. Baric and B. Pfitzmann. Collision-free accumulators and fail-stop signature schemes without trees. In Advances in Cryptology - EUROCRYPT '97, pages 480-494, 1997.
4. J. C. Benaloh and M. de Mare. One-way accumulators: A decentralized alternative to digital signatures. In Advances in Cryptology - EUROCRYPT '93, pages 274-285, 1994.
5. D. Boneh and H. Shacham. Group signatures with verifier-local revocation. In Proceedings of the 11th ACM conference on Computer and Communications Security (CCS), pages 168-177, 2004.
6. F. Boudot. Efficient proofs that a committed number lies in an interval. In Advances in Cryptology - EUROCRYPT '00, pages 431-444, May 2000.
7. E. Brickell, J. Camenisch, and L. Chen. Direct anonymous attestation. In Proceedings of the 11th ACM conference on Computer and Communications Security (CCS), pages 132-145, 2004.
8. J. Camenisch, S. Hohenberger, and A. Lysyanskaya. Compact e-cash. In Advances in Cryptology - EUROCRYPT '05, pages 302-321, 2005.
9. J. Camenisch and A. Lysyanskaya. An efficient system for non-transferable anonymous credentials with optional anonymity revocation. In Advances in Cryptology - EUROCRYPT '01, pages 93-118, 2001.
10. J. Camenisch and A. Lysyanskaya. Dynamic accumulators and application to efficient revocation of anonymous credentials. In Advances in Cryptology - CRYPTO '02, pages 61-76, 2002.
11. J. Camenisch and A. Lysyanskaya. A signature scheme with efficient protocols. In Proceedings of the 3rd Conference on Security in Communication Networks, pages 268-289, 2002.
12. J. Camenisch and M. Michels. Proving in zero-knowledge that a number is the product of two safe primes. In In Advances in Cryptology - EUROCRYPT '99, pages 106-121, 1999.
13. J. Camenisch and M. Michels. Separability and efficiency for generic group signature schemes. In In Advances in Cryptology - CRYPTO '99, pages 413-430, 1999.
14. J. Camenisch and M. Stadler. Efficient group signature schemes for large groups. In Advances in Cryptology - CRYPTO '97, pages 410-424, 1997.
15. D. Chaum and E. van Heyst. Group signatures. In Advances in Cryptology - EUROCRYPT '91, pages 257-265, Apr. 1991.
16. R. Cramer and V. Shoup. Signature schemes based on the strong RSA assumption. In Proceedings of the 6th ACM Conference on Computer and Communications Security (CCS), pages 46-51, Nov. 1999.
17. I. Damgård and E. Fujisaki. An integer commitment scheme based on groups with hidden order. In Advances in Cryptology: ASIACRYPT '02, pages 125-142. Springer, 2002.
18. E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology - CRYPTO '97, pages 16-30, Aug. 1997.
19. R. Gennaro, S. Halevi, and T. Rabin. Secure hash-and-sign signatures without the random oracle. In Advances in Cryptology - EUROCRYPT '99, pages 123-139, 1999.
20. M. T. Goodrich, R. Tamassia, and J. Hasic. An efficient dynamic and distributed cryptographic accumulator. In Proceedings of the 5th International Conference on Information Security, pages 372-388, 2002.
21. A. Lysyanskaya, R. L. Rivest, A. Sahai, and S. Wolf. Pseudonym systems. In Selected Areas in Cryptography, 6th Annual International Workshop, SAC '99, pages 184-199, 1999.
22. T. P. Pedersen. Non-interactive and information-theoretic secure verifiable secret sharing. In Advances in Cryptology - CRYPTO '91, pages 129-140, 1992.
23. A. Shamir. On the generation of cryptographically strong pseudorandom sequences. ACM Transactions on Computer Systems, 1(1):38, Feb. 1983.