Jingguo Bi

Orcid: 0000-0002-6727-5485

According to our database1, Jingguo Bi authored at least 28 papers between 2009 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
A collusion-resistant certificateless provable data possession scheme for shared data with user revocation.
Clust. Comput., April, 2024

2023
Verifiable attribute-based keyword search scheme over encrypted data for personal health records in cloud.
J. Cloud Comput., December, 2023

An improved method for predicting truncated multiple recursive generators with unknown parameters.
Des. Codes Cryptogr., May, 2023

2022
An efficient secure data transmission and node authentication scheme for wireless sensing networks.
J. Syst. Archit., 2022

An Improved Outsourcing Algorithm to Solve Quadratic Congruence Equations in Internet of Things.
IEEE Internet Things J., 2022

Security Analysis of DBTRU Cryptosystem.
Entropy, 2022

2021
Lattice Attacks on NTRU Revisited.
IEEE Access, 2021

2020
Secure outsourcing of large matrix determinant computation.
Frontiers Comput. Sci., February, 2020

2019
An Improved Attack on the Basic Merkle-Hellman Knapsack Cryptosystem.
IEEE Access, 2019

Practical Scheme for Secure Outsourcing of Coppersmith's Algorithm.
Proceedings of the Knowledge Science, Engineering and Management, 2019

Secure Outsourcing of Lattice Basis Reduction.
Proceedings of the Neural Information Processing - 26th International Conference, 2019

2018
Equivalent key attack against a public-key cryptosystem based on subset sum problem.
IET Inf. Secur., 2018

A New Discrete Gaussian Sampler over Orthogonal Lattices.
IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 2018

2017
An Improved Algorithm to Solve the Systems of Univariate Modular Equations.
Proceedings of the Information Security Applications - 18th International Conference, 2017

2016
Sublinear Root Detection and New Hardness Results for Sparse Polynomials over Finite Fields.
SIAM J. Comput., 2016

Cryptanalysis of a Privacy Preserving Auditing for Data Integrity Protocol from TrustCom 2013.
Proceedings of the Information Security Practice and Experience, 2016

Cryptanalysis of a Homomorphic Encryption Scheme Over Integers.
Proceedings of the Information Security and Cryptology - 12th International Conference, 2016

Cryptanalysis of a Fast Private Information Retrieval Protocol.
Proceedings of the 3rd ACM International Workshop on ASIA Public-Key Cryptography, 2016

2014
Lower bounds of shortest vector lengths in random NTRU lattices.
Theor. Comput. Sci., 2014

Rounding and Chaining LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptol. ePrint Arch., 2014

2013
Rounding LLL: Finding Faster Small Roots of Univariate Polynomial Congruences.
IACR Cryptol. ePrint Arch., 2013

Sub-linear root detection, and new hardness results, for sparse polynomials over finite fields.
Proceedings of the International Symposium on Symbolic and Algebraic Computation, 2013

2012
Cryptanalysis of a homomorphic encryption scheme from ISIT 2008.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
Lower bounds of shortest vector lengths in random knapsack lattices and random NTRU lattices.
IACR Cryptol. ePrint Arch., 2011

2010
Improved Nguyen-Vidick Heuristic Sieve Algorithm for Shortest Vector Problem.
IACR Cryptol. ePrint Arch., 2010

Lattice-based Identity-Based Broadcast Encryption Scheme.
IACR Cryptol. ePrint Arch., 2010

2009
Cryptanalysis of two knapsack public-key cryptosystems.
IACR Cryptol. ePrint Arch., 2009

Weak Keys in RSA with Primes Sharing Least Significant Bits.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009


  Loading...