Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJoão Ribeiro 0002
Person information
- affiliation (since 2023): New University of Lisbon, School of Science and Technology, Portugal
- affiliation (2021-2023): Carnegie Mellon University, Computer Science Department, Pittsburgh, PA, USA
- affiliation (2017-2021, PhD 2021): Imperial College London, UK
- affiliation (2015-2017): ETH Zurich, Switzerland
Other persons with the same name
- João Ribeiro — disambiguation page
- João Ribeiro 0001 — University of Porto, Department of Informatics Engineering, Portugal
- João Ribeiro 0003 (aka: João V. Ribeiro 0003) — University of Illinois at Urbana-Champaign, Beckman Institute for Advanced Science and Technology, IL, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i34]Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro:
Low-Degree Polynomials Are Good Extractors. CoRR abs/2405.10297 (2024)- [i33]Omar Alrabiah, Jesse Goodman, Jonathan Mosheiff, João Ribeiro:
Low-Degree Polynomials Are Good Extractors. Electron. Colloquium Comput. Complex. TR24: TR24-093 (2024) - 2023
- [j11]Mahdi Cheraghchi
, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. SIAM J. Discret. Math. 37(2): 612-631 (2023) - [j10]Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. IEEE Trans. Inf. Theory 69(1): 169-186 (2023) - [c19]Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, João Ribeiro:
Asynchronous Multi-Party Quantum Computation. ITCS 2023: 62:1-62:22 - [c18]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over All Fields and the Shortest Vector Problem in All ℓp Norms. STOC 2023: 553-566 - [c17]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. TQC 2023: 4:1-4:26 - [i32]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. CoRR abs/2305.00356 (2023) - [i31]Anantham Nambiar, Chao Pan, Vishal Rana, Mahdi Cheraghchi, João Ribeiro, Sergei Maslov, Olgica Milenkovic:
Semi-Quantitative Group Testing for Efficient and Accurate qPCR Screening of Pathogens with a Wide Range of Loads. CoRR abs/2307.16352 (2023) - [i30]Naresh Goud Boddu, Vipul Goyal, Rahul Jain, João Ribeiro:
Split-State Non-Malleable Codes and Secret Sharing Schemes for Quantum Messages. CoRR abs/2308.06466 (2023) - [i29]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Unbounded Leakage-Resilience and Leakage-Detection in a Quantum World. IACR Cryptol. ePrint Arch. 2023: 410 (2023) - [i28]Alper Çakan, Vipul Goyal, Chen-Da Liu-Zhang, João Ribeiro:
Computational Quantum Secret Sharing. IACR Cryptol. ePrint Arch. 2023: 613 (2023) - 2022
- [j9]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction Over Oblivious Synchronization Channels. IEEE Trans. Inf. Theory 68(7): 4272-4281 (2022) - [j8]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Privacy Amplification With Tamperable Memory via Non-Malleable Two-Source Extractors. IEEE Trans. Inf. Theory 68(8): 5475-5495 (2022) - [j7]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IEEE Trans. Inf. Theory 68(12): 8197-8227 (2022) - [j6]Gianluca Brian, Antonio Faonio, João Ribeiro, Daniele Venturi:
Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited. IACR Trans. Symmetric Cryptol. 2022(3): 1-19 (2022) - [c16]Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. APPROX/RANDOM 2022: 8:1-8:17 - [c15]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. CRYPTO (1) 2022: 127-147 - [c14]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract From Local Sources. ICALP 2022: 10:1-10:20 - [c13]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. TCC (1) 2022: 327-354 - [i27]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. CoRR abs/2205.13725 (2022) - [i26]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all 𝓁p Norms. CoRR abs/2211.07900 (2022) - [i25]Omar Alrabiah, Eshan Chattopadhyay, Jesse Goodman, Xin Li, João Ribeiro:
Low-Degree Polynomials Extract from Local Sources. Electron. Colloquium Comput. Complex. TR22 (2022) - [i24]Huck Bennett, Mahdi Cheraghchi, Venkatesan Guruswami, João Ribeiro:
Parameterized Inapproximability of the Minimum Distance Problem over all Fields and the Shortest Vector Problem in all ℓp Norms. Electron. Colloquium Comput. Complex. TR22 (2022) - [i23]Jesper Buus Nielsen, João Ribeiro, Maciej Obremski:
Public Randomness Extraction with Ephemeral Roles and Worst-Case Corruptions. IACR Cryptol. ePrint Arch. 2022: 237 (2022) - [i22]Gianluca Brian, Antonio Faonio, João Ribeiro, Daniele Venturi:
Short Non-Malleable Codes from Related-Key Secure Block Ciphers, Revisited. IACR Cryptol. ePrint Arch. 2022: 1100 (2022) - [i21]Vipul Goyal, Chen-Da Liu-Zhang, Justin Raizes, João Ribeiro:
Asynchronous Multi-Party Quantum Computation. IACR Cryptol. ePrint Arch. 2022: 1583 (2022) - 2021
- [j5]Mahdi Cheraghchi, João Ribeiro:
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel With Positive Dark Current. IEEE Commun. Lett. 25(12): 3829-3832 (2021) - [j4]Mahdi Cheraghchi, João Ribeiro:
An Overview of Capacity Results for Synchronization Channels. IEEE Trans. Inf. Theory 67(6): 3207-3232 (2021) - [c12]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. EUROCRYPT (2) 2021: 408-437 - [c11]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. ISIT 2021: 2459-2464 - [i20]Mahdi Cheraghchi, Joseph Downs, João Ribeiro, Alexandra Veliche:
Mean-Based Trace Reconstruction over Practically any Replication-Insertion Channel. CoRR abs/2102.09490 (2021) - [i19]Onur Günlü, Ueli Maurer, João Ribeiro:
Effects of Quantization on the Multiple-Round Secret-Key Capacity. CoRR abs/2105.01350 (2021) - [i18]Ryan Gabrys, Venkatesan Guruswami, João Ribeiro, Ke Wu:
Beyond Single-Deletion Correcting Codes: Substitutions and Transpositions. CoRR abs/2112.09971 (2021) - [i17]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. Electron. Colloquium Comput. Complex. TR21 (2021) - [i16]Onur Günlü, Ueli Maurer, João Ribeiro:
Effects of Quantization on the Multiple-Round Secret-Key Capacity. IACR Cryptol. ePrint Arch. 2021: 584 (2021) - [i15]Divesh Aggarwal, Eldon Chung, Maciej Obremski, João Ribeiro:
On Secret Sharing, Randomness, and Random-less Reductions for Secret Sharing. IACR Cryptol. ePrint Arch. 2021: 802 (2021) - 2020
- [j3]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded Trace Reconstruction. IEEE Trans. Inf. Theory 66(10): 6084-6103 (2020) - [c10]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. APPROX-RANDOM 2020: 1:1-1:20 - [c9]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. EUROCRYPT (1) 2020: 343-372 - [c8]Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro:
Group Testing with Runlength Constraints for Topological Molecular Storage. ISIT 2020: 132-137 - [i14]Abhishek Agarwal, Olgica Milenkovic, Srilakshmi Pattabiraman, João Ribeiro:
Group Testing with Runlength Constraints for Topological Molecular Storage. CoRR abs/2001.04577 (2020) - [i13]Mahdi Cheraghchi, João Ribeiro:
Non-Asymptotic Capacity Upper Bounds for the Discrete-Time Poisson Channel with Positive Dark Current. CoRR abs/2010.14858 (2020) - [i12]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Computational and Information-Theoretic Two-Source (Non-Malleable) Extractors. IACR Cryptol. ePrint Arch. 2020: 259 (2020) - [i11]Gianluca Brian, Antonio Faonio, Maciej Obremski, João Ribeiro, Mark Simkin, Maciej Skórski, Daniele Venturi:
The Mother of All Leakages: How to Simulate Noisy Leakages via Bounded Leakage (Almost) for Free. IACR Cryptol. ePrint Arch. 2020: 1246 (2020) - [i10]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Mark Simkin, Luisa Siniscalchi:
Two-Source Non-Malleable Extractors and Applications to Privacy Amplification with Tamperable Memory. IACR Cryptol. ePrint Arch. 2020: 1371 (2020)
2010 – 2019
- 2019
- [j2]Mahdi Cheraghchi, João Ribeiro:
Improved Upper Bounds and Structural Results on the Capacity of the Discrete-Time Poisson Channel. IEEE Trans. Inf. Theory 65(7): 4052-4068 (2019) - [j1]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. IEEE Trans. Inf. Theory 65(11): 6950-6974 (2019) - [c7]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret Sharing Schemes for General Access Structures. CRYPTO (2) 2019: 510-539 - [c6]Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. ISIT 2019: 156-160 - [c5]Mahdi Cheraghchi, João Ribeiro, Ryan Gabrys, Olgica Milenkovic:
Coded Trace Reconstruction. ITW 2019: 1-5 - [i9]Mahdi Cheraghchi, João Ribeiro:
Simple Codes and Sparse Recovery with Fast Decoding. CoRR abs/1901.02852 (2019) - [i8]Mahdi Cheraghchi, Ryan Gabrys, Olgica Milenkovic, João Ribeiro:
Coded trace reconstruction. CoRR abs/1903.09992 (2019) - [i7]Mahdi Cheraghchi, João Ribeiro:
An Overview of Capacity Results for Synchronization Channels. CoRR abs/1910.07199 (2019) - [i6]Divesh Aggarwal, Siyao Guo, Maciej Obremski, João Ribeiro, Noah Stephens-Davidowitz:
Extractor Lower Bounds, Revisited. Electron. Colloquium Comput. Complex. TR19 (2019) - [i5]Divesh Aggarwal, Maciej Obremski, João Ribeiro, Luisa Siniscalchi, Ivan Visconti:
How to Extract Useful Randomness from Unreliable Sources. IACR Cryptol. ePrint Arch. 2019: 1156 (2019) - 2018
- [c4]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. Allerton 2018: 1104-1111 - [c3]Mahdi Cheraghchi, João Ribeiro:
Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel. ISIT 2018: 1769-1773 - [c2]Daniel Jost, Ueli Maurer, João L. Ribeiro:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. TCC (1) 2018: 345-369 - [i4]Mahdi Cheraghchi, João Ribeiro:
Improved Capacity Upper Bounds for the Discrete-Time Poisson Channel. CoRR abs/1801.02745 (2018) - [i3]Mahdi Cheraghchi, João Ribeiro:
Sharp Analytical Capacity Upper Bounds for Sticky and Related Channels. CoRR abs/1806.06218 (2018) - [i2]Divesh Aggarwal, Ivan Damgård, Jesper Buus Nielsen, Maciej Obremski, Erick Purwanto, João Ribeiro, Mark Simkin:
Stronger Leakage-Resilient and Non-Malleable Secret-Sharing Schemes for General Access Structures. IACR Cryptol. ePrint Arch. 2018: 1147 (2018) - 2017
- [i1]Daniel Jost, Ueli Maurer, João L. Ribeiro:
Information-Theoretic Secret-Key Agreement: The Asymptotically Tight Relation Between the Secret-Key Rate and the Channel Quality Ratio. IACR Cryptol. ePrint Arch. 2017: 1130 (2017) - 2016
- [c1]Ueli Maurer, João Ribeiro:
New perspectives on weak Oblivious Transfer. ISIT 2016: 790-794
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-13 23:34 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
