default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKun Huang 0002
Person information
- affiliation: National University of Defense Technology, State Key Laboratory of Complex Electromagnetic Environment Effects on Electronics and Information System, Changsha, China
Other persons with the same name
- Kun Huang — disambiguation page
- Kun Huang 0001
![[0000-0002-8530-370X]](https://dblp.uni-trier.de/img/orcid-mark.12x12.png "0000-0002-8530-370X")
— Indiana University School of Medicine, Department of Biostatistics & Health Data Science, USA (and 2 more) - Kun Huang 0003 — Chinese Academy of Sciences, Institute of Computing Technology, China (and 1 more)
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Kun Huang, Udaya Parampalli, Ming Xian:
Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 65(2): 975-984 (2019)- 2017
- [j4]Kun Huang, Udaya Parampalli, Ming Xian:
On Secrecy Capacity of Minimum Storage Regenerating Codes. IEEE Trans. Inf. Theory 63(3): 1510-1524 (2017) - 2016
- [j3]Jian Liu, Huimei Wang, Ming Xian, Hong Rong, Kun Huang:
Reliable and confidential cloud storage with efficient data forwarding functionality. IET Commun. 10(6): 661-668 (2016) - [j2]Kun Huang, Udaya Parampalli, Ming Xian:
Security Concerns in Minimum Storage Cooperative Regenerating Codes. IEEE Trans. Inf. Theory 62(11): 6218-6232 (2016) - [c4]Hong Rong, Huimei Wang, Kun Huang, Jian Liu, Ming Xian:
Privacy-Preserving Scalar Product Computation in Cloud Environments Under Multiple Keys. IDEAL 2016: 248-258 - [i3]Kun Huang, Udaya Parampalli, Ming Xian:
Improved Upper Bounds on Systematic-Length for Linear Minimum Storage Regenerating Codes. CoRR abs/1610.08026 (2016) - 2015
- [c3]Jian Liu, Kun Huang, Hong Rong, Huimei Wang, Ming Xian:
Efficient and secure data forwarding for erasure-code-based cloud storage. ICC Workshops 2015: 1820-1826 - [i2]Kun Huang, Udaya Parampalli, Ming Xian:
Characterization of Secrecy Capacity for General MSR Codes under Passive Eavesdropping Model. CoRR abs/1505.01986 (2015) - [i1]Kun Huang, Udaya Parampalli, Ming Xian:
Security Concerns in Minimum Storage Cooperative Regenerating Codes. CoRR abs/1509.01324 (2015) - 2014
- [j1]Kun Huang, Ming Xian, Shaojing Fu, Jian Liu:
Securing the cloud storage audit service: defending against frame and collude attacks of third party auditor. IET Commun. 8(12): 2106-2113 (2014) - [c2]Kun Huang, Jian Liu, Ming Xian, Huimei Wang, Shaojing Fu:
Enabling dynamic proof of retrievability in regenerating-coding-based cloud storage. ICC Workshops 2014: 712-717 - 2013
- [c1]Jian Liu, Huimei Wang, Ming Xian, Kun Huang:
A Secure and Efficient Scheme for Cloud Storage against Eavesdropper. ICICS 2013: 75-89
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 2025-05-05 01:31 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:
