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

Highlight
  • 58 Downloads

Supplementary material

11432_2017_9205_MOESM1_ESM.pdf (255 kb)
Securely min and k-th min computations with fully homomorphic encryption

References

  1. 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–766Google Scholar
  2. 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–10Google Scholar
  3. 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–129CrossRefGoogle Scholar
  4. 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–21Google Scholar
  5. 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–178MATHGoogle Scholar
  6. 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–92MATHGoogle Scholar
  7. 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–8Google Scholar

Copyright information

© Science China Press and Springer-Verlag GmbH Germany, part of Springer Nature 2017

Authors and Affiliations

  1. 1.Department of Computer Science and TechnologyNanjing UniversityNanjingChina

Personalised recommendations