Alexander Poremba

Orcid: 0000-0002-7330-1539

According to our database1, Alexander Poremba authored at least 27 papers between 2017 and 2026.

Collaborative distances:

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Publicly Verifiable Deletion: General Compilers from Minimal Assumptions.
J. Cryptol., July, 2026

Rounding Almost Commuting Hamiltonians.
CoRR, May, 2026

Post-Quantum Cryptography from Quantum Stabilizer Decoding.
CoRR, March, 2026

Average-Case Complexity of Quantum Stabilizer Decoding.
Proceedings of the 58th Annual ACM Symposium on Theory of Computing, 2026

Cloning Games, Black Holes and Cryptography.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

The Learning Stabilizers with Noise Problem.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

Unitary Complexity and the Uhlmann Transformation Problem.
Proceedings of the 17th Innovations in Theoretical Computer Science Conference, 2026

2025
Efficient Quantum Pseudorandomness from Hamiltonian Phase States.
Proceedings of the 20th Conference on the Theory of Quantum Computation, 2025

Revocable Encryption, Programs, and More: The Case of Multi-Copy Security.
Proceedings of the 6th Conference on Information-Theoretic Cryptography, 2025

2024
Quantum copy-protection of compute-and-compare programs in the quantum random oracle model.
Quantum, 2024

Pseudorandom unitaries with non-adaptive security.
IACR Cryptol. ePrint Arch., 2024

(Quantum) Indifferentiability and Pre-Computation.
IACR Cryptol. ePrint Arch., 2024

On the Two-sided Permutation Inversion Problem.
IACR Commun. Cryptol., 2024

Revocable Quantum Digital Signatures.
Proceedings of the 19th Conference on the Theory of Quantum Computation, 2024

Simple Constructions of Linear-Depth t-Designs and Pseudorandom Unitaries.
Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

Quantum One-Wayness of the Single-Round Sponge with Invertible Permutations.
Proceedings of the Advances in Cryptology - CRYPTO 2024, 2024

2023
Revocable Cryptography in a Quantum World.
PhD thesis, 2023

Weakening Assumptions for Publicly-Verifiable Deletion.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Revocable Cryptography from Learning with Errors.
Proceedings of the Theory of Cryptography - 21st International Conference, 2023

Quantum Proofs of Deletion for Learning with Errors.
Proceedings of the 14th Innovations in Theoretical Computer Science Conference, 2023

Quantum Cryptography with Classical Communication: Parallel Remote State Preparation for Copy-Protection, Verification, and More.
Proceedings of the 50th International Colloquium on Automata, Languages, and Programming, 2023

Publicly-Verifiable Deletion via Target-Collapsing Functions.
Proceedings of the Advances in Cryptology - CRYPTO 2023, 2023

2020
Variational Quantum Fidelity Estimation.
Quantum, 2020

2019
Quantum-assisted quantum compiling.
Quantum, 2019

On Quantum Chosen-Ciphertext Attacks and Learning with Errors.
Proceedings of the 14th Conference on the Theory of Quantum Computation, 2019

2018
On non-adaptive quantum chosen-ciphertext attacks and Learning with Errors.
CoRR, 2018

2017
Quantum Learning Algorithms and Post-Quantum Cryptography.
CoRR, 2017


  Loading...