default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJingguo Bi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j13]Guang Yang, Lidong Han, Jingguo Bi, Fuqun Wang:
A collusion-resistant certificateless provable data possession scheme for shared data with user revocation. Clust. Comput. 27(2): 2165-2179 (2024)- 2023
- [j12]Han-Bing Yu, Qun-Xiong Zheng
, Yi-Jian Liu, Jingguo Bi, Yu-Fei Duan, Jing-Wen Xue, You Wu, Yue Cao, Rong Cheng, Lin Wang, Bai-Shun Sun:
An improved method for predicting truncated multiple recursive generators with unknown parameters. Des. Codes Cryptogr. 91(5): 1713-1736 (2023) - [j11]Yuqin Sun, Lidong Han, Jingguo Bi, Xiao Tan, Qi Xie:
Verifiable attribute-based keyword search scheme over encrypted data for personal health records in cloud. J. Cloud Comput. 12(1): 77 (2023) - 2022
- [j10]Xiaofei Tong, Jingguo Bi, Yufei Duan, Lixiang Li, Licheng Wang:
Security Analysis of DBTRU Cryptosystem. Entropy 24(10): 1349 (2022) - [j9]Xiulan Li, Jingguo Bi, Chengliang Tian, Hanlin Zhang, Jia Yu, Yanbin Pan:
An Improved Outsourcing Algorithm to Solve Quadratic Congruence Equations in Internet of Things. IEEE Internet Things J. 9(9): 6790-6802 (2022) - [j8]Lixiang Li, Sirui Li, Haipeng Peng, Jingguo Bi:
An efficient secure data transmission and node authentication scheme for wireless sensing networks. J. Syst. Archit. 133: 102760 (2022) - [i8]Han-Bing Yu, Qun-Xiong Zheng, Yi-Jian Liu, Jingguo Bi, Yu-Fei Duan, Jing-Wen Xue, You Wu, Yue Cao, Rong Cheng, Lin Wang, Bai-Shun Sun:
An improved method for predicting truncated multiple recursive generators with unknown parameters. IACR Cryptol. ePrint Arch. 2022: 1134 (2022) - 2021
- [j7]Jingguo Bi, Lidong Han:
Lattice Attacks on NTRU Revisited. IEEE Access 9: 66218-66222 (2021) - 2020
- [j6]Jiayang Liu, Jingguo Bi, Mu Li:
Secure outsourcing of large matrix determinant computation. Frontiers Comput. Sci. 14(1) (2020)
2010 – 2019
- 2019
- [j5]Jiayang Liu, Jingguo Bi, Songyan Xu:
An Improved Attack on the Basic Merkle-Hellman Knapsack Cryptosystem. IEEE Access 7: 59388-59393 (2019) - [c12]Jiayang Liu, Jingguo Bi:
Secure Outsourcing of Lattice Basis Reduction. ICONIP (2) 2019: 603-615 - [c11]Jiayang Liu, Jingguo Bi:
Practical Scheme for Secure Outsourcing of Coppersmith's Algorithm. KSEM (2) 2019: 229-240 - 2018
- [j4]Dianyan Xiao, Yang Yu, Jingguo Bi:
A New Discrete Gaussian Sampler over Orthogonal Lattices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 101-A(11): 1880-1887 (2018) - [j3]Jiayang Liu, Jingguo Bi:
Equivalent key attack against a public-key cryptosystem based on subset sum problem. IET Inf. Secur. 12(6): 498-501 (2018) - 2017
- [c10]Jingguo Bi, Mingqiang Wang, Wei Wei:
An Improved Algorithm to Solve the Systems of Univariate Modular Equations. WISA 2017: 51-60 - 2016
- [j2]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields. SIAM J. Comput. 45(4): 1433-1447 (2016) - [c9]Jiayang Liu, Jingguo Bi:
Cryptanalysis of a Fast Private Information Retrieval Protocol. AsiaPKC@AsiaCCS 2016: 56-60 - [c8]Jingguo Bi, Jiayang Liu, Xiaoyun Wang:
Cryptanalysis of a Homomorphic Encryption Scheme Over Integers. Inscrypt 2016: 243-252 - [c7]Jingguo Bi, Jiayang Liu:
Cryptanalysis of a Privacy Preserving Auditing for Data Integrity Protocol from TrustCom 2013. ISPEC 2016: 37-47 - 2014
- [j1]Jingguo Bi, Qi Cheng:
Lower bounds of shortest vector lengths in random NTRU lattices. Theor. Comput. Sci. 560: 121-130 (2014) - [c6]Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun:
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. Public Key Cryptography 2014: 185-202 - [i7]Jingguo Bi, Jean-Sébastien Coron, Jean-Charles Faugère, Phong Q. Nguyen, Guénaël Renault, Rina Zeitoun:
Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2014: 437 (2014) - 2013
- [c5]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields. ISSAC 2013: 61-68 - [i6]Jingguo Bi, Phong Q. Nguyen:
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences. IACR Cryptol. ePrint Arch. 2013: 512 (2013) - 2012
- [c4]Jingguo Bi, Mingjie Liu, Xiaoyun Wang:
Cryptanalysis of a homomorphic encryption scheme from ISIT 2008. ISIT 2012: 2152-2156 - [c3]Jingguo Bi, Qi Cheng:
Lower Bounds of Shortest Vector Lengths in Random NTRU Lattices. TAMC 2012: 143-155 - [i5]Jingguo Bi, Qi Cheng, J. Maurice Rojas:
Sub-Linear Root Detection, and New Hardness Results, for Sparse Polynomials Over Finite Fields. CoRR abs/1204.1113 (2012) - 2011
- [c2]Xiaoyun Wang, Mingjie Liu, Chengliang Tian, Jingguo Bi:
Improved Nguyen-Vidick heuristic sieve algorithm for shortest vector problem. AsiaCCS 2011: 1-9 - [i4]Jingguo Bi, Qi Cheng:
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices. IACR Cryptol. ePrint Arch. 2011: 153 (2011) - 2010
- [i3]Jin Wang, Jingguo Bi:
Lattice-based Identity-Based Broadcast Encryption Scheme. IACR Cryptol. ePrint Arch. 2010: 288 (2010) - [i2]Xiaoyun Wang, Mingjie Liu, Chengliang Tian, Jingguo Bi:
Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem. IACR Cryptol. ePrint Arch. 2010: 647 (2010)
2000 – 2009
- 2009
- [c1]Xianmeng Meng, Jingguo Bi:
Weak Keys in RSA with Primes Sharing Least Significant Bits. Inscrypt 2009: 278-287 - [i1]Jingguo Bi, Lidong Han, Xianmeng Meng:
Cryptanalysis of two knapsack public-key cryptosystems. IACR Cryptol. ePrint Arch. 2009: 537 (2009)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-02 00:07 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
