default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRotem Arnon Friedman
Person information
- affiliation: Weizmann Institute of Science, Rehovot, Israel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
2020 – today
- 2026
[j6]Noam Avidan
, Rotem Arnon Friedman:
Quantum Computational Unpredictability Entropy and Quantum Leakage Resilience. IEEE Trans. Inf. Theory 72(5): 3129-3155 (2026)- [c3]Noam Avidan, Thomas A. Hahn, Joseph M. Renes, Rotem Arnon Friedman:
Fully Quantum Computational Entropies (Extended Abstract). ITCS 2026: 13:1-13:3 - 2025
- [j5]Ilya Merkulov, Rotem Arnon Friedman:
Entropy Accumulation Under Post-Quantum Cryptographic Assumptions. Entropy 27(8): 772 (2025) - 2023
- [i7]Ilya Merkulov, Rotem Arnon Friedman:
Entropy Accumulation under Post-Quantum Cryptographic Assumptions. CoRR abs/2307.00559 (2023) - 2021
- [j4]Rotem Arnon Friedman, Felix Leditzky:
Upper Bounds on Device-Independent Quantum Key Distribution Rates and a Revised Peres Conjecture. IEEE Trans. Inf. Theory 67(10): 6606-6618 (2021) - 2020
- [j3]Max Kessler, Rotem Arnon Friedman:
Device-Independent Randomness Amplification and Privatization. IEEE J. Sel. Areas Inf. Theory 1(2): 568-584 (2020)
2010 – 2019
- 2019
- [j2]Rotem Arnon Friedman, Renato Renner, Thomas Vidick:
Simple and Tight Device-Independent Security Proofs. SIAM J. Comput. 48(1): 181-225 (2019) - 2018
- [c2]Rotem Arnon Friedman, Henry Yuen:
Noise-Tolerant Testing of High Entanglement of Formation. ICALP 2018: 11:1-11:12 - 2017
- [i6]Max Kessler, Rotem Arnon Friedman:
Device-independent Randomness Amplification and Privatization. CoRR abs/1705.04148 (2017) - 2016
- [j1]Rotem Arnon Friedman, Renato Renner, Thomas Vidick:
Non-Signaling Parallel Repetition Using de Finetti Reductions. IEEE Trans. Inf. Theory 62(3): 1440-1457 (2016) - [c1]Rotem Arnon Friedman, Christopher Portmann, Volkher B. Scholz:
Quantum-Proof Multi-Source Randomness Extractors in the Markov Model. TQC 2016: 2:1-2:34 - [i5]Rotem Arnon Friedman, Renato Renner, Thomas Vidick:
Simple and tight device-independent security proofs. CoRR abs/1607.01797 (2016) - 2015
- [i4]Rotem Arnon Friedman, Christopher Portmann, Volkher B. Scholz:
Quantum-proof multi-source randomness extractors in the Markov model. CoRR abs/1510.06743 (2015) - 2014
- [i3]Rotem Arnon Friedman, Renato Renner, Thomas Vidick:
Non-signalling parallel repetition using de Finetti reductions. CoRR abs/1411.1582 (2014) - 2012
- [i2]Rotem Arnon Friedman, Esther Hänggi, Amnon Ta-Shma:
Towards the Impossibility of Non-Signalling Privacy Amplification from Time-Like Ordering Constraints. CoRR abs/1205.3736 (2012) - [i1]Rotem Arnon Friedman, Amnon Ta-Shma:
On the limits of privacy amplification against non-signalling memory attacks. CoRR abs/1211.1125 (2012)
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 2026-06-27 06:46 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
