default search action
Gengran Hu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j21]Qiang Zhu
, Lin You
BIAS: A novel secure and efficient biometric-based anonymous authentication scheme. Comput. Networks 254: 110754 (2024) - [j20]Chunjie Guo, Lin You
A novel biometric authentication scheme with privacy protection based on SVM and ZKP. Comput. Secur. 144: 103995 (2024) - [j19]Qiang Zhu
Secure and Efficient Biometric-Based Anonymous Authentication Scheme for Mobile-Edge Computing. IEEE Internet Things J. 11(20): 33604-33623 (2024) - [j18]Gengran Hu
On the SVP for low-dimensional circulant lattices. J. Comb. Optim. 47(5): 81 (2024) - [j17]Zhiyuan Rao
EBDTS: An Efficient BCoT-Based Data Trading System Using PUF for Authentication. IEEE Trans. Netw. Serv. Manag. 21(5): 5795-5808 (2024) - 2023
- [j16]Weibiao Liang, Lin You
LRS_PKI: A novel blockchain-based PKI framework using linkable ring signatures. Comput. Networks 237: 110043 (2023) - [j15]Chengtang Cao, Lin You
A Novel Linkable Ring Signature on Ideal Lattices. Entropy 25(2): 237 (2023) - [j14]Lin You
An Improved Model on the Vague Sets-Based DPoS's Voting Phase in Blockchain. IEEE Trans. Netw. Sci. Eng. 10(6): 4010-4019 (2023) - [c7]Liang Li
Pairing Compression on Some Elliptic Curves with Subgroups of Embedding Degree 6 and Its Applications to Pairing-Based Cryptography. EISA 2023: 77-91 - [c6]Wang Cheng
A Multi-server Authentication Scheme Based on Fuzzy Extractor. ICA3PP (1) 2023: 488-500 - [c5]Zhuobiao Wang, Gengran Hu
An Improved Model of PBFT with Anonymity and Proxy Based on Linkable Ring Signature. ICA3PP (5) 2023: 491-502 - 2022
- [j13]Houyu Zheng, Lin You
A novel insurance claim blockchain scheme based on zero-knowledge proof technology. Comput. Commun. 195: 207-216 (2022) - [j12]Cong Deng, Lin You
Cuproof: Range Proof with Constant Size. Entropy 24(3): 334 (2022) - [j11]Yanli Chen
Efficient Privacy-Preserving Forensic Method for Camera Model Identification. IEEE Trans. Inf. Forensics Secur. 17: 2378-2393 (2022) - [j10]Xinhua Zhang
An Efficient and Robust Multidimensional Data Aggregation Scheme for Smart Grid Based on Blockchain. IEEE Trans. Netw. Serv. Manag. 19(4): 3949-3959 (2022) - [i7]Lin You, Yan Wang, Liang Li, Gengran Hu:
Secure Two-party Computation Approach for NTRUEncrypt. IACR Cryptol. ePrint Arch. 2022: 386 (2022) - 2021
- [j9]Xiwei Shan
Two Efficient Constructions for Biometric-Based Signature in Identity-Based Setting Using Bilinear Pairings. IEEE Access 9: 25973-25983 (2021) - [j8]Gengran Hu
Random Integer Lattice Generation via the Hermite Normal Form. Entropy 23(11): 1509 (2021) - [j7]Guojia Li, Lin You, Gengran Hu, Liqin Hu:
Recoverable Private Key Scheme for Consortium Blockchain Based on Verifiable Secret Sharing. KSII Trans. Internet Inf. Syst. 15(8): 2865-2878 (2021) - [j6]Peiyi Wang, Lin You
Biometric key generation based on generated intervals and two-layer error correcting technique. Pattern Recognit. 111: 107733 (2021) - [j5]Miqi Wu, Lin You
A Blockchain-Based Hierarchical Authentication Scheme for Multiserver Architecture. Secur. Commun. Networks 2021: 5592119:1-5592119:20 (2021) - [j4]Yingjie Xu
A Novel Machine Learning-Based Analysis Model for Smart Contract Vulnerability. Secur. Commun. Networks 2021: 5798033:1-5798033:12 (2021) - [j3]Chengtang Cao, Lin You
Fuzzy Identity-Based Ring Signature from Lattices. Secur. Commun. Networks 2021: 6692608:1-6692608:9 (2021) - [j2]Weihang Tan, Benjamin M. Case, Gengran Hu, Shuhong Gao, Yingjie Lao
An Ultra-Highly Parallel Polynomial Multiplier for the Bootstrapping Algorithm in a Fully Homomorphic Encryption Scheme. J. Signal Process. Syst. 93(6): 643-656 (2021) - [i6]Cong Deng, Xianghong Tang, Lin You, Gengran Hu:
Cuproof: A Novel Range Proof with Constant Size. IACR Cryptol. ePrint Arch. 2021: 127 (2021) - 2020
- [j1]Chunming Tang, Qiuxia Xu
Finding the maximal adversary structure from any given access structure. Inf. Sci. 508: 329-342 (2020) - [i5]Gengran Hu, Lin You, Liqin Hu, Hui Wang:
Random Integer Lattice Generation via HNF. IACR Cryptol. ePrint Arch. 2020: 208 (2020)
2010 – 2019
- 2019
- [i4]Benjamin M. Case, Shuhong Gao, Gengran Hu, Qiuxia Xu:
Fully Homomorphic Encryption with k-bit Arithmetic Operations. IACR Cryptol. ePrint Arch. 2019: 521 (2019) - 2015
- [c4]Yuyun Chen, Gengran Hu, Renzhang Liu, Yanbin Pan, Shikui Shang:
Relations Between Minkowski-Reduced Basis and \theta -orthogonal Basis of Lattice. ICIG (3) 2015: 169-179 - 2014
- [c3]Gengran Hu, Yanbin Pan, Feng Zhang:
Solving Random Subset Sum Problem by l p -norm SVP Oracle. Public Key Cryptography 2014: 399-410 - [i3]Gengran Hu, Yanbin Pan, Feng Zhang:
Solving Random Subset Sum Problem by lp-norm SVP Oracle. IACR Cryptol. ePrint Arch. 2014: 23 (2014) - 2013
- [c2]Feng Zhang, Yanbin Pan, Gengran Hu:
A Three-Level Sieve Algorithm for the Shortest Vector Problem. Selected Areas in Cryptography 2013: 29-47 - [c1]Gengran Hu, Yanbin Pan:
Improvements on Reductions among Different Variants of SVP and CVP. WISA 2013: 39-51 - [i2]Feng Zhang, Yanbin Pan, Gengran Hu:
A Three-Level Sieve Algorithm for the Shortest Vector Problem. IACR Cryptol. ePrint Arch. 2013: 536 (2013) - 2012
- [i1]Gengran Hu, Yanbin Pan:
A New Reduction from Search SVP to Optimization SVP. CoRR abs/1204.2040 (2012)
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-11-07 20:34 CET 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: