Nicholas Spooner

Orcid: 0000-0002-0085-2137

Affiliations:
  • University of Warwick, UK


According to our database1, Nicholas Spooner authored at least 33 papers between 2015 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2025
Quantum Rewinding for IOP-Based Succinct Arguments.
IACR Cryptol. ePrint Arch., 2025

A Zero-Knowledge PCP Theorem.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

2024
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds.
Proceedings of the Theory of Cryptography - 22nd International Conference, 2024

Perfect Zero-Knowledge PCPs for #P.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

An Efficient Quantum Parallel Repetition Theorem and Applications.
Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

2023
Concrete Security for Succinct Arguments from Vector Commitments.
IACR Cryptol. ePrint Arch., 2023

On the Necessity of Collapsing for Post-Quantum and Quantum Commitments.
Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

The Superlinearity Problem in Post-quantum Blockchains.
Proceedings of the Financial Cryptography and Data Security, 2023

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

Proof-Carrying Data from Arithmetized Random Oracles.
Proceedings of the Advances in Cryptology - EUROCRYPT 2023, 2023

2022
On the necessity of collapsing.
IACR Cryptol. ePrint Arch., 2022

Quantum Rewinding for Many-Round Protocols.
Proceedings of the Theory of Cryptography - 20th International Conference, 2022

Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably.
Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

On Succinct Non-interactive Arguments in Relativized Worlds.
Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2021
Post-Quantum Succinct Arguments.
Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier.
Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

Proof-Carrying Data Without Succinct Arguments.
Proceedings of the Advances in Cryptology - CRYPTO 2021, 2021

2020
Succinct Non-Interactive Arguments for Arithmetic Circuits
PhD thesis, 2020

Proof-Carrying Data from Accumulation Schemes.
IACR Cryptol. ePrint Arch., 2020

Recursive Proof Composition from Accumulation Schemes.
Proceedings of the Theory of Cryptography - 18th International Conference, 2020

Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy.
Proceedings of the Post-Quantum Cryptography - 11th International Conference, 2020

Fractal: Post-quantum and Transparent Recursive Proofs from Holography.
Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

2019
Succinct Arguments in the Quantum Random Oracle Model.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Linear-Size Constant-Query IOPs for Delegating Computation.
Proceedings of the Theory of Cryptography - 17th International Conference, 2019

Aurora: Transparent Succinct Arguments for R1CS.
Proceedings of the Advances in Cryptology - EUROCRYPT 2019, 2019

2018
Spatial Isolation Implies Zero Knowledge Even in a Quantum World.
Proceedings of the 59th IEEE Annual Symposium on Foundations of Computer Science, 2018

2017
A Zero Knowledge Sumcheck and its Applications.
Electron. Colloquium Comput. Complex., 2017

Zero Knowledge Protocols from Succinct Constraint Detection.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Interactive Oracle Proofs with Constant Rate and Query Complexity.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.
Electron. Colloquium Comput. Complex., 2016

On Probabilistic Checking in Perfect Zero Knowledge.
Electron. Colloquium Comput. Complex., 2016

Interactive Oracle Proofs.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

2015
Fixed Budget Performance of the (1+1) EA on Linear Functions.
Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015


  Loading...