Holger Boche

Holger Boche

Institution: TU München / CASA

Research Hub(s):

Hub A: Future Cryptography
Hub B: Embedded Security



Arbitrarily Varying Wiretap Channels with and without Non-Causal Side Information at the Jammer Quantum Channel State Masking Quantum Channel State Masking On 6G and trustworthiness Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels 6G and the Post-Shannon Theory Implementation of a Modular Coding Scheme for Secure Communication The Quantum MAC with Cribbing Encoders Arbitrarily Varying Wiretap Channels with Non-Causal Side Information at the Jammer Secure Storage Capacity under Rate Constraints — Continuity and Super Activation Turing Meets Circuit Theory: Not Every Continuous-Time LTI System Can Be Simulated on a Digital Computer Turing Meets Shannon: Computable Sampling Type Reconstruction With Error Control Secure Communication and Identification Systems – Effective Performance Evaluation on Turing Machines Shannon meets Turing: Non-computability and non-approximability of the finite state channel capacity Identification over the Gaussian Channel in the Presence of Feedback Communication with Unreliable Entanglement Assistance Private Key and Decoder Side Information for Secure and Private Source Coding A General Formula for Uniform Common Randomness Capacity Secure and Private Source Coding with Private Key and Decoder Side Information Information Theoretic Methods for Future Communication Systems Implementation and Experimental Evaluation of Reed-Solomon Identification Arbitrarily Varying Wiretap Channels With Non-Causal Side Information at the Jammer Comparative Study of Quantum and Classical Error Correction for Future Quantum-6G Networks Statistical verification of upper and lower bounds for the security performance of wiretap channels Semantic Security for Quantum Wiretap Channels Common Randomness Generation from Gaussian Sources Computability of the Channel Reliability Function and Related Bounds Capacity of Finite State Channels with Feedback: Algorithmic and Optimization Theoretic Properties Deciding the Problem of Remote State Estimation via Noisy Communication Channels on Real Number Signal Processing Hardware Trustworthiness Verification and Integrity Testing for Wireless Communication Systems On the Arithmetic Complexity of the Bandwidth of Bandlimited Signals Computing Upper and Lower Bounds for the Bandwidth of Bandlimited Signals A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels The Quantum Multiple-Access Channel with Cribbing Encoders 6G: The Personal Tactile Internet - And Open Questions for Information Theory Coordinated Online Learning for Multi-Agent Systems with Coupled Constraints and Perturbed Utility Observations Identification over Additive Noise Channels in the Presence of Feedback Turing Meets Shannon: On the Algorithmic Construction of Channel-Aware Codes On non-detectability of non-computability and the degree of non-computability of solutions of circuit and wave equations on digital computers Algorithmic Computability and Approximability of Capacity-Achieving Input Distributions Mosaics of combinatorial designs for information-theoretic security Complexity Blowup if Continuous-Time LTI Systems are Implemented on Digital Hardware 6G-life: Digital Transformation and Sovereignty of Future Communication Networks Classical state masking over a quantum channel A Novel Architecture for Future Classical-Quantum Communication Networks On 6G and trustworthiness Quantum Communication Networks Denial-of-Service Attacks on Communication Systems: Detectability and Jammer Knowledge Identification Capacity of Channels with Feedback: Discontinuity Behavior, Super-Activation, and Turing Computability Communication under Channel Uncertainty: An Algorithmic Perspective and Effective Construction Semantic Security for Quantum Wiretap Channels Quantum Broadcast Channels with Cooperating Decoders: An Information-Theoretic Perspective on Quantum Repeaters Post-Shannon Quantum Communication and (Unexpected) Links between Computing and Information Processing Real Number Signal Processing can detect Denial-of-Service Attacks Mosaics of combinatorial designs for privacy amplification Common Randomness Generation over Slow Fading Channels On the Algorithmic Solvability of Channel Dependent Classification Problems in Communication Systems Algorithmic Computability of the Signal Bandwidth On the Solvability of the Peak Value Problem for Bandlimited Signals With Applications Computable Time Concentration of Bandlimited Signals and Systems Complexity Blowup in Simulating Analog Linear Time-Invariant Systems on Digital Computers Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs Quantum Channel State Masking Detectability of Denial-of-Service Attacks on Arbitrarily Varying Classical-Quantum Channels Turing Meets Shannon: Algorithmic Constructability of Capacity-Achieving Codes Algorithmic Detection of Adversarial Attacks on Message Transmission and ACK/NACK Feedback Communication over Block Fading Channels – An Algorithmic Perspective on Optimal Transmission Schemes