Bartusek, James
39  Ergebnisse:
Personensuche X
?
1

On the Communication Complexity of Secure Multi-Party Compu..:

, In: Proceedings of the 43rd ACM Symposium on Principles of Distributed Computing,
 
?
2

Quantum State Obfuscation from Classical Oracles:

, In: Proceedings of the 56th Annual ACM Symposium on Theory of Computing,
 
?
3

Software with Certified Deletion:

, In: Lecture Notes in Computer Science; Advances in Cryptology – EUROCRYPT 2024,
Bartusek, James ; Goyal, Vipul ; Khurana, Dakshita... - p. 85-111 , 2024
 
?
4

A New Framework for Quantum Oblivious Transfer:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
 
?
5

Secure Computation with Shared EPR Pairs (Or: How to Telepo..:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
 
?
6

Publicly-Verifiable Deletion via Target-Collapsing Function:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
 
?
7

End-to-End Secure Messaging with Traceability Only for Ille..:

, In: Advances in Cryptology – EUROCRYPT 2023; Lecture Notes in Computer Science,
 
?
8

Obfuscation of Pseudo-Deterministic Quantum Circuits:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bartusek, James ; Kitagawa, Fuyuki ; Nishimaki, Ryo. - p. 1567-1578 , 2023
 
?
9

Cryptography with Certified Deletion:

, In: Advances in Cryptology – CRYPTO 2023; Lecture Notes in Computer Science,
Bartusek, James ; Khurana, Dakshita - p. 192-223 , 2023
 
?
10

Weakening Assumptions for Publicly-Verifiable Deletion:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
 
?
11

Succinct Classical Verification of Quantum Computation:

, In: Advances in Cryptology – CRYPTO 2022; Lecture Notes in Computer Science,
 
?
12

Reusable Two-Round MPC from LPN:

, In: Public-Key Cryptography – PKC 2022; Lecture Notes in Computer Science,
 
?
13

Secure Quantum Computation with Classical Communication:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Bartusek, James - p. 1-30 , 2021
 
?
14

Two-Round Maliciously Secure Computation with Super-Polynom..:

, In: Theory of Cryptography; Lecture Notes in Computer Science,
Agarwal, Amit ; Bartusek, James ; Goyal, Vipul.. - p. 654-685 , 2021
 
?
15

On the Round Complexity of Secure Quantum Computation:

, In: Advances in Cryptology – CRYPTO 2021; Lecture Notes in Computer Science,
 
1-15