How to vote privately using bitcoin Z Zhao, THH Chan
Information and Communications Security: 17th International Conference …, 2016
126 2016 C∅ C∅: a framework for building composable zero-knowledge proofs A Kosba, Z Zhao, A Miller, Y Qian, H Chan, C Papamanthou, R Pass, ...
Cryptology ePrint Archive, Report 2015/1093, 2015
65 2015 How to Use SNARKs in Universally Composable Protocols. AE Kosba, Z Zhao, A Miller, Y Qian, THH Chan, C Papamanthou, R Pass, ...
IACR Cryptol. ePrint Arch. 2015, 1093, 2015
38 2015 Ranking on arbitrary graphs: Rematch via continuous LP with monotone and boundary condition constraints THH Chan, F Chen, X Wu, Z Zhao
Proceedings of the twenty-fifth annual ACM-SIAM symposium on Discrete …, 2014
24 2014 Finding k most influential edges on flow graphs P Wong, C Sun, E Lo, ML Yiu, X Wu, Z Zhao, THH Chan, B Kao
Information Systems 65, 93-105, 2017
14 2017 C A Kosba, Z Zhao, A Miller, Y Qian, H Chan, C Papamanthou, R Pass, ...
Cryptology ePrint Archive, 2015
14 2015 abhi shelat, and Elaine Shi. How to use SNARKs in universally composable protocols A Kosba, Z Zhao, A Miller, Y Qian, H Chan, C Papamanthou, R Pass
Cryptology ePrint Archive, Report 2015/1093, 2015. http://eprint. iacr. org …, 2015
12 2015 Double auction for resource allocation in cloud computing Z Zhao, F Chen, HTH Chan, C Wu
International Conference on Cloud Computing and Services Science, CLOSER 2017, 2017
5 2017 Ranking on arbitrary graphs: Rematch via continuous linear programming TH Hubert Chan, F Chen, X Wu, Z Zhao
SIAM Journal on Computing 47 (4), 1529-1546, 2018
4 2018 Private, secure and truthful multi-party protocols Z Zhao
HKU Theses Online (HKUTO), 2016
2016 On the Complexity of the Minimum Independent Set Partition Problem THH Chan, C Papamanthou, Z Zhao
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
2015 Dynamic tree shortcut with constant degree THH Chan, X Wu, C Zhang, Z Zhao
Computing and Combinatorics: 21st International Conference, COCOON 2015 …, 2015
2015 