Person

Rüdiger Urbanke

Related publications (85)

Federated One-Shot Learning with Data Privacy and Objective-Hiding

Privacy in federated learning is crucial, encompassing two key aspects: safeguarding the privacy of clients' data and maintaining the privacy of the federator's objective from the clients. While the first aspect has been extensively studied, the second has ...

Institute of Electrical and Electronics Engineers (IEEE)2025

On the Efficiency of Polar-Like Decoding for Symmetric Codes

Rüdiger Urbanke, Kirill Ivanov

The recently introduced polar codes constitute a breakthrough in coding theory due to their capacity-achieving property. This goes hand in hand with a quasilinear construction, encoding, and successive cancellation list decoding procedures based on the Plo ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2022

Polar Codes Do Not Have Many Affine Automorphisms

Rüdiger Urbanke, Kirill Ivanov

Polar coding solutions demonstrate excellent performance under the list decoding that is challenging to implement in hardware due to the path sorting operations. As a potential solution to this problem, permutation decoding recently became a hot research t ...

IEEE2022

Experimental quantum key distribution certified by Bell's theorem

Rüdiger Urbanke, Kirill Ivanov

Cryptographic key exchange protocols traditionally rely on computational conjectures such as the hardness of prime factorization(1) to provide security against eavesdropping attacks. Remarkably, quantum key distribution protocols such as the Bennett-Brassa ...

NATURE PORTFOLIO2022

Query Complexity of Adversarial Attacks

Rüdiger Urbanke, Grzegorz Adam Gluch

There are two main attack models considered in the adversarial robustness literature: black-box and white-box. We consider these threat models as two ends of a fine-grained spectrum, indexed by the number of queries the adversary can ask. Using this point ...

JMLR-JOURNAL MACHINE LEARNING RESEARCH2021

The Stability of Low-Density Parity-Check Codes and Some of its Consequences

Rüdiger Urbanke, Wei Liu

We study the stability of low-density parity-check codes under blockwise or bitwise maximum a posteriori decoding, where transmission takes place over a binary-input memoryless output-symmetric channel. Our study stems from the consideration of constructin ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2021

On the Universality of Low-Density Parity-Check Block Codes

Rüdiger Urbanke, Wei Liu

An important class of modern channel codes is the capacity-achieving sequences of low-density parity-check block codes. Such sequences are usually designed for the binary erasure channel and are decoded by iterative message-passing algorithms. In this pape ...

IEEE2020

On the dependency between the code symmetries and the decoding efficiency

Rüdiger Urbanke, Kirill Ivanov

A framework of monomial codes is considered, which includes linear codes generated by the evaluation of certain monomials. Polar and Reed-Muller codes are the two best-known representatives of such codes and can be considered as two extreme cases. Reed-Mul ...

IEEE2020

Constructing a provably adversarially-robust classifier from a high accuracy one

Rüdiger Urbanke, Grzegorz Adam Gluch

Modern machine learning models with very high accuracy have been shown to be vulnerable to small, adversarially chosen perturbations of the input. Given black-box access to a high-accuracy classifier f, we show how to construct a new classifier g that has ...

ADDISON-WESLEY PUBL CO2020

Construction of Polar Codes With Sublinear Complexity

Rüdiger Urbanke, Seyed Hamed Hassani, Marco Mondelli

Consider the problem of constructing a polar code of block length N for a given transmission channel W. Previous approaches require one to compute the reliability of the N synthetic channels and then use only those that are sufficiently reliable. However, ...

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC2019