Secure and Verifiable Outsourcing of Sequence Comparisons

  • Yansheng Feng
  • Hua Ma
  • Xiaofeng Chen
  • Hui Zhu
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7804)


With the advent of cloud computing, secure outsourcing techniques of sequence comparisons are becoming increasingly valuable, especially for clients with limited resources. One of the most critical functionalities in data outsourcing is verifiability. However, there is very few secure outsourcing scheme for sequence comparisons that the clients can verify whether the servers honestly execute a protocol or not. In this paper, we tackle the problem by integrating the technique of garbled circuit with homomorphic encryption. As compared to existing schemes, our proposed solution enables clients to efficiently detect the dishonesty of servers. In particular, our construction re-garbles the circuit only for malformed responses and hence is very efficient. Besides, we also present the formal analysis for our proposed construction.


Outsourcing Garbled Circuit Verifiable Computation 


  1. 1.
    Atallah, M., Kerschbaum, F., Du, W.: Secure and private sequence comparisons. In: ACM Workshop on the Privacy in Electronic Society, WPES (2003)Google Scholar
  2. 2.
    Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. In: Workshop on Privacy Enhancing Technologies, PET, pp. 63–78 (2004)Google Scholar
  3. 3.
    Atallah, M., Li, J.: Secure outsourcing of sequence comparisons. International Journal of Information Security 4(4), 277–287 (2005)CrossRefGoogle Scholar
  4. 4.
    Blanton, M., Aliasgari, M.: Secure outsourcing of DNA searching via finite automata. In: DBSec, pp. 49–64 (2010)Google Scholar
  5. 5.
    Huang, Y., Evans, D., Katz, J., Malka, L.: Faster secure two-party computation using garbled circuits. In: USENIX Security Symposium (2011)Google Scholar
  6. 6.
    Jha, S., Kruger, L., Shmatikov, V.: Toward practical privacy for genomic computation. In: IEEE Symposium on Security and Privacy, pp. 216–230 (2008)Google Scholar
  7. 7.
    Kolesnikov, V., Sadeghi, A.-R., Schneider, T.: Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima. In: Garay, J.A., Miyaji, A., Otsuka, A. (eds.) CANS 2009. LNCS, vol. 5888, pp. 1–20. Springer, Heidelberg (2009)CrossRefGoogle Scholar
  8. 8.
    Szajda, D., Pohl, M., Owen, J., Lawson, B.: Toward a practical data privacy scheme for a distributed implementation of the Smith-Waterman genome sequence comparison algorithm. In: Network and Distributed System Security Symposium, NDSS (2006)Google Scholar
  9. 9.
    Yao, A.: How to generate and exchange secrets. In: IEEE Symposium on Foundations of Computer Science, FOCS, pp. 162–167 (1986)Google Scholar
  10. 10.
    Gentry, C.: Fully homomorphic encryption using ideal lattices. In: Proceedings of the ACM Symposium on the Theory of Computing, STOC (2009)Google Scholar
  11. 11.
    Blanton, M., Atallah, M.J., Frikken, K.B., Malluhi, Q.: Secure and Efficient Outsourcing of Sequence Comparisons. In: Foresti, S., Yung, M., Martinelli, F. (eds.) ESORICS 2012. LNCS, vol. 7459, pp. 505–522. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  12. 12.
    Lindell, Y., Pinkas, B.: A proof of Yao’s protocol for secure two-party computation. Journal of Cryptology 22(2), 161–188 (2009)MathSciNetCrossRefzbMATHGoogle Scholar
  13. 13.
    Gennaro, R., Gentry, C., Parno, B.: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers. In: Rabin, T. (ed.) CRYPTO 2010. LNCS, vol. 6223, pp. 465–482. Springer, Heidelberg (2010)CrossRefGoogle Scholar
  14. 14.
    Parno, B., Raykova, M., Vaikuntanathan, V.: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 422–439. Springer, Heidelberg (2012)CrossRefGoogle Scholar
  15. 15.
    Blanton, M., Zhang, Y., Frikken, K.B.: Secure and Verifiable Outsourcing of Large-Scale Biometric Computations. In: IEEE International Conference on Information Privacy, Security, Risk and Trust, PASSAT, pp. 1185–1191 (2011)Google Scholar
  16. 16.
    Vivek, S.S., Selvi, S.S.D., Venkatesan, R., Rangan, C.P.: A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, JoWUA 3(4), 46–60 (2012)Google Scholar
  17. 17.
    Wang, J., Ma, H., Tang, Q., Li, J., Zhu, H., Ma, S., Chen, X.: A New Effcient Veriable Fuzzy Keyword Search Scheme. Journal of Wireless Mobile Networks, Ubiquitous Computing, and Dependable Applications, JoWUA 3(4), 61–71 (2012)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Yansheng Feng
    • 1
  • Hua Ma
    • 1
  • Xiaofeng Chen
    • 2
  • Hui Zhu
    • 3
  1. 1.Department of MathematicsXidian UniversityXi’anP.R. China
  2. 2.State Key Laboratory of Integrated Service NetworksXidian UniversityXi’anP.R. China
  3. 3.Network and Data Security Key Laboratory of Sichuan ProvinceXidian UniversityChengduP.R. China

Personalised recommendations