João Ribeiro

Orcid: 0000-0002-9870-0501

Affiliations:

New University of Lisbon, School of Science and Technology, Portugal (since 2023)
Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA (2021-2023)
Imperial College London, UK (2017-2021, PhD 2021)
ETH Zurich, Switzerland (2015-2017)

According to our database¹, João Ribeiro authored at least 32 papers between 2016 and 2023.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2023

Simple Codes and Sparse Recovery with Fast Decoding.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

SIAM J. Discret. Math., June, 2023

Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2023

Computational Quantum Secret Sharing.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Unbounded Leakage-Resilience and Leakage-Detection in a Quantum World.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2023

Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages.

[BibT_eX]

[DOI]

CoRR, 2023

Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads.

[BibT_eX]

[DOI]

CoRR, 2023

Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms.

[BibT_eX]

[DOI]

Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 2023

2022

Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2022

Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions.

[BibT_eX]

[DOI]

Jesper Buus Nielsen

João Ribeiro

Maciej Obremski

IACR Cryptol. ePrint Arch., 2022

Asynchronous Multi-Party Quantum Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2022

Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

Low-Degree Polynomials Extract from Local Sources.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2022

2021

An Overview of Capacity Results for Synchronization Channels.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

IEEE Trans. Inf. Theory, 2021

Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

IEEE Commun. Lett., 2021

Effects of Quantization on the Multiple-Round Secret-Key Capacity.

[BibT_eX]

[DOI]

Onur Günlü

Ueli Maurer

João Ribeiro

IACR Cryptol. ePrint Arch., 2021

On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel.

[BibT_eX]

[DOI]

Proceedings of the IEEE International Symposium on Information Theory, 2021

2020

Coded Trace Reconstruction.

[BibT_eX]

[DOI]

IEEE Trans. Inf. Theory, 2020

Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2020

Group Testing with Runlength Constraints for Topological Molecular Storage.

[BibT_eX]

[DOI]

Abhishek Agarwal

Olgica Milenkovic

Srilakshmi Pattabiraman

João Ribeiro

Proceedings of the IEEE International Symposium on Information Theory, 2020

2019

Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

IEEE Trans. Inf. Theory, 2019

Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

IEEE Trans. Inf. Theory, 2019

How to Extract Useful Randomness from Unreliable Sources.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2019

Extractor Lower Bounds, Revisited.

[BibT_eX]

[DOI]

Noah Stephens-Davidowitz

Electron. Colloquium Comput. Complex., 2019

2018

Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2018

Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel.

[BibT_eX]

[DOI]

Mahdi Cheraghchi

João Ribeiro

Proceedings of the 2018 IEEE International Symposium on Information Theory, 2018

2017

Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio.

[BibT_eX]

[DOI]

Daniel Jost

Ueli Maurer

João L. Ribeiro

IACR Cryptol. ePrint Arch., 2017

2016

New perspectives on weak Oblivious Transfer.

[BibT_eX]

[DOI]

Ueli Maurer

João Ribeiro

Proceedings of the IEEE International Symposium on Information Theory, 2016

João Ribeiro

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...