Skip to main content
SpringerLink
Log in

Securely min and k-th min computations with fully homomorphic encryption

  • Highlight
  • Published:
Science China Information Sciences Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Shi J, Zhang R, Liu Y, et al. Prisense: privacypreserving data aggregation in people-centric urban sensing systems. In: Proceedings of the 29th Conference on Information Communications, San Diego, 2010. 758–766

    Google Scholar 

  2. Li Q, Cao G. Efficient and privacy-aware data aggregation in mobile sensing. In: Proceedings of the 20th IEEE International Conference on Network Protocols, Austin, 2012. 1–10

    Google Scholar 

  3. Li Q, Cao G, Porta T F L. Efficient and privacy-aware data aggregation in mobile sensing. IEEE Trans Dependable Sec Comput, 2014, 11: 115–129

    Article  Google Scholar 

  4. Zhang Y, Chen Q, Zhong S. Efficient and privacypreserving min and K-th min computations in mobile sensing systems. IEEE Trans Dependable Sec Comput, 2015, 14: 9–21

    Google Scholar 

  5. Gentry C. Fully homomrphic encryption using ideal lattices. In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, New York, 2009. 169–178

    MATH  Google Scholar 

  6. Gentry C, Sahai A, Waters B. Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based. In: Advances in Cryptology — CRYPTO 2013. Berlin: Springer, 2013. 8042: 75–92

    MATH  Google Scholar 

  7. Jiang B, Zhang Y. Privacy-preserving min and k-th min computatoins with fully homomorphic encryption. In: Proceedings of 34th IEEE International Performance Computing and Communicatons Conference, Nanjing, 2015. 1–8

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Technology, Nanjing University, Nanjing, 210046, China

    Bingbing Jiang & Yuan Zhang

Authors
  1. Bingbing Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yuan Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Yuan Zhang.

Additional information

The authors declare that they have no conflict of interest.

Electronic supplementary material

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Jiang, B., Zhang, Y. Securely min and k-th min computations with fully homomorphic encryption. Sci. China Inf. Sci. 61, 058103 (2018). https://doi.org/10.1007/s11432-017-9205-0

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • DOI: https://doi.org/10.1007/s11432-017-9205-0

Search

Navigation