default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHuang Lin
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[c25]Huang Lin, Hakimeh Purmehdi, Yuxin Zhao, Wei Peng:
Building 5G Fingerprint Datasets for Accurate Indoor Positioning. FNWF 2022: 203-208- [c24]Suryanarayanaraju Pusapati, Bassant Selim, Yimin Nie, Huang Lin, Wei Peng:
Simulation of NR-V2X in a 5G Environment using OMNeT++. FNWF 2022: 634-638 - [c23]Jiaqi Wu, Huang Lin, Huaizhe Liu, Lin Gao:
A Deep Reinforcement Learning Approach for Collaborative Mobile Edge Computing. ICC 2022: 601-606 - [c22]Huang Lin, Lan Zhu, Wei Liang, Zhen Cheng, Yunhong Zheng:
Joint Estimation of SOC and SOH for Lithium Batteries based on DEKF. ICCSIE 2022: 1016-1020 - [c21]Lan Zhu, Huang Lin, Xia Chen, Wei Liang, Zhen Cheng, Dongheng Shao, Hui Yu, Yunhong Zheng, Weicheng Ma:
Indoor Robot Localization Based on Visual Perception and on Particle Filter Algorithm of Increasing Priority Particles. ICCSIE 2022: 1021-1026 - [c20]Zhen Cheng, Huang Lin, Wei Liang, Lan Zhu, Yunhong Zheng:
Research on Adaptive Control Strategy of Microgrid Inverter based on Virtual Synchronous Generator. ICCSIE 2022: 1027-1031 - [c19]Huang Lin:
Faceless: A Cross-Platform Private Payment scheme for Human-Readable Identifiers. PST 2022: 1-10 - 2021
- [c18]Geoffroy Couteau, Michael Klooß
, Huang Lin, Michael Reichle:
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. EUROCRYPT (3) 2021: 247-277 - [i5]Geoffroy Couteau, Michael Klooß, Huang Lin, Michael Reichle:
Efficient Range Proofs with Transparent Setup from Bounded Integer Commitments. IACR Cryptol. ePrint Arch. 2021: 540 (2021) - 2020
- [c17]Huang Lin:
A Sub-linear Lattice-Based Submatrix Commitment Scheme. ICISC 2020: 87-98
2010 – 2019
- 2018
- [c16]Carsten Baum, Huang Lin, Sabine Oechsner:
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. ICICS 2018: 303-322 - [i4]Carsten Baum, Huang Lin, Sabine Oechsner:
Towards Practical Lattice-Based One-Time Linkable Ring Signatures. IACR Cryptol. ePrint Arch. 2018: 107 (2018) - 2017
- [j7]Zhicong Huang, Huang Lin, Jacques Fellay, Zoltán Kutalik, Jean-Pierre Hubaux:
SQC: secure quality control for meta-analysis of genome-wide association studies. Bioinform. 33(15): 2273-2280 (2017) - [c15]Florian Tramèr, Fan Zhang, Huang Lin, Jean-Pierre Hubaux, Ari Juels, Elaine Shi:
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge. EuroS&P 2017: 19-34 - [c14]Florian Tramèr, Vaggelis Atlidakis, Roxana Geambasu, Daniel J. Hsu, Jean-Pierre Hubaux, Mathias Humbert, Ari Juels, Huang Lin:
FairTest: Discovering Unwarranted Associations in Data-Driven Applications. EuroS&P 2017: 401-416 - [c13]Zhu Ping, Huang Lin, Tong Xiao, Junbang Wang:
Spatial and temporal variations of habitat in typical nature reserves, china. IGARSS 2017: 2911-2914 - 2016
- [i3]Florian Tramèr, Fan Zhang, Huang Lin, Jean-Pierre Hubaux, Ari Juels, Elaine Shi:
Sealed-Glass Proofs: Using Transparent Enclaves to Prove and Sell Knowledge. IACR Cryptol. ePrint Arch. 2016: 635 (2016) - 2015
- [i2]Florian Tramèr, Vaggelis Atlidakis, Roxana Geambasu, Daniel J. Hsu, Jean-Pierre Hubaux, Mathias Humbert, Ari Juels, Huang Lin:
Discovering Unwarranted Associations in Data-Driven Applications with the FairTest Testing Toolkit. CoRR abs/1510.02377 (2015) - 2013
- [j6]Huang Lin, Jun Shao, Chi Zhang, Yuguang Fang:
CAM: Cloud-Assisted Privacy Preserving Mobile Health Monitoring. IEEE Trans. Inf. Forensics Secur. 8(6): 985-997 (2013) - [j5]Huang Lin, Yuguang Fang:
Privacy-Aware Profiling and Statistical Data Extraction for Smart Sustainable Energy Systems. IEEE Trans. Smart Grid 4(1): 332-340 (2013) - 2011
- [c12]Huang Lin, Zhenfu Cao, Yuguang Fang, Muxin Zhou, Haojin Zhu:
How to design space efficient revocable IBE from non-monotonic ABE. AsiaCCS 2011: 381-385 - [c11]Huang Lin, Xiaoyan Zhu, Yuguang Fang, Chi Zhang, Zhenfu Cao:
Efficient trust based information sharing schemes over distributed collaborative networks. MILCOM 2011: 1399-1403 - 2010
- [j4]Huang Lin, Zhenfu Cao:
On the security of metering scheme. Comput. Math. Appl. 60(2): 272-275 (2010) - [j3]Jun Shao, Zhenfu Cao, Xiaohui Liang, Huang Lin:
Proxy re-encryption with keyword search. Inf. Sci. 180(13): 2576-2587 (2010) - [j2]Huang Lin, Zhenfu Cao, Xiaohui Liang, Jun Shao:
Secure threshold multi authority attribute based encryption without a central authority. Inf. Sci. 180(13): 2618-2632 (2010) - [c10]Huang Lin, Zhenfu Cao, Xiaohui Liang, Muxin Zhou, Haojin Zhu, Dongsheng Xing:
How to Construct Interval Encryption from Binary Tree Encryption. ACNS 2010: 19-34 - [c9]Wei Chuang, Huang Lin:
Research on Monitoring System of Aquiculture with Multi-environmental Factors. APWCS 2010: 202-205 - [c8]Huang Lin, Jiyi Wang, Shuang Liu:
The Classification Study of Texture Image Based on the Rough Set Theory. GrC 2010: 720-723 - [c7]Shang-Hua Xiong, Jiyi Wang, Huang Lin:
Hybrid feature selection algorithm based on dynamic weighted ant colony algorithm. ICMLC 2010: 518-522 - [c6]Shuang Liu, Jiyi Wang, Huang Lin:
Associated-Conflict Analysis Using Covering Based on Granular Computing. LSMS/ICSEE (1) 2010: 297-303
2000 – 2009
- 2009
- [c5]Xiaohui Liang, Zhenfu Cao, Huang Lin, Jun Shao:
Attribute based proxy re-encryption with delegating capabilities. AsiaCCS 2009: 276-286 - [c4]Xiaohui Liang, Zhenfu Cao, Huang Lin, Dongsheng Xing:
Provably secure and efficient bounded ciphertext policy attribute based encryption. AsiaCCS 2009: 343-352 - 2008
- [c3]Huang Lin, He Peng:
Machine Recognition for Broad-Leaved Trees Based on Synthetic Features of Leaves Using Probabilistic Neural Network. CSSE (4) 2008: 871-877 - [c2]Huang Lin, Zhenfu Cao, Xiaohui Liang, Jun Shao:
Secure Threshold Multi Authority Attribute Based Encryption without a Central Authority. INDOCRYPT 2008: 426-436 - 2007
- [c1]Xiaohui Liang, Zhenfu Cao, Jun Shao, Huang Lin:
Short Group Signature Without Random Oracles. ICICS 2007: 69-82 - [i1]Xiaohui Liang, Zhenfu Cao, Jun Shao, Huang Lin:
Short Group Signature without Random Oracles. IACR Cryptol. ePrint Arch. 2007: 450 (2007)
1980 – 1989
- 1988
- [j1]Andrew C. Bartlett, Christopher V. Hollot, Huang Lin:
Root locations of an entire polytope of polynomials: It suffices to check the edges. Math. Control. Signals Syst. 1(1): 61-71 (1988)
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-07-17 21:28 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:
