Gus Gutoski

According to our database1, Gus Gutoski authored at least 19 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
The Espresso Sequencing Network: HotShot Consensus, Tiramisu Data-Availability, and Builder-Exchange.
IACR Cryptol. ePrint Arch., 2024

2017
Fidelity of Quantum Strategies with Applications to Cryptography.
Proceedings of the 12th Conference on the Theory of Quantum Computation, 2017

Revisiting TESLA in the Quantum Random Oracle Model.
Proceedings of the Post-Quantum Cryptography - 8th International Workshop, 2017

2016
Optimal bounds for semi-honest quantum oblivious transfer.
Chic. J. Theor. Comput. Sci., 2016

2015
Quantum Interactive Proofs and the Complexity of Separability Testing.
Theory Comput., 2015

2014
Hierarchical deterministic Bitcoin wallets that tolerate key leakage.
IACR Cryptol. ePrint Arch., 2014

2013
Quantum one-time programs.
IACR Cryptol. ePrint Arch., 2013

Quantum interactive proofs and the complexity of entanglement detection.
CoRR, 2013

Optimal bounds for quantum weak oblivious transfer.
CoRR, 2013

Interactive proofs with competing teams of no-signaling provers.
Chic. J. Theor. Comput. Sci., 2013

Parallel Approximation of Min-Max Problems.
Comput. Complex., 2013

Quantum One-Time Programs - (Extended Abstract).
Proceedings of the Advances in Cryptology - CRYPTO 2013, 2013

2012
Parallel Approximation of Min-max Problems with Applications to Classical and Quantum Zero-Sum Games.
Proceedings of the 27th Conference on Computational Complexity, 2012

2010
Short quantum games characterize PSPACE
CoRR, 2010

2009
Properties of local quantum operations with shared entanglement.
Quantum Inf. Comput., 2009

2007
Toward a general theory of quantum games.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

2005
Short Quantum Games
CoRR, 2005

Quantum Interactive Proofs with Competing Provers.
Proceedings of the STACS 2005, 2005

Upper Bounds for Quantum Interactive Proofs with Competing Provers.
Proceedings of the 20th Annual IEEE Conference on Computational Complexity (CCC 2005), 2005


  Loading...