default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDOmri Shmueli
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[i14]Omri Shmueli:
Quantum Algorithms in a Superposition of Spacetimes. CoRR abs/2403.02937 (2024)- [i13]Omri Shmueli:
Quantum Algorithms in a Superposition of Spacetimes. Electron. Colloquium Comput. Complex. TR24 (2024) - [i12]Omri Shmueli:
A Note on Quantum Algorithms for Lattice Problems. IACR Cryptol. ePrint Arch. 2024: 583 (2024) - 2023
- [c9]Amit Behera
, Zvika Brakerski, Or Sattath, Omri Shmueli:
Pseudorandomness with Proof of Destruction and Applications. TCC (4) 2023: 125-154 - [i11]Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli:
Pseudorandomness with Proof of Destruction and Applications. IACR Cryptol. ePrint Arch. 2023: 543 (2023) - 2022
- [c8]Omri Shmueli:
Semi-quantum Tokenized Signatures. CRYPTO (1) 2022: 296-319 - [c7]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments Against Quantum Attacks. EUROCRYPT (3) 2022: 519-550 - [c6]Omri Shmueli:
Public-key Quantum money with a classical bank. STOC 2022: 790-803 - [i10]Omri Shmueli:
Semi-Quantum Tokenized Signatures. IACR Cryptol. ePrint Arch. 2022: 228 (2022) - 2021
- [c5]Omri Shmueli:
Multi-theorem Designated-Verifier NIZK for QMA. CRYPTO (1) 2021: 375-405 - [c4]Nir Bitansky, Michael Kellner, Omri Shmueli:
Post-quantum Resettably-Sound Zero Knowledge. TCC (1) 2021: 62-89 - [i9]Nir Bitansky, Michael Kellner, Omri Shmueli:
Post-quantum Resettably-Sound Zero Knowledge. IACR Cryptol. ePrint Arch. 2021: 349 (2021) - [i8]Nir Bitansky, Huijia Lin, Omri Shmueli:
Non-malleable Commitments against Quantum Attacks. IACR Cryptol. ePrint Arch. 2021: 920 (2021) - [i7]Omri Shmueli:
Public-Key Quantum Money with a Classical Bank. IACR Cryptol. ePrint Arch. 2021: 1427 (2021) - 2020
- [c3]Zvika Brakerski, Omri Shmueli:
Scalable Pseudorandom Quantum States. CRYPTO (2) 2020: 417-440 - [c2]Nir Bitansky, Omri Shmueli:
Post-quantum zero knowledge in constant rounds. STOC 2020: 269-279 - [i6]Zvika Brakerski, Omri Shmueli:
Scalable Pseudorandom Quantum States. CoRR abs/2004.01976 (2020) - [i5]Omri Shmueli:
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA. CoRR abs/2007.12923 (2020) - [i4]Omri Shmueli:
Multi-theorem (Malicious) Designated-Verifier NIZK for QMA. IACR Cryptol. ePrint Arch. 2020: 928 (2020)
2010 – 2019
- 2019
- [c1]Zvika Brakerski, Omri Shmueli:
(Pseudo) Random Quantum States with Binary Phase. TCC (1) 2019: 229-250 - [i3]Zvika Brakerski, Omri Shmueli:
(Pseudo) Random Quantum States with Binary Phase. CoRR abs/1906.10611 (2019) - [i2]Nir Bitansky, Omri Shmueli:
Post-Quantum Zero Knowledge in Constant Rounds. CoRR abs/1912.04769 (2019) - [i1]Nir Bitansky, Omri Shmueli:
Post-Quantum Zero Knowledge in Constant Rounds. IACR Cryptol. ePrint Arch. 2019: 1279 (2019)
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 2025-01-21 00:22 CET 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:
