Search

Your search keyword '"Cao, Zhenfu"' showing total 802 results
Start Over Author "Cao, Zhenfu"
802 results on '"Cao, Zhenfu"'

2. An Efficient Integer-Wise ReLU on TFHE

Author

Huang, Yi, Wan, Junping, Jiang, Zoe L., Zhou, Jun, Fang, Junbin, Cao, Zhenfu, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Zhu, Tianqing, editor, and Li, Yannan, editor

Published
2024
Full Text
View/download PDF

6. SVFL: Secure Vertical Federated Learning on Linear Models

Author

Luo, Kaifeng, Cao, Zhenfu, Shen, Jiachen, Dong, Xiaolei, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Chen, Chao, editor, and Meng, Weizhi, editor

Published
2023
Full Text
View/download PDF

8. Mining for Better: An Energy-Recycling Consensus Algorithm to Enhance Stability with Deep Learning

Author

Xia, Zhen, Cao, Zhenfu, Shen, Jiachen, Dong, Xiaolei, Zhou, Jun, Fang, Liming, Liu, Zhe, Ge, Chunpeng, Su, Chunhua, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Meng, Weizhi, editor, Yan, Zheng, editor, and Piuri, Vincenzo, editor

Published
2023
Full Text
View/download PDF

14. Lighter is Better: A Lighter Multi-client Verifiable Outsourced Computation with Hybrid Homomorphic Encryption

Author

Wang, Xingkai, Cao, Zhenfu, Liu, Zhen, Liang, Kaitai, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Atluri, Vijayalakshmi, editor, Di Pietro, Roberto, editor, Jensen, Christian D., editor, and Meng, Weizhi, editor

Published
2022
Full Text
View/download PDF

22. Tight Security Analysis of 3-Round Key-Alternating Cipher with a Single Permutation

Author

Wu, Yusai, Yu, Liqing, Cao, Zhenfu, Dong, Xiaolei, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Moriai, Shiho, editor, and Wang, Huaxiong, editor

Published
2020
Full Text
View/download PDF

23. Anonymous IBE from Quadratic Residuosity with Fast Encryption

Author

Zhao, Xiaopeng, Cao, Zhenfu, Dong, Xiaolei, Zheng, Jinwen, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Susilo, Willy, editor, Deng, Robert H., editor, Guo, Fuchun, editor, Li, Yannan, editor, and Intan, Rolly, editor

Published
2020
Full Text
View/download PDF

24. New Assumptions and Efficient Cryptosystems from the e-th Power Residue Symbol

Author

Zhao, Xiaopeng, Cao, Zhenfu, Dong, Xiaolei, Shao, Jun, Wang, Licheng, Liu, Zhusen, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Liu, Joseph K., editor, and Cui, Hui, editor

Published
2020
Full Text
View/download PDF

25. On Shor's Factoring Algorithm with More Registers and the Problem to Certify Quantum Computers

Author

Cao, Zhengjun and Cao, Zhenfu

Subjects
Computer Science - Data Structures and Algorithms
Abstract

Shor's factoring algorithm uses two quantum registers. By introducing more registers we show that the measured numbers in these registers which are of the same pre-measurement state, should be equal if the original Shor's complexity argument is sound. This contradicts the argument that the second register has $r$ possible measured values. There is an anonymous comment which argues that the states in these registers are entangled. If so, the entanglement involving many quantum registers can not be interpreted by the mechanism of EPR pairs and the like. In view of this peculiar entanglement has not yet been mentioned and investigated, we think the claim that the Shor's algorithm runs in polynomial time needs more physical verifications. We also discuss the problem to certify quantum computers., Comment: 12 pages. The extended abstract of this paper appeared in Proceeding of 2nd International Symposium on Information Science and Engineering, 2009

Published
2014

28. SDKSE-KGA: A Secure Dynamic Keyword Searchable Encryption Scheme Against Keyword Guessing Attacks

Author

Chen, Hongyuan, Cao, Zhenfu, Dong, Xiaolei, Shen, Jiachen, Rannenberg, Kai, Editor-in-Chief, Soares Barbosa, Luís, Editorial Board Member, Goedicke, Michael, Editorial Board Member, Tatnall, Arthur, Editorial Board Member, Neuhold, Erich J., Editorial Board Member, Stiller, Burkhard, Editorial Board Member, Tröltzsch, Fredi, Editorial Board Member, Pries-Heje, Jan, Editorial Board Member, Kreps, David, Editorial Board Member, Reis, Ricardo, Editorial Board Member, Furnell, Steven, Editorial Board Member, Mercier-Laurent, Eunika, Editorial Board Member, Winckler, Marco, Editorial Board Member, Malaka, Rainer, Editorial Board Member, Meng, Weizhi, editor, Cofta, Piotr, editor, Jensen, Christian Damsgaard, editor, and Grandison, Tyrone, editor

Published
2019
Full Text
View/download PDF

29. Efficient White-Box Traceable ABE for Vehicular Networks

Author

Lai, Siyuan, Cao, Zhenfu, Dong, Xiaolei, Shen, Jiachen, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Patnaik, Srikanta, editor, and Jain, Vipul, editor

Published
2019
Full Text
View/download PDF

30. Efficient Collision Attack Frameworks for RIPEMD-160

Author

Liu, Fukang, Dobraunig, Christoph, Mendel, Florian, Isobe, Takanori, Wang, Gaoli, Cao, Zhenfu, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Boldyreva, Alexandra, editor, and Micciancio, Daniele, editor

Published
2019
Full Text
View/download PDF

31. Finding Ordinary Cube Variables for Keccak-MAC with Greedy Algorithm

Author

Liu, Fukang, Cao, Zhenfu, Wang, Gaoli, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Attrapadung, Nuttapong, editor, and Yagi, Takeshi, editor

Published
2019
Full Text
View/download PDF

36. Remarks on Quantum Modular Exponentiation and Some Experimental Demonstrations of Shor's Algorithm

Author

Cao, Zhengjun, Cao, Zhenfu, and Liu, Lihua

Subjects
Computer Science - Data Structures and Algorithms
Abstract

An efficient quantum modular exponentiation method is indispensible for Shor's factoring algorithm. But we find that all descriptions presented by Shor, Nielsen and Chuang, Markov and Saeedi, et al., are flawed. We also remark that some experimental demonstrations of Shor's algorithm are misleading, because they violate the necessary condition that the selected number $q=2^s$, where $s$ is the number of qubits used in the first register, must satisfy $n^2 \leq q < 2n^2$, where $n$ is the large number to be factored., Comment: 12 pages,5 figures. The original version has 6 pages. It did not point out the reason that some researchers took for granted that quantum modlar exponentiation is in polynomial time. In the new version, we indicate the reason and analyze some experimental demonstrations of Shor's algorithm. Besides, the author Zhenfu Cao is added to the version for his contribution. arXiv admin note: text overlap with arXiv:1409.7352

Published
2014

41. Server-Aided Directly Revocable Ciphertext-Policy Attribute-Based Encryption with Verifiable Delegation

Author

Yu, Gang, Ma, Xiaoxiao, Cao, Zhenfu, Zhu, Weihua, Zeng, Guang, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Qing, Sihan, editor, Mitchell, Chris, editor, Chen, Liqun, editor, and Liu, Dongmei, editor

Published
2018
Full Text
View/download PDF

42. Efficient Multi-keyword Searchable Encryption Based on Multi-input Inner-Product Functional Encryption

Author

Liang, Yunong, Cao, Zhenfu, Dong, Xiaolei, Shen, Jiachen, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Naccache, David, editor, Xu, Shouhuai, editor, Qing, Sihan, editor, Samarati, Pierangela, editor, Blanc, Gregory, editor, Lu, Rongxing, editor, Zhang, Zonghua, editor, and Meddahi, Ahmed, editor

Published
2018
Full Text
View/download PDF

43. PPOIM: Privacy-Preserving Shape Context Based Image Denoising and Matching with Efficient Outsourcing

Author

Zheng, Meng, Zhou, Jun, Cao, Zhenfu, Dong, Xiaolei, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Naccache, David, editor, Xu, Shouhuai, editor, Qing, Sihan, editor, Samarati, Pierangela, editor, Blanc, Gregory, editor, Lu, Rongxing, editor, Zhang, Zonghua, editor, and Meddahi, Ahmed, editor

Published
2018
Full Text
View/download PDF

45. AIOL: An Improved Orthogonal Lattice Algorithm for the General Approximate Common Divisor Problem.

Author

Ran, Yinxia, Pan, Yun, Wang, Licheng, and Cao, Zhenfu

Subjects
PROBLEM solving, INTEGERS
Abstract

The security of several fully homomorphic encryption (FHE) schemes depends on the intractability assumption of the approximate common divisor (ACD) problem over integers. Subsequent efforts to solve the ACD problem as well as its variants were also developed during the past decade. In this paper, an improved orthogonal lattice (OL)-based algorithm, AIOL, is proposed to solve the general approximate common divisor (GACD) problem. The conditions for ensuring the feasibility of AIOL are also presented. Compared to the Ding–Tao OL algorithm, the well-known LLL reduction method is used only once in AIOL, and when the error vector r is recovered in AIOL, the possible difference between the restored and the true value of p is given. Experimental comparisons between the Ding-Tao algorithm and ours are also provided to validate our improvements. [ABSTRACT FROM AUTHOR]

Published
2023
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results