James Bartusek

Orcid: 0009-0000-9020-3589

According to our database1, James Bartusek authored at least 29 papers between 2018 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Quantum State Obfuscation from Classical Oracles.
IACR Cryptol. ePrint Arch., 2024

2023
Secure Computation with Shared EPR Pairs (Or: How to Teleport in Zero-Knowledge).
IACR Cryptol. ePrint Arch., 2023

Publicly-Verifiable Deletion via Target-Collapsing Functions.
IACR Cryptol. ePrint Arch., 2023

Obfuscation of Pseudo-Deterministic Quantum Circuits.
IACR Cryptol. ePrint Arch., 2023

Weakening Assumptions for Publicly-Verifiable Deletion.
IACR Cryptol. ePrint Arch., 2023

Obfuscation and Outsourced Computation with Certified Deletion.
IACR Cryptol. ePrint Arch., 2023

2022
Succinct Classical Verification of Quantum Computation.
IACR Cryptol. ePrint Arch., 2022

Cryptography with Certified Deletion.
IACR Cryptol. ePrint Arch., 2022

End-to-End Secure Messaging with Traceability Only for Illegal Content.
IACR Cryptol. ePrint Arch., 2022

A New Framework for Quantum Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2022

Indistinguishability Obfuscation of Null Quantum Circuits and Applications.
Proceedings of the 13th Innovations in Theoretical Computer Science Conference, 2022

2021
Candidate Obfuscation of Null Quantum Circuits and Witness Encryption for QMA.
IACR Cryptol. ePrint Arch., 2021

Reusable Two-Round MPC from LPN.
IACR Cryptol. ePrint Arch., 2021

Secure Quantum Computation with Classical Communication.
IACR Cryptol. ePrint Arch., 2021

Two-Round Maliciously Secure Computation with Super-Polynomial Simulation.
IACR Cryptol. ePrint Arch., 2021

On the Round Complexity of Secure Quantum Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Affine Determinant Programs: A Framework for Obfuscation and Witness Encryption.
IACR Cryptol. ePrint Arch., 2020

One-Way Functions Imply Secure Computation in a Quantum World.
IACR Cryptol. ePrint Arch., 2020

On The Round Complexity of Two-Party Quantum Computation.
IACR Cryptol. ePrint Arch., 2020

Reusable Two-Round MPC from DDH.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2020

Post-Quantum Multi-Party Computation in Constant Rounds.
CoRR, 2020

Reusable Two-Round MPC from DDH.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019
The Distinction Between Fixed and Random Generators in Group-Based Assumptions.
IACR Cryptol. ePrint Arch., 2019

Public-Key Function-Private Hidden Vector Encryption (and More).
IACR Cryptol. ePrint Arch., 2019

On the (In)security of Kilian-Based SNARGs.
IACR Cryptol. ePrint Arch., 2019

2018
New Techniques for Obfuscating Conjunctions.
IACR Cryptol. ePrint Arch., 2018

Preventing Zeroizing Attacks on GGH15.
IACR Cryptol. ePrint Arch., 2018

Return of GGH15: Provable Security Against Zeroizing Attacks.
Proceedings of the Theory of Cryptography - 16th International Conference, 2018


  Loading...