Nicholas Spooner

According to our database, Nicholas Spooner authored at least 29 papers between 2015 and 2024.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2024

Perfect Zero-Knowledge PCPs for #P.

Tom Gur, Jack O'Connor, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2024

2023

Concrete Security for Succinct Arguments from Vector Commitments.

Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2023

Proof-Carrying Data From Arithmetized Random Oracles.

Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2023

An efficient quantum parallel repetition theorem and applications.

John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen

Electron. Colloquium Comput. Complex., 2023

On the Necessity of Collapsing for Post-Quantum and Quantum Commitments.

Marcel Dall'Agnol, Nicholas Spooner

Proceedings of the 18th Conference on the Theory of Quantum Computation, 2023

2022

Spatial Isolation Implies Zero Knowledge Even in a Quantum World.

Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner

J. ACM, 2022

The Superlinearity Problem in Post-Quantum Blockchains.

Sunoo Park, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2022

Quantum Rewinding for Many-Round Protocols.

Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2022

Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions.

Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2022

On the necessity of collapsing.

Marcel Dall'Agnol, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2022

On Succinct Non-Interactive Arguments in Relativized Worlds.

Megan Chen, Alessandro Chiesa, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2022

2021

Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably).

Alex Lombardi, Fermi Ma, Nicholas Spooner

Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments.

Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Electron. Colloquium Comput. Complex., 2021

Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier.

Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Proof-Carrying Data from Accumulation Schemes.

Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2020

Proof-Carrying Data without Succinct Arguments.

Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2020

Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy.

Cecilia Boschini, Jan Camenisch, Max Ovsiankin, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2020

Recursive Proof Composition from Accumulation Schemes.

Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner

Proceedings of the Theory of Cryptography - 18th International Conference, 2020

2019

Fractal: Post-Quantum and Transparent Recursive Proofs from Holography.

Alessandro Chiesa, Dev Ojha, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2019

Succinct Arguments in the Quantum Random Oracle Model.

Alessandro Chiesa, Peter Manohar, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2019

Linear-Size Constant-Query IOPs for Delegating Computation.

Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2019

2018

Aurora: Transparent Succinct Arguments for R1CS.

Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward

IACR Cryptol. ePrint Arch., 2018

2017

A Zero Knowledge Sumcheck and its Applications.

Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner

Electron. Colloquium Comput. Complex., 2017

Zero Knowledge Protocols from Succinct Constraint Detection.

Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

Interactive Oracle Proofs with Constant Rate and Query Complexity.

Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Interactive Oracle Proofs.

Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner

IACR Cryptol. ePrint Arch., 2016

Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck.

Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner

Electron. Colloquium Comput. Complex., 2016

On Probabilistic Checking in Perfect Zero Knowledge.

Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner

Electron. Colloquium Comput. Complex., 2016

2015

Fixed Budget Performance of the (1+1) EA on Linear Functions.

Johannes Lengler, Nicholas Spooner

Proceedings of the 2015 ACM Conference on Foundations of Genetic Algorithms XIII, Aberystwyth, United Kingdom, January 17, 2015