Omri Shmueli

dblp:243/6137 · DBLP profile ↗
← Back
12ranked-venue papers
4as first author
9since 2021 · last 2026
0009-0008-3625-5626ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 10 · 3 first-author · 8 since 2021Theory of computation · 5 · 1 first-author · 3 since 2021
YearPublicationVenuePosition
2026 Public-Key Quantum Fire and Key-Fire From Classical Oracles
Alper Çakan, Vipul Goyal, Omri Shmueli
CRYPTO (5)3
2026 Uncloneable Cryptography in Linear Quantum Memory
Andrew Huang 0002, Omri Shmueli, Vinod Vaikuntanathan, Mark Zhandry
CRYPTO (5)2
2025 On One-Shot Signatures, Quantum vs. Classical Binding, and Obfuscating Permutations
Omri Shmueli, Mark Zhandry
CRYPTO (2)1
2023 Pseudorandomness with Proof of Destruction and Applications
Amit Behera, Zvika Brakerski, Or Sattath, Omri Shmueli
TCC (4)4
2022 Semi-quantum Tokenized Signatures
Omri Shmueli
CRYPTO (1)1
2022 Non-malleable Commitments Against Quantum Attacks
Nir Bitansky, Huijia Lin, Omri Shmueli
EUROCRYPT (3)3
2022 Public-key Quantum money with a classical bank
abstract
Quantum money is a main primitive in quantum cryptography, that enables a bank to distribute to parties in the network, called wallets, unclonable quantum banknotes that serve as a medium of exchange between wallets. While quantum money suggests a theoretical solution to some of the fundamental problems in currency systems, it still requires a strong model to be implemented; quantum computation and a quantum communication infrastructure. A central open question in this context is whether we can have a quantum money scheme that uses "minimal quantumness", namely, local quantum computation and only classical communication.
Omri Shmueli
STOC1
2021 Multi-theorem Designated-Verifier NIZK for QMA
Omri Shmueli
CRYPTO (1)1
2021 Post-quantum Resettably-Sound Zero Knowledge
Nir Bitansky, Michael Kellner 0001, Omri Shmueli
TCC (1)3
2020 Scalable Pseudorandom Quantum States
Zvika Brakerski, Omri Shmueli
CRYPTO (2)2
2020 Post-quantum zero knowledge in constant rounds
abstract
We construct a constant-round zero-knowledge classical argument for NP secure against quantum attacks. We assume the existence of Quantum Fully-Homomorphic Encryption and other standard primitives, known based on the Learning with Errors Assumption for quantum algorithms. As a corollary, we also obtain a constant-round zero-knowledge quantum argument for QMA.
Nir Bitansky, Omri Shmueli
STOC2
2019 (Pseudo) Random Quantum States with Binary Phase
Zvika Brakerski, Omri Shmueli
TCC (1)2