liu.seSearch for publications in DiVA
Change search
Refine search result
1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Rows per page
  • 5
  • 10
  • 20
  • 50
  • 100
  • 250
Sort
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
  • Standard (Relevance)
  • Author A-Ö
  • Author Ö-A
  • Title A-Ö
  • Title Ö-A
  • Publication type A-Ö
  • Publication type Ö-A
  • Issued (Oldest first)
  • Issued (Newest first)
  • Created (Oldest first)
  • Created (Newest first)
  • Last updated (Oldest first)
  • Last updated (Newest first)
  • Disputation date (earliest first)
  • Disputation date (latest first)
Select
The maximal number of hits you can export is 250. When you want to export more records please use the Create feeds function.
  • 1.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Fritschek, Rick
    Tech Univ Dresden, Germany.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany.
    Concatenated Classic and Neural (CCN) Codes: ConcatenatedAE2023In: 2023 IEEE WIRELESS COMMUNICATIONS AND NETWORKING CONFERENCE, WCNC, IEEE , 2023Conference paper (Refereed)
    Abstract [en]

    Small neural networks (NNs) used for error correction were shown to improve on classic channel codes and to address channel model changes. We extend the code dimension of any such structure by using the same NN under one-hot encoding multiple times, then serially-concatenated with an outer classic code. We design NNs with the same network parameters, where each Reed-Solomon codeword symbol is an input to a different NN. Significant improvements in block error probabilities for an additive Gaussian noise channel as compared to the small neural code are illustrated, as well as robustness to channel model changes.

  • 2.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany; Tech Univ Dresden, Germany.
    Boche, Holger
    Tech Univ Munich, Germany; Ruhr Univ Bochum, Germany; Tech Univ Munich, Germany; Munich Ctr Quantum Sci & Technol MCQST, Germany.
    Poor, H. Vincent
    Princeton Univ, NJ 08544 USA.
    Information Theoretic Methods for Future Communication Systems2023In: Entropy, E-ISSN 1099-4300, Vol. 25, no 3, article id 392Article in journal (Other academic)
    Download full text (pdf)
    fulltext
  • 3.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany.
    Poor, H. Vincent
    Princeton Univ, NJ 08544 USA.
    Quality of Security Guarantees for and with Physical Unclonable Functions and Biometric Secrecy Systems2023In: Entropy, E-ISSN 1099-4300, Vol. 25, no 8, article id 1243Article in journal (Refereed)
    Abstract [en]

    Unique digital circuit outputs, considered as physical unclonable function (PUF) circuit outputs, can facilitate a secure and reliable secret key agreement. To tackle noise and high correlations between the PUF circuit outputs, transform coding methods combined with scalar quantizers are typically applied to extract the uncorrelated bit sequences reliably. In this paper, we create realistic models for these transformed outputs by fitting truncated distributions to them. We also show that the state-of-the-art models are inadequate to guarantee a target reliability level for all PUF outputs, which also means that secrecy cannot be guaranteed. Therefore, we introduce a quality of security parameter to control the percentage of the PUF circuit outputs for which a target security level can be guaranteed. By applying the finite-length information theory results to a public ring oscillator output dataset, we illustrate that security guarantees can be provided for each bit extracted from any PUF device by eliminating only a small subset of PUF circuit outputs. Furthermore, we conversely show that it is not possible to provide reliability or security guarantees without eliminating any PUF circuit output. Our holistic methods and analyses can be applied to any PUF type, as well as any biometric secrecy system, with continuous-valued outputs to extract secret keys with low hardware complexity.

    Download full text (pdf)
    fulltext
  • 4.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany; Tech Univ Dresden, Germany.
    Boche, Holger
    Tech Univ Munich, Germany; Tech Univ Munich, Germany; Ruhr Univ Bochum, Germany; Munich Quantum Valley MQV, Germany.
    Poor, H. Vincent
    Princeton Univ, NJ 08544 USA.
    Secure and Private Distributed Source Coding With Private Keys and Decoder Side Information2023In: IEEE Transactions on Information Forensics and Security, ISSN 1556-6013, E-ISSN 1556-6021, Vol. 18, p. 3803-3816Article in journal (Refereed)
    Abstract [en]

    The distributed source coding problem is extended by positing that noisy measurements of a remote source are the correlated random variables that should be reconstructed at another terminal. We consider a secure and private distributed lossy source coding problem with two encoders and one decoder such that (i) all terminals noncausally observe a noisy measurement of the remote source; (ii) a private key is available to each legitimate encoder and all private keys are available to the decoder; (iii) rate-limited noiseless communication links are available between each encoder and the decoder; (iv) the amount of information leakage to an eavesdropper about the correlated random variables is defined as (v) secrecy leakage, and privacy leakage is measured with respect to the remote source; and (vi) two passive attack scenarios are considered, where a strong eavesdropper can access both communication links and a weak eavesdropper can choose only one of the links to access. Inner and outer bounds on the rate regions defined under secrecy, privacy, communication, and distortion constraints are derived for both passive attack scenarios. When one or both sources should be reconstructed reliably, the rate region bounds are simplified.

    Download full text (pdf)
    fulltext
  • 5.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Bloch, Matthieu
    Georgia Inst Technol, GA USA.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany.
    Yener, Aylin
    Ohio State Univ, OH USA.
    Secure Integrated Sensing and Communication for Binary Input Additive White Gaussian Noise Channels2023In: 2023 IEEE 3RD INTERNATIONAL SYMPOSIUM ON JOINT COMMUNICATIONS & SENSING, JC&S, IEEE , 2023Conference paper (Refereed)
    Abstract [en]

    We study a secure integrated sensing and communication (ISAC) model motivated by the need to simultaneously exploit the sensitive attributes of wireless devices, such as their location, and communicate securely. Specifically, we consider a state-dependent binary-input two-user additive white Gaussian noise (AWGN) broadcast channel, in which the channel state sequence consists of two components, each affecting a receiver, modeled as independent and identically distributed (i.i.d.) correlated phase shifts to approximate the location-dependent signatures of the receivers. The objective of the transmitter is to simultaneously estimate the channel states while reliably transmitting a secret message to one of the receivers, treating the other as a passive attacker. We characterize the exact secrecy-distortion region when 1) the channel output feedback is perfect, i.e., noiseless with a unit time delay; and 2) the channel is degraded. The characterized rate region offers an outer bound for more complex secure ISAC settings with noisy generalized output feedback and non-degraded channels. We also characterize the secrecy-distortion region for reversely-degraded channels. The results illustrate the benefits of jointly sensing the channel state and securely communicating messages as compared to separation-based methods.

  • 6.
    Kim, Muah
    et al.
    Tech Univ Dresden, Germany.
    Günlü, Onur
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany.
    Effects of Quantization on Federated Learning with Local Differential Privacy2022In: 2022 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM 2022), IEEE , 2022, p. 921-926Conference paper (Refereed)
    Abstract [en]

    Federated learning (FL) enables large-scale machine learning with user data privacy due to its decentralized structure. However, the user data can still be inferred via the shared model updates. To strengthen the privacy, we consider FL with local differential privacy (LDP). One of the challenges in FL is its huge communication cost caused by iterative transmissions of model updates. It has been relieved by quantization in the literature, however, there have been not many works that consider its effect on LDP and the unboundedness of the randomized model updates. We propose a communication-efficient FL algorithm with LDP that uses a Gaussian mechanism followed by quantization and the Elias-gamma coding. A novel design of the algorithm guarantees LDP even after the quantization. Under the proposed algorithm, we provide a trade-off analysis of privacy and communication costs theoretically: quantization reduces the communication costs but requires a larger perturbation to enable LDP. Experimental results show that the accuracy is mostly affected by the noise from LDP mechanisms, and it becomes enhanced when the quantization error is larger. Nonetheless, our experimental results enabled LDP with a significant compression ratio and only a slight reduction of accuracy in return. Furthermore, the proposed algorithm outperforms another algorithm with a discrete Gaussian mechanism under the same privacy budget and communication costs constraints in the experiments.

  • 7.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering.
    Schaefer, Rafael F.
    Tech Univ Dresden, Germany; Tech Univ Dresden, Germany.
    Boche, Holger
    Tech Univ Munich, Germany; Ruhr Univ Bochum, Germany; Tech Univ Munich, Germany; Munich Ctr Quantum Sci & Technol MCQST, Germany.
    Poor, Harold Vincent
    Princeton Univ, NJ 08544 USA.
    Private Key and Decoder Side Information for Secure and Private Source Coding2022In: Entropy, E-ISSN 1099-4300, Vol. 24, no 12, article id 1716Article in journal (Refereed)
    Abstract [en]

    We extend the problem of secure source coding by considering a remote source whose noisy measurements are correlated random variables used for secure source reconstruction. The main additions to the problem are as follows: (1) all terminals noncausally observe a noisy measurement of the remote source; (2) a private key is available to all legitimate terminals; (3) the public communication link between the encoder and decoder is rate-limited; and (4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source. Exact rate regions are characterized for a lossy source coding problem with a private key, remote source, and decoder side information under security, privacy, communication, and distortion constraints. By replacing the distortion constraint with a reliability constraint, we obtain the exact rate region for the lossless case as well. Furthermore, the lossy rate region for scalar discrete-time Gaussian sources and measurement channels is established. An achievable lossy rate region that can be numerically computed is also provided for binary-input multiple additive discrete-time Gaussian noise measurement channels.

    Download full text (pdf)
    fulltext
  • 8.
    Günlü, Onur
    et al.
    Linköping University, Department of Electrical Engineering, Information Coding. Linköping University, Faculty of Science & Engineering. Univ Siegen, Germany.
    Schaefer, Rafael F.
    Univ Siegen, Germany.
    Boche, Holger
    Tech Univ Munich, Germany; Ruhr Univ Bochum, Germany; Tech Univ Munich, Germany.
    Poor, H. Vincent
    Princeton Univ, NJ 08544 USA.
    Secure and Private Source Coding with Private Key and Decoder Side Information2022In: 2022 IEEE INFORMATION THEORY WORKSHOP (ITW), IEEE , 2022, p. 226-231Conference paper (Refereed)
    Abstract [en]

    The problem of secure source coding with multiple terminals is extended by considering a remote source whose noisy measurements are the correlated random variables used for secure source reconstruction. The main additions to the problem include 1) all terminals noncausally observe a noisy measurement of the remote source; 2) a private key is available to all legitimate terminals; 3) the public communication link between the encoder and decoder is rate-limited; and 4) the secrecy leakage to the eavesdropper is measured with respect to the encoder input, whereas the privacy leakage is measured with respect to the remote source. Exact rate regions are characterized for a lossy source coding problem with a private key, remote source, and decoder side information under security, privacy, communication, and distortion constraints. By replacing the distortion constraint with a reliability constraint, we obtain the exact rate region also for the lossless case. Furthermore, the lossy rate region for scalar discrete-time Gaussian sources and measurement channels is established.

1 - 8 of 8
CiteExportLink to result list
Permanent link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • oxford
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf