Or Sattath

Orcid: 0000-0001-7567-3822

According to our database1, Or Sattath authored at least 33 papers between 2012 and 2024.

Collaborative distances:



In proceedings 
PhD thesis 


On csauthors.net:


51% Attack via Difficulty Increase with a Small Quantum Miner.
CoRR, 2024

Uncloneable Cryptography.
Commun. ACM, November, 2023

Quantum Tokens for Digital Signatures.
Quantum, January, 2023

Protecting Quantum Procrastinators with Signature Lifting: A Case Study in Cryptocurrencies.
IACR Cryptol. ePrint Arch., 2023

Encryption with Quantum Public Keys.
IACR Cryptol. ePrint Arch., 2023

Pseudorandomness with Proof of Destruction and Applications.
IACR Cryptol. ePrint Arch., 2023

Public-Key Encryption with Quantum Keys.
IACR Cryptol. ePrint Arch., 2023

Redesigning Bitcoin's Fee Market.
ACM Trans. Economics and Comput., 2022

The Pursuit of Uniqueness: Extending Valiant-Vazirani Theorem to the Probabilistic and Quantum Settings.
Quantum, 2022

Semi-quantum Money.
J. Cryptol., 2022

General Partially Fair Multi-Party Computation with VDFs.
IACR Cryptol. ePrint Arch., 2022

Quantum Amnesia Leaves Cryptographic Mementos: A Note On Quantum Skepticism.
CoRR, 2022

Quantum Prudent Contracts with Applications to Bitcoin.
CoRR, 2022

Uncloneable Decryptors from Quantum Copy-Protection.
CoRR, 2022

Noise-Tolerant Quantum Tokens for MAC.
IACR Cryptol. ePrint Arch., 2021

Revisiting the Properties of Money.
CoRR, 2021

A Quantum Money Solution to the Blockchain Scalability Problem.
Quantum, 2020

On the insecurity of quantum Bitcoin mining.
Int. J. Inf. Sec., 2020

Almost Public Coins.
IACR Cryptol. ePrint Arch., 2020

Quantum Technology for Economists.
CoRR, 2020

Almost Public Quantum Coins.
CoRR, 2020

On Quantum Advantage in Information Theoretic Single-Server PIR.
IACR Cryptol. ePrint Arch., 2019

Quantum Coin Hedging, and a Counter Measure.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

On Preparing Ground States of Gapped Hamiltonians: An Efficient Quantum Lovász Local Lemma.
Proceedings of the 58th IEEE Annual Symposium on Foundations of Computer Science, 2017

An adaptive attack on Wiesner's quantum money.
Quantum Inf. Comput., 2016

A constructive quantum Lovasz local lemma for commuting projectors.
Quantum Inf. Comput., 2015

An almost sudden jump in quantum complexity.
Quantum Inf. Comput., 2015

When must a local Hamiltonian be frustration free?
CoRR, 2015

Quantum Max-flow/Min-cut.
CoRR, 2015

Constraint satisfaction problems : a quantum perspective (שער נוסף בעברית: בעיות אילוצים : פרספקטיבה קוונטית.).
PhD thesis, 2013

On the Power of a Unique Quantum Witness.
Theory Comput., 2012

A quantum lovász local lemma.
J. ACM, 2012

The Complexity of the Separable Hamiltonian Problem.
Proceedings of the 27th Conference on Computational Complexity, 2012