Moritz Wiese

Orcid: 0000-0003-4561-9766

According to our database1, Moritz Wiese authored at least 54 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
ε-Almost collision-flat universal hash functions and mosaics of designs.
Des. Codes Cryptogr., April, 2024

Message Transmission and Common Randomness Generation Over MIMO Slow Fading Channels With Arbitrary Channel State Distribution.
IEEE Trans. Inf. Theory, January, 2024

Common Randomness Generation from Finite Compound Sources.
CoRR, 2024

2023
Identification Over Additive Noise Channels in the Presence of Feedback.
IEEE Trans. Inf. Theory, November, 2023

A Proof of a Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.
IEEE Trans. Inf. Theory, November, 2023

Arbitrarily Varying Wiretap Channels With Non-Causal Side Information at the Jammer.
IEEE Trans. Inf. Theory, April, 2023

Information-Theoretically Secret Reed-Muller Identification with Affine Designs.
CoRR, 2023

Statistical verification of upper and lower bounds for the security performance of wiretap channels.
Proceedings of the IEEE Wireless Communications and Networking Conference, 2023

ε-Almost Collision-Flat Universal Hash Functions Motivated by Information-Theoretic Security.
Proceedings of the IEEE International Symposium on Information Theory, 2023

A Lower and Upper Bound on the Epsilon-Uniform Common Randomness Capacity.
Proceedings of the IEEE International Symposium on Information Theory, 2023

Common Randomness Generation from Sources with Countable Alphabet.
Proceedings of the IEEE International Conference on Communications, 2023

Improving Upper and Lower Bounds for the Security Performance of Wiretap Channels.
Proceedings of the IEEE Global Communications Conference, 2023

Semantic Secrecy Assessment of Physical Layer Security in 5G NR Uplink Transmissions Under Fading Channel Conditions.
Proceedings of the IEEE Global Communications Conference, 2023

2022
Mosaics of combinatorial designs for information-theoretic security.
Des. Codes Cryptogr., 2022

A Single-Letter Capacity Formula for MIMO Gauss-Markov Rayleigh Fading Channels.
CoRR, 2022

A General Formula for Uniform Common Randomness Capacity.
Proceedings of the IEEE Information Theory Workshop, 2022

A Rigorous Proof of the Capacity of MIMO Gauss-Markov Rayleigh Fading Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Mosaics of Combinatorial Designs for Semantic Security on Quantum Wiretap Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2022

Implementation of a Modular Coding Scheme for Secure Communication.
Proceedings of the IEEE International Conference on Communications, 2022

Implementation of Physical Layer Security into 5G NR Systems and E2E Latency Assessment.
Proceedings of the IEEE Global Communications Conference, 2022

2021
Semantic Security via Seeded Modular Coding Schemes and Ramanujan Graphs.
IEEE Trans. Inf. Theory, 2021

Outage Common Randomness Capacity Characterization of Multiple-Antenna Slow Fading Channels.
Proceedings of the IEEE Information Theory Workshop, 2021

Mosaics of combinatorial designs for privacy amplification.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Identification over the Gaussian Channel in the Presence of Feedback.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Common Randomness Generation over Slow Fading Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2021

Experimental Evaluation of a Modular Coding Scheme for Physical Layer Security.
Proceedings of the IEEE Global Communications Conference, 2021

2020
Semantic Security for Quantum Wiretap Channels.
Proceedings of the IEEE International Symposium on Information Theory, 2020

Arbitrarily Varying Wiretap Channels with and without Non-Causal Side Information at the Jammer.
Proceedings of the 8th IEEE Conference on Communications and Network Security, 2020

2019
Secure Estimation and Zero-Error Secrecy Capacity.
IEEE Trans. Autom. Control., 2019

Secret Key Generation from a Two Component Compound Source with Rate Constrained One Way Communication: Perfect Secrecy.
Proceedings of the IEEE International Workshop on Information Forensics and Security, 2019

A Graph-Based Modular Coding Scheme Which Achieves Semantic Security.
Proceedings of the IEEE International Symposium on Information Theory, 2019

2018
Semantic Security and the Second-Largest Eigenvalue of Biregular Graphs.
CoRR, 2018

2016
A Channel Under Simultaneous Jamming and Eavesdropping Attack - Correlated Random Coding Capacities Under Strong Secrecy Criteria.
IEEE Trans. Inf. Theory, 2016

The Arbitrarily Varying Wiretap Channel - Secret Randomness, Stability, and Super-Activation.
IEEE Trans. Inf. Theory, 2016

Uncertain wiretap channels and secure estimation.
Proceedings of the IEEE International Symposium on Information Theory, 2016

Secure distributed estimation of linear systems.
Proceedings of the 2016 IEEE Conference on Communications and Network Security, 2016

Secure estimation for unstable systems.
Proceedings of the 55th IEEE Conference on Decision and Control, 2016

Successive refinement with cribbing and side information.
Proceedings of the 54th Annual Allerton Conference on Communication, 2016

2015
Frequency hopping does not increase anti-jamming resilience of wireless channels.
CoRR, 2015

The arbitrarily varying wiretap channel - communication under uncoordinated attacks.
Proceedings of the IEEE International Symposium on Information Theory, 2015

Wiretap-channels under constrained active and passive attacks.
Proceedings of the 2015 IEEE Conference on Communications and Network Security, 2015

2014
On the weakest resource for coordination in arbitrarily varying multiple access channels with conferencing encoders.
Probl. Inf. Transm., 2014

The Arbitrarily Varying Wiretap Channel - deterministic and correlated random coding capacities under the strong secrecy criterion.
CoRR, 2014

2013
The Arbitrarily Varying Multiple-Access Channel With Conferencing Encoders.
IEEE Trans. Inf. Theory, 2013

Strong Secrecy in Bidirectional Broadcast Channels With Confidential Messages.
IEEE Trans. Inf. Forensics Secur., 2013

On the weakest resource for coordination in AV-MACs with conferencing encoders.
Proceedings of the 2013 IEEE Information Theory Workshop, 2013

Strong Secrecy for Multiple Access Channels.
Proceedings of the Information Theory, Combinatorics, and Search Theory, 2013

2012
Expected Supremum of a Random Linear Combination of Shifted Kernels
CoRR, 2012

An achievable region for the Wiretap multiple-access channel with common message.
Proceedings of the 2012 IEEE International Symposium on Information Theory, 2012

2011
The Compound Multiple Access Channel With Partially Cooperating Encoders.
IEEE Trans. Inf. Theory, 2011

Strong secrecy in bidirectional relay networks.
Proceedings of the Conference Record of the Forty Fifth Asilomar Conference on Signals, 2011

2010
The performance of QPSK in low-SNR interference channels.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

The compound MAC with common message and partial channel state information.
Proceedings of the International Symposium on Information Theory and its Applications, 2010

2008
Optimal power allocation policies for the reliable transmission of a single packet via ARQ protocols.
Proceedings of the 42nd Asilomar Conference on Signals, Systems and Computers, 2008


  Loading...