Table of Contents Author Guidelines Submit a Manuscript
Mobile Information Systems
Volume 2015, Article ID 626415, 11 pages
http://dx.doi.org/10.1155/2015/626415
Research Article

Server-Aided Verification Signature with Privacy for Mobile Computing

1School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China
2School of Computer Science and Educational Software, Guangzhou University, Guangzhou 510006, China
3Khalifa University of Science, Technology and Research, P.O. Box 127788, Abu Dhabi, UAE

Received 6 May 2014; Accepted 1 September 2014

Academic Editor: David Taniar

Copyright © 2015 Lingling Xu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. Durresi and M. Denko, “Preface: advances in mobile communications and computing,” Mobile Information Systems, vol. 5, no. 2, pp. 101–103, 2009. View at Publisher · View at Google Scholar · View at Scopus
  2. A. Durresi and M. Denko, “Advances in wireless networks,” Mobile Information Systems, vol. 5, no. 1, pp. 1–3, 2009. View at Publisher · View at Google Scholar · View at Scopus
  3. S. Benabbas, R. Gennaro, and Y. Vahlis, “Verifiable delegation of computation over large datasets,” in Advances in Cryptology—CRYPTO 2011, vol. 6841 of Lecture Notes in Computer Science, pp. 111–131, Springer, Berlin, Germany, 2011. View at Publisher · View at Google Scholar
  4. R. Gennaro, C. Gentry, and B. Parno, “Non-interactive verifiable computing: outsourcing computation to untrusted workers,” in Advances in Cryptology—CRYPTO 2010, vol. 6223 of Lecture Notes in Computer Science, pp. 465–482, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. K. M. Chung, Y. Kalai, and S. Vadhan, “Improved delegation of computation using fully homomorphic encryption,” in Advances in Cryptology—CRYPTO 2010, vol. 6223 of Lecture Notes in Computer Science, pp. 483–501, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  6. D. Fiore and R. Gennaro, “Publicly verifiable delegation of large polynomials and matrix computations, with applications,” in Proceedings of the ACM Conference on Computer and Communications Security (CCS '12), pp. 501–512, ACM, October 2012. View at Publisher · View at Google Scholar · View at Scopus
  7. B. Parno, M. Raykova, and V. Vaikuntanathan, “How to delegate and verify in public: verifiable computation from attribute-based encryption,” in Theory of Cryptography, vol. 7194 of Lecture Notes in Computer Science, pp. 422–439, Springer, Berlin, Germany, 2012. View at Publisher · View at Google Scholar
  8. C. Papamanthou, R. Tamassia, and N. Triandopoulos, “Optimal verification of operations on dynamic sets,” in Advances in Cryptology—CRYPTO 2011, vol. 6841 of Lecture Notes in Computer Science, pp. 91–110, 2011. View at Google Scholar
  9. P. Béguin and J.-J. Quisquater, “Fast server-aided RSA signatures secure against active attacks,” in Advances in Cryptology—CRYPT0 1995, vol. 963 of Lecture Notes in Computer Science, pp. 57–69, Springer, Berlin, Germany, 1995. View at Publisher · View at Google Scholar
  10. J.-J. Quisquater and M. de Soete, “Speeding up smart card RSA computation with insecure coprocessors,” in Proceedings of the Smart Cards 2000, pp. 191–197, 1989.
  11. C. H. Lim and P. J. Lee, “Security and performance of server-aided RSA computation protocols,” in Advances in Cryptology—CRYPTO' 1995, vol. 963 of Lecture Notes in Computer Science, pp. 70–83, Springer, Berlin, Germany, 1995. View at Google Scholar
  12. P. Nguyen and J. Stern, “The Béguin-Quisquater server-aided RSA protocol from Crypto '95 is not secure,” in Advances in Cryptology—ASIACRYPT 1998, vol. 1514 of Lecture Notes in Computer Science, pp. 372–379, Springer, Berlin, Germany, 1998. View at Publisher · View at Google Scholar
  13. M. Girault and J. J. Quisquater, “GQ + GPS = new ideas + new protocols,” in Proceedings of the Eurocrypt 2002-Rump Session, April-May 2002.
  14. M. Girault and D. Lefranc, “Server-aided verification: theory and practice,” in Advances in Cryptology—ASIACRYPT 2005, vol. 3788 of Lecture Notes in Computer Science, pp. 605–623, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. W. Wu, Y. Mu, W. Susilo, and X. Y. Huang, “Provably secure server-aided verification signatures,” Computers and Mathematics with Applications, vol. 61, no. 7, pp. 1705–1723, 2011. View at Publisher · View at Google Scholar · View at Scopus
  16. G. C. C. F. Pereira, M. A. Simplicío Jr., M. Naehrig, and P. S. L. M. Barreto, “A family of implementation-friendly BN elliptic curves,” Journal of Systems and Software, vol. 84, no. 8, pp. 1319–1326, 2011. View at Publisher · View at Google Scholar · View at Scopus
  17. S. Hohenberger and A. Lysyanskaya, “How to securely outsource cryptographic computations,” in Theory of Cryptography, vol. 3378 of Lecture Notes in Computer Science, pp. 264–282, Springer, Berlin, Germany, 2005. View at Publisher · View at Google Scholar · View at MathSciNet
  18. D. Boneh, G. Lynn, and H. Shacham, “Short signature from the Weil pairing,” in Advances in Cryptology—Asiacrypt 2001, vol. 2248 of Lecture Notes in Computer Science, pp. 514–532, Springer, Berlin, Germany, 2001. View at Google Scholar
  19. D. Boneh and X. Boyen, “Short signatures without random oracles,” in Advances in Cryptology—EUROCRYPT 2004, vol. 3027 of Lecture Notes in Computer Science, pp. 382–400, Springer, Berlin, Germany, 2004. View at Google Scholar
  20. F. Zhang, R. Safavi-Naini, and W. Susilo, “An efficient signature scheme from bilinear pairing and its applications,” in Public Key Cryptography—PKC 2004, vol. 2947 of Lecture Notes in Computer Science, pp. 277–290, 2004. View at Google Scholar
  21. B. Waters, “Efficient identity-based encryption without random oracles,” in Advances in Cryptology—EUROCRYPT 2005, vol. 3494 of Lecture Notes in Computer Science, pp. 114–127, 2005. View at Google Scholar
  22. X. Chen, F. Zhang, Y. Mu, and W. Susilo, “Efficient provably secure restrictive partially blind signatures from bilinear pairings,” in Financial Cryptography and Data Security, vol. 4107 of Lecture Notes in Computer Science, pp. 251–265, Springer, Berlin, Germany, 2006. View at Publisher · View at Google Scholar
  23. X. Chen, F. Zhang, W. Susilo, H. Tian, J. Li, and K. Kim, “Identity-based chameleon hash scheme without key exposure,” in Information Security and Privacy, vol. 6168 of Lecture Notes in Computer Science, pp. 200–215, Springer, 2010. View at Google Scholar
  24. S. Goldwasser, S. Micali, and R. L. Rivest, “A digital signature scheme secure against adaptive chosen-message attacks,” SIAM Journal on Computing, vol. 17, no. 2, pp. 281–308, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  25. D. Chaum, “Blind signatures for untraceable payments,” in Advances in Cryptology, pp. 199–203, Plenum, 1983. View at Google Scholar
  26. D. F. Aranha, K. Karabina, P. Longa, C. H. Gebotys, and J. López, “Faster explicit formulas for computing pairings over ordinary curves,” in Advances in Cryptology—EUROCRYPT 2011, vol. 6632 of Lecture Notes in Computer Science, pp. 48–68, Springer, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J.-L. Beuchat, J. E. Gonzalez-Díaz, S. Mitsunari, E. Okamoto, F. Rodríguez-Henríquez, and T. Teruya, “High-speed software implementation of the optimal ate pairing over Barreto-Naehrig curves,” in Pairing-Based Cryptography—Pairing 2010, vol. 6487 of Lecture Notes in Computer Science, pp. 21–39, Springer, 2010. View at Google Scholar
  28. D. Hankerson, A. J. Menezes, and M. Scott, “Software implementation of pairings,” in Identity-Based Cryptography, M. Joye and G. Neven, Eds., pp. 188–206, IOS Press, 2008. View at Google Scholar
  29. M. Naehrig, R. Niederhagen, and P. Schwabe, “New software speed records for cryptographic pairings,” in Progress in Cryptology—LATINCRYPT 2010, vol. 6212 of Lecture Notes in Computer Science, pp. 109–123, Springer, Berlin, Germany, 2010. View at Publisher · View at Google Scholar
  30. C. Costello, K. Lauter, and M. Naehrig, “Attractive subfamilies of BLS curves for implementing high-security pairings,” in Progress in Cryptology—INDOCRYPT 2011, vol. 7107 of Lecture Notes in Computer Science, pp. 320–342, Springer, 2011. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  31. L. Xu and S. Tang, “Server-aided verification signatures with privacy,” in Proceedings of the 4th International Conference on Emerging Intelligent Data and Web Technologies (EIDWT '13), pp. 414–421, September 2013. View at Publisher · View at Google Scholar · View at Scopus