A new construction of zero-knowledge sets secure in random oracle model

Proceedings of the 1st International Symposium on Data, Privacy, and E-Commerce, ISDPE 2007

Volumn , Issue , 2007, Pages 332-337

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

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

^b PURDUE UNIVERSITY   (United States)

^c INTEL CORPORATION   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

E-COMMERCE; INTERNATIONAL SYMPOSIUM; MERCURIAL COMMITMENTS; MERKLE TREES; NEW CONSTRUCTION; RANDOM ORACLE MODELS; STRONG RSA ASSUMPTION; ZERO KNOWLEDGE SETS;

ELECTRONIC COMMERCE; STANDARDS;

COMMERCE;

EID: 48049121717     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ISDPE.2007.8     Document Type: Conference Paper

References (19)

1. N. Barić and B. Pfitzmann, "Collision-free accumulators and fail-stop signature schemes without trees," in Advances in Cryptology - EUROCRYPT '97, 1997, pp. 480-494.
2. M. Bellare and P. Rogaway, "Random oracles are practical: A paradigm for designing efficient protocols," in ACM Conference on Computer and Communications Security, 1993, pp. 62-73.
3. J. Camenisch and M. Stadler, "Efficient group signature schemes for large groups," in Advances in Cryptology - CRYPTO '97, 1997, pp. 410-424.
4. D. Catalano, Y. Dodis, and I. Visconti, "Mercurial commitments: Minimal assumptions and efficient constructions," in Theory of Cryptography -TCC06, ser. Lecture Notes in Computer Science, vol. 3876. Springer-Verlag, 2006, pp. 120-144.
5. M. Chase, A. Healy, A. Lysyanskaya, T. Malkin, and L. Reyzin, "Mercurial commitments with applications to zero-knowledge sets," in Advances in Cryptology - EUROCRYPT '05, 2005, pp. 422-439.
6. 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), Nov. 1999, pp. 46-51.
7. A. Fiat and A. Shamir, "How to prove yourself: practical solutions to identification and signature problems," in Advances in Cryptology - CRYPTO '86, 1987, pp. 186-194.
8. E. Fujisaki and T. Okamoto, "Statistical zero knowledge protocols to prove modular polynomial relations," in Advances in Cryptology - CRYPTO '97, Aug. 1997, pp. 16-30.
9. R. Gennaro, S. Halevi, and T. Rabin, "Secure hashand-sign signatures without the random oracle," in Advances in Cryptology - EUROCRYPT '99, 1999, pp. 123-139.
10. R. Gennaro and S. Micali, "Independent zero-knowledge sets." in ICALP (2), 2006, pp. 34-45.
11. 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, 2002, pp. 372-388.
12. J. Li, N. Li, and R. Xue, "Universal accumulators with efficient nonmembership proofs," in Applied Cryptography and Network Security (ACNS07), ser. Lecture Notes in Computer Science, vol. 4521. Springer-Verlag, 2007, pp. 253-269.
13. M. Liskov, "Updatable zero-knowledge databases," in Advances in Cryptology - ASIACRYPT '05, 2005, pp. 174-198.
14. S. Micali, M. Rabin, and J. Kilian, "Zero-knowledge sets," in Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science (FOCS), 2003, p. 80.
15. R. Ostrovsky, C. Rackoff, and A. Smith, "Efficient consistency proofs for generalized queries on a committed database." in ICALP, 2004, pp. 1041-1053.
16. T. P. Pedersen, "Non-interactive and information-theoretic secure verifiable secret sharing," in Advances in Cryptology - CRYPTO '91, 1992, pp. 129-140.
17. M. Prabhakaran and R. Xue, "Statistical zero-knowledge sets using trapdoor DDH groups," 2007, submitted.
18. A. Shamir, "On the generation of cryptographically strong pseudorandom sequences," ACM Transactions on Computer Systems, vol. 1, no. 1, p. 38, Feb. 1983.
19. V. Shoup, "Practical threshold signatures," in Advances in Cryptology - EUROCRYPT '00, 2000, pp. 207-220.