logo

SCIENCE CHINA Information Sciences, Volume 61, Issue 5: 058103(2018) https://doi.org/10.1007/s11432-017-9205-0

Securely min and $\boldsymbol~k$-th min computations with fully homomorphic encryption

More info
  • ReceivedMar 17, 2017
  • AcceptedJun 21, 2017
  • PublishedNov 17, 2017

Abstract

There is no abstract available for this article.


Supplement

Appendixes A and B.


References

[1] Shi J, Zhang R, Liu Y, et al. Prisense: privacy-preserving 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 Secure Comput, 2014, 11: 115-129 CrossRef Google Scholar

[4] Zhang Y, Chen Q, Zhong S. Efficient and privacy-preserving 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. 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. 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

Copyright 2019 Science China Press Co., Ltd. 《中国科学》杂志社有限责任公司 版权所有

京ICP备18024590号-1