default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHsuan-Yin Lin
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j15]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin
, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially Private Decentralized Learning. IEEE J. Sel. Areas Inf. Theory 5: 407-423 (2024)- [j14]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices From Codes Over the Integers Modulo 4. IEEE Trans. Inf. Theory 70(5): 3309-3329 (2024) - [c28]Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin:
Generalizing Quantum Tanner Codes. ISIT (Workshops) 2024: 1-6 - [c27]Kuan-Yu Lin, Hsuan-Yin Lin, Yu-Pin Hsu, Yu-Chih Huang:
Age Aware Scheduling for Differentially-Private Federated Learning. ISIT 2024: 398-403 - [i33]Karen M. Dæhli, Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes:
Improved Capacity Outer Bound for Private Quadratic Monomial Computation. CoRR abs/2401.06125 (2024) - [i32]Asbjørn O. Orvedal, Hsuan-Yin Lin, Eirik Rosnes:
Weakly-Private Information Retrieval From MDS-Coded Distributed Storage. CoRR abs/2401.09412 (2024) - [i31]Maiara F. Bollauf, Hsuan-Yin Lin:
On the Maximum Theta Series over Unimodular Lattices. CoRR abs/2403.16932 (2024) - [i30]Kuan-Yu Lin, Hsuan-Yin Lin, Yu-Pin Hsu, Yu-Chih Huang:
Age Aware Scheduling for Differentially-Private Federated Learning. CoRR abs/2405.05962 (2024) - [i29]Olai Å. Mostad, Eirik Rosnes, Hsuan-Yin Lin:
Generalizing Quantum Tanner Codes. CoRR abs/2405.07980 (2024) - [i28]Hsuan-Yin Lin, Yi-Sheng Su, Mao-Ching Chiu:
Achieving Optimal Short-Blocklength Secrecy Rate Using Multi-Kernel PAC Codes for the Binary Erasure Wiretap Channel. CoRR abs/2409.00852 (2024) - [i27]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation. CoRR abs/2411.07094 (2024) - 2023
- [j13]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. IEEE Trans. Inf. Theory 69(12): 7755-7776 (2023) - [c26]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Differentially-Private Collaborative Online Personalized Mean Estimation. ISIT 2023: 737-742 - [c25]Wrya K. Kadir, Hsuan-Yin Lin, Eirik Rosnes:
Efficient Interpolation-Based Decoding of Reed-Solomon Codes. ISIT 2023: 997-1002 - [c24]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes:
Single-Server Pliable Private Information Retrieval With Side Information. ISIT 2023: 1526-1531 - [c23]Palma Persson, Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Isodual Lattices from Tail-Biting Convolutional Codes. ISTC 2023: 1-5 - [c22]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Construction and Secrecy Gain of Formally Unimodular Lattices in Odd Dimensions. ITW 2023: 186-191 - [i26]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Secrecy Gain of Formally Unimodular Lattices from Codes over the Integers Modulo 4. CoRR abs/2303.08083 (2023) - [i25]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes:
Single-Server Pliable Private Information Retrieval With Side Information. CoRR abs/2305.06857 (2023) - [i24]Wrya K. Kadir, Hsuan-Yin Lin, Eirik Rosnes:
Efficient Interpolation-Based Decoding of Reed-Solomon Codes. CoRR abs/2307.00891 (2023) - [i23]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
On the Capacity of Private Nonlinear Computation for Replicated Databases. CoRR abs/2307.01772 (2023) - 2022
- [j12]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. IEEE J. Sel. Areas Commun. 40(3): 832-846 (2022) - [j11]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Linear Computation for Noncolluding Coded Databases. IEEE J. Sel. Areas Commun. 40(3): 847-861 (2022) - [j10]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Polynomial Function Computation for Noncolluding Coded Databases. IEEE Trans. Inf. Forensics Secur. 17: 1800-1813 (2022) - [j9]Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval. IEEE Trans. Inf. Forensics Secur. 17: 3495-3510 (2022) - [j8]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Multi-Server Weakly-Private Information Retrieval. IEEE Trans. Inf. Theory 68(2): 1197-1219 (2022) - [c21]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. ISIT 2022: 3226-3231 - [c20]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning. ITW 2022: 708-713 - [i22]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
On the Secrecy Gain of Formally Unimodular Construction A4 Lattices. CoRR abs/2202.09236 (2022) - [i21]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
Formally Unimodular Packings for the Gaussian Wiretap Channel. CoRR abs/2206.14171 (2022) - [i20]Yauhen Yakimenka, Chung-Wei Weng, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Straggler-Resilient Differentially-Private Decentralized Learning. CoRR abs/2212.03080 (2022) - 2021
- [j7]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval. IEEE J. Sel. Areas Inf. Theory 2(1): 415-427 (2021) - [c19]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. ISIT 2021: 2262-2267 - [i19]Maiara F. Bollauf, Hsuan-Yin Lin, Øyvind Ytrehus:
The Secrecy Gain of Formally Unimodular Lattices on the Gaussian Wiretap Channel. CoRR abs/2111.01439 (2021) - [i18]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Optimal Rate-Distortion-Leakage Tradeoff for Single-Server Information Retrieval. CoRR abs/2111.05160 (2021) - 2020
- [j6]Dingwen Yuan, Hsuan-Yin Lin, Jörg Widmer, Matthias Hollick:
Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks. IEEE/ACM Trans. Netw. 28(5): 2188-2202 (2020) - [j5]Hsuan-Yin Lin, Po-Ning Chen, Yunghsiang S. Han, Pramod K. Varshney:
Minimum Byzantine Effort for Blinding Distributed Detection in Wireless Sensor Networks. IEEE Trans. Signal Process. 68: 647-661 (2020) - [c18]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval. ISIT 2020: 1053-1058 - [i17]Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes:
On the Capacity of Private Monomial Computation. CoRR abs/2001.06320 (2020) - [i16]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
The Capacity of Single-Server Weakly-Private Information Retrieval. CoRR abs/2001.08727 (2020) - [i15]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Function Computation for Noncolluding Coded Databases. CoRR abs/2003.10007 (2020) - [i14]Dingwen Yuan, Hsuan-Yin Lin, Jörg Widmer, Matthias Hollick:
Optimal and Approximation Algorithms for Joint Routing and Scheduling in Millimeter-Wave Cellular Networks. CoRR abs/2007.02621 (2020) - [i13]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Multi-Server Weakly-Private Information Retrieval. CoRR abs/2007.10174 (2020) - [i12]Chung-Wei Weng, Yauhen Yakimenka, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Generative Adversarial User Privacy in Lossy Single-Server Information Retrieval. CoRR abs/2012.03902 (2020)
2010 – 2019
- 2019
- [j4]Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Achieving Maximum Distance Separable Private Information Retrieval Capacity With Linear Codes. IEEE Trans. Inf. Theory 65(7): 4243-4273 (2019) - [c17]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Weakly-Private Information Retrieval. ISIT 2019: 1257-1261 - [c16]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Polynomial Computation for Noncolluding Coded Databases. ISIT 2019: 1677-1681 - [c15]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Improved Private Information Retrieval for Coded Storage From Code Decomposition : (Invited Paper). ITW 2019: 1-5 - [c14]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
On the Capacity of Private Nonlinear Computation for Replicated Databases. ITW 2019: 1-5 - [i11]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat, Eitan Yaakobi:
Weakly-Private Information Retrieval. CoRR abs/1901.06730 (2019) - [i10]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Private Polynomial Computation for Noncolluding Coded Databases. CoRR abs/1901.10286 (2019) - 2018
- [j3]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Weak Flip Codes and their Optimality on the Binary Erasure Channel. IEEE Trans. Inf. Theory 64(7): 5191-5218 (2018) - [j2]Chun-Yi Wei, Hsuan-Yin Lin, Po-Ning Chen, Yunghsiang S. Han, Pramod K. Varshney:
Target Localization Using Sensor Location Knowledge in Wireless Sensor Networks. IEEE Wirel. Commun. Lett. 7(3): 456-459 (2018) - [c13]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Capacity of Private Linear Computation for Coded Databases. Allerton 2018: 813-820 - [c12]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
The r-wise hamming distance and its operational interpretation for block codes. CISS 2018: 1-6 - [c11]Dingwen Yuan, Hsuan-Yin Lin, Jörg Widmer, Matthias Hollick:
Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks. INFOCOM 2018: 1205-1213 - [c10]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
An MDS-PIR Capacity-Achieving Protocol for Distributed Storage Using Non-MDS Linear Codes. ISIT 2018: 966-970 - [c9]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Connections Between the Error Probability and the r-wise Hamming Distances. ISITA 2018: 130-134 - [c8]Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes. ITW 2018: 1-5 - [c7]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage. ITW 2018: 1-5 - [i9]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
A Capacity-Achieving PIR Protocol for Distributed Storage Using an Arbitrary Linear Code. CoRR abs/1801.04923 (2018) - [i8]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
Asymmetry Helps: Improved Private Information Retrieval Protocols for Distributed Storage. CoRR abs/1806.01342 (2018) - [i7]Hsuan-Yin Lin, Siddhartha Kumar, Eirik Rosnes, Alexandre Graell i Amat:
On the Fundamental Limit of Private Information Retrieval for Coded Distributed Storage. CoRR abs/1808.09018 (2018) - [i6]Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Local Reconstruction Codes: A Class of MDS-PIR Capacity-Achieving Codes. CoRR abs/1809.06648 (2018) - [i5]Sarah A. Obead, Hsuan-Yin Lin, Eirik Rosnes, Jörg Kliewer:
Capacity of Private Linear Computation for Coded Databases. CoRR abs/1810.04230 (2018) - 2017
- [i4]Hsuan-Yin Lin, Eirik Rosnes:
Lengthening and Extending Binary Private Information Retrieval Codes. CoRR abs/1707.03495 (2017) - [i3]Hsuan-Yin Lin, Stefan M. Moser, Po-Ning Chen:
Weak Flip Codes and their Optimality on the Binary Erasure Channel. CoRR abs/1711.03310 (2017) - [i2]Siddhartha Kumar, Hsuan-Yin Lin, Eirik Rosnes, Alexandre Graell i Amat:
Achieving Private Information Retrieval Capacity in Distributed Storage Using an Arbitrary Linear Code. CoRR abs/1712.03898 (2017) - [i1]Dingwen Yuan, Hsuan-Yin Lin, Joerg Widmer, Matthias Hollick:
Optimal Joint Routing and Scheduling in Millimeter-Wave Cellular Networks. CoRR abs/1712.04059 (2017) - 2016
- [c6]Po-Ning Chen, Yunghsiang S. Han, Hsuan-Yin Lin, Pramod K. Varshney:
Optimal Byzantine attack for distributed inference with M-ary quantized data. ISIT 2016: 2474-2478 - 2015
- [c5]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Nonlinear codes outperform the best linear codes on the binary erasure channel. ISIT 2015: 1751-1755 - 2013
- [j1]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Optimal Ultrasmall Block-Codes for Binary Discrete Memoryless Channels. IEEE Trans. Inf. Theory 59(11): 7346-7378 (2013) - [c4]Yuan-Zhu Guo, Hsuan-Yin Lin, Stefan M. Moser:
The asymptotic capacity of noncoherent single-input multiple-output fading channels with memory and feedback. ISIT 2013: 2269-2273 - [c3]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Equidistant codes meeting the Plotkin bound are Not optimal on the binary symmetric channel. ISIT 2013: 3015-3019 - 2012
- [c2]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Weak flip codes and applications to optimal code design on the binary erasure channel. Allerton Conference 2012: 160-167 - 2011
- [c1]Po-Ning Chen, Hsuan-Yin Lin, Stefan M. Moser:
Ultra-small block-codes for binary discrete memoryless channels. ITW 2011: 175-179
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-01-09 13:13 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:
