114
Views
0
CrossRef citations to date
0
Altmetric
Original Articles

Non-Interactive Anonymous Credential Based on Structure-Preserving Signature

, &

REFERENCES

  • D. Chaum, A. Fiat, and M. Naor, “Untraceable electronic cash,” in Proceedings of CRYPTO'88. Santa Barbara, CA: Springer-Verlag Press, 1990, pp. 319–27.
  • J. Camenisch, S. Hohenberger, and A. Lysyanskaya, “Compact e-cash,” in Proceedings of EUROCRYPT 2005. Aarhus, Denmark: Springer-Verlag Press, 2005, pp. 302–21.
  • D. Chaum, and E. V. Heyst, “Group signatures,” in Proceedings of EUROCRYPT'91. Brighton, UK: Springer-Verlag Press, 1991, pp. 257–65.
  • F. C. Zhou, J. Xu, and H. Li, et al., “Group signature based on noninteractive zero-knowledge proofs,” China Commun., Vol. 8, no. 2, pp. 34–41, 2011.
  • F. C. Zhou, J. Xu, and L. L. Wang, et al., “A group signature in the composite order bilinear groups,” Chin. J. Comput., Vol. 35, no. 4, pp. 654–63, 2012.
  • I. Teranishi, J. Furukawa, and K. Sako, “k-times anonymous authentication (extended abstract),” in Proceedings of ASIACRYPT 2004. Jeju Island, Korea: Springer-Verlag Press, 2004, pp. 308–22.
  • I. Damgård, K. Dupont, and M. Ø. Pedersen, “Unclonable group identification,” in Proceedings of EUROCRYPT'06. Saint Petersburg, Russia: Springer-Verlag Press, 2006, pp. 555–72.
  • J. Groth, “Simulation-sound NIZK proofs for a practical language and constant size group signatures,” in Proceedings of ASIACRYPT 2006. Shanghai, China: Springer-Verlag Press, 2006, pp. 444–59.
  • M. Green, and S. Hohenberger, “Universally composable adaptive oblivious transfer,” in Proceedings of ASIACRYPT 2008. Melbourne, Australia: Springer-Verlag Press, 2008, pp. 179–97.
  • J. Cathalo, B. Libert, and M. Yung, “Group encryption: non-interactive realization in the standard model,” in Proceedings of ASIACRYPT 2009. Tokyo, Japan: Springer-Verlag Press, 2009, pp. 179–96.
  • G. Fuchsbauer, “Automorphic signatures in bilinear groups and an application to round-optimal blind signatures,” Cryptology ePrint Archive, Report 2009/320.
  • M. Abe, K. Haralambiev, and M. Ohkubo, “Signing on elements in bilinear groups for modular protocol design,” Cryptology ePrint Archive, Report 2010/133.
  • M. Abe, G. Fuchsbauer, and J. Groth, et al., “Structure-preserving signatures and commitments to group elements,” in Proceedings of CRYPTO 2010. Santa Barbara, CA: Springer-Verlag Press, 2010, pp. 209–36.
  • M. Blum, P. Feldman, and S. Micali, “Non-interactive zero-knowledge and its applications,” in Proceedings of STOC'88. Chicago, IL: ACM Press, 1988, pp. 103–12.
  • U. Feige, D. Lapidot, and A. Shamir, “Multiple non-interactive zero knowledge proofs under general assumptions,” SIAM J. Comput., Vol. 29, no. 1, pp. 1–28, 2000.
  • A. D. Santis, G. D. Crescenzo, and G. Persiano, “Randomness-optimal characterization of two NP proof systems,” in Proceedings of RANDOM'02. Boston, MA, USA: Springer-Verlag Press, 2002, pp. 179–93.
  • J. Groth, R. Ostrovsky, and A. Sahai, “Perfect non-interactive zero-knowledge for NP,” in Proceedings of EUROCRYPT 2006. Saint Petersburg, Russia: Springer-Verlag Press, 2006, pp. 339–58.
  • J. Groth, R. Ostrovsky, and A. Sahai, “Non-interactive zaps and new techniques for NIZK,” in Proceedings of CRYPTO 2006. Santa Barbara, CA, USA: Springer-Verlag Press, 2006, pp. 97–111.
  • J. Groth, and A. Sahai, “Efficient non-interactive proof systems for bilinear groups,” Cryptology ePrint Archive, Report 2007/155.
  • D. Chaum, “Security without identification: transaction systems to make big brother obsolete,” Commun. ACM, Vol. 28, no. 10, pp. 1030–44, 1985.
  • M. Belenkiy, M. Chase, and M. Kohlweiss, et al., “P-signatures and noninteractive anonymous credentials,” in Proceedings of TCC 2008. New York: Springer-Verlag Press, 2008, pp. 356–74.
  • D. Boneh, and X. Boyen, “Short signatures without random oracles,” in Proceedings of EUROCRYPT 2004. Interlaken, Switzerland: Springer-Verlag Press, 2004, pp. 54–73.

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.