45 citations · 280 across the 30 of their papers we have counts for
26 papers · 1 filter
Conversable Quantum Fire in the Standard Model
Ofer Casper, Barak Nehoran, Or Sattath
Quantum fire consists of quantum states that can be efficiently functionally cloned but cannot be transmitted using one-way classical communication. Whereas all previous quantum-fi…
Decentralized Consensus from Quantum Proof of Position
Dar Gilboa, Siddhartha Jain, Or Sattath
We construct an energy efficient consensus protocol with geospatial position as an external resource by using quantum computers. Economic resources of some form are essential in de…
The power of a single Haar random state: constructing and separating quantum pseudorandomness
Boyang Chen, Andrea Coladangelo, Or Sattath
In this work, we focus on the following question: what are the cryptographic implications of having access to an oracle that provides a single Haar random quantum state? We find th…
51% Attack via Difficulty Increase with a Small Quantum Miner
Bolton Bailey, Or Sattath
We present a strategy for a single quantum miner with relatively low hashing power, with the same ramifications as a 51% attack. Bitcoin nodes consider the chain with the highest c…
Public-Key Encryption with Quantum Keys
Khashayar Barooti, Alex B. Grilo, Loïs Huguenin-Dumittan +4
In the framework of Impagliazzo's five worlds, a distinction is often made between two worlds, one where public-key encryption exists (Cryptomania), and one in which only one-way f…
Quantum Amnesia Leaves Cryptographic Mementos: A Note On Quantum Skepticism
Or Sattath, Uriel Shinar
Leonard Shelby, the protagonist of Memento, uses mementos in the form of tattoos and pictures to handle his amnesia. Similar to Leonard, contemporary quantum computers suffer from…
Uncloneable Cryptography
Or Sattath
The no-cloning theorem asserts that, unlike classical information, quantum information cannot be copied. This seemingly undesirable phenomenon is harnessed in quantum cryptography.…
Quantum Prudent Contracts with Applications to Bitcoin
Or Sattath
Smart contracts are cryptographic protocols that are enforced without a judiciary. Smart contracts are used occasionally in Bitcoin and are prevalent in Ethereum. Public quantum mo…
Uncloneable Decryptors from Quantum Copy-Protection
Or Sattath, Shai Wyborski
Uncloneable decryptors are encryption schemes (with classical plaintexts and ciphertexts) with the added functionality of deriving uncloneable quantum states, called decryptors, wh…
Noise-Tolerant Quantum Tokens for MAC
Amit Behera, Or Sattath, Uriel Shinar
Message Authentication Code or MAC, is a well-studied cryptographic primitive that is used in order to authenticate communication between two parties sharing a secret key. A Tokeni…
Almost Public Quantum Coins
Amit Behera, Or Sattath
In a quantum money scheme, a bank can issue money that users cannot counterfeit. Similar to bills of paper money, most quantum money schemes assign a unique serial number to each m…
A Quantum Money Solution to the Blockchain Scalability Problem
Andrea Coladangelo, Or Sattath
We put forward the idea that classical blockchains and smart contracts are potentially useful primitives not only for classical cryptography, but for quantum cryptography as well.…
Semi-Quantum Money
Roy Radian, Or Sattath
Quantum money allows a bank to mint quantum money states that can later be verified and cannot be forged. Usually, this requires a quantum communication infrastructure to transfer…
On Quantum Advantage in Information Theoretic Single-Server PIR
Dorit Aharonov, Zvika Brakerski, Kai-Min Chung +3
In (single-server) Private Information Retrieval (PIR), a server holds a large database of size , and a client holds an index and wishes to retrieve wit…
On the insecurity of quantum Bitcoin mining
Or Sattath
Grover's algorithm confers on quantum computers a quadratic advantage over classical computers for searching in an arbitrary data set, a scenario that describes Bitcoin mining. It…
Quantum coin hedging, and a counter measure
Maor Ganz, Or Sattath
A quantum board game is a multi-round protocol between a single quantum player against the quantum board. Molina and Watrous discovered quantum hedging. They gave an example for pe…
On preparing ground states of gapped Hamiltonians: An efficient Quantum Lovász Local Lemma
András Gilyén, Or Sattath
A frustration-free local Hamiltonian has the property that its ground state minimises the energy of all local terms simultaneously. In general, even deciding whether a Hamiltonian…
Quantum Tokens for Digital Signatures
Shalev Ben-David, Or Sattath
The fisherman caught a quantum fish. "Fisherman, please let me go", begged the fish, "and I will grant you three wishes". The fisherman agreed. The fish gave the fisherman a quantu…
When a local Hamiltonian must be frustration-free
Or Sattath, Siddhardh C. Morampudi, Christopher R. Laumann +1
A broad range of quantum optimisation problems can be phrased as the question whether a specific system has a ground state at zero energy, i.e.\ whether its Hamiltonian is frustrat…
An adaptive attack on Wiesner's quantum money
Aharon Brodutch, Daniel Nagaj, Or Sattath +1
Unlike classical money, which is hard to forge for practical reasons (e.g. producing paper with a certain property), quantum money is attractive because its security might be based…
A Constructive Quantum Lovász Local Lemma for Commuting Projectors
Itai Arad, Or Sattath
The Quantum Satisfiability problem generalizes the Boolean satisfiability problem to the quantum setting by replacing classical clauses with local projectors. The Quantum Lovász Lo…
An Almost Sudden Jump in Quantum Complexity
Or Sattath
The Quantum Satisfiability problem (QSAT) is the generalization of the canonical NP-complete problem - Boolean Satisfiability. (k,s)-QSAT is the following variant of the problem: g…
The Complexity of the Separable Hamiltonian Problem
André Chailloux, Or Sattath
In this paper, we study variants of the canonical Local-Hamiltonian problem where, in addition, the witness is promised to be separable. We define two variants of the Local-Hamilto…
A Quantum Lovasz Local Lemma
Andris Ambainis, Julia Kempe, Or Sattath
The Lovasz Local Lemma (LLL) is a powerful tool in probability theory to show the existence of combinatorial objects meeting a prescribed collection of "weakly dependent" criteria.…