default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNicholas Spooner
Person information
- affiliation: University of Warwick, UK
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c23]John Bostanci
, Luowen Qian, Nicholas Spooner, Henry Yuen:
An Efficient Quantum Parallel Repetition Theorem and Applications. STOC 2024: 1478-1487- [c22]Tom Gur, Jack O'Connor, Nicholas Spooner:
Perfect Zero-Knowledge PCPs for #P. STOC 2024: 1724-1730 - [c21]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. TCC (1) 2024: 158-188 - [i40]Tom Gur, Jack O'Connor, Nicholas Spooner:
Perfect Zero-Knowledge PCPs for #P. CoRR abs/2403.11941 (2024) - [i39]Alessandro Chiesa, Marcel Dall'Agnol, Zijing Di, Ziyi Guan, Nicholas Spooner:
Quantum Rewinding for IOP-Based Succinct Arguments. CoRR abs/2411.05360 (2024) - [i38]Tom Gur, Jack O'Connor, Nicholas Spooner:
A Zero-Knowledge PCP Theorem. CoRR abs/2411.07972 (2024) - [i37]Tom Gur, Jack O'Connor, Nicholas Spooner:
Perfect Zero-Knowledge PCPs for #P. IACR Cryptol. ePrint Arch. 2024: 462 (2024) - [i36]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner, Eylon Yogev:
Untangling the Security of Kilian's Protocol: Upper and Lower Bounds. IACR Cryptol. ePrint Arch. 2024: 1434 (2024) - [i35]Tom Gur, Jack O'Connor, Nicholas Spooner:
A Zero-Knowledge PCP Theorem. IACR Cryptol. ePrint Arch. 2024: 1854 (2024) - 2023
- [c20]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. EUROCRYPT (2) 2023: 347-378 - [c19]Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner:
Proof-Carrying Data from Arithmetized Random Oracles. EUROCRYPT (2) 2023: 379-404 - [c18]Sunoo Park, Nicholas Spooner:
The Superlinearity Problem in Post-quantum Blockchains. FC (1) 2023: 200-217 - [c17]Marcel Dall'Agnol, Nicholas Spooner:
On the Necessity of Collapsing for Post-Quantum and Quantum Commitments. TQC 2023: 2:1-2:23 - [i34]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. CoRR abs/2311.10681 (2023) - [i33]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. Electron. Colloquium Comput. Complex. TR23 (2023) - [i32]Megan Chen, Alessandro Chiesa, Tom Gur, Jack O'Connor, Nicholas Spooner:
Proof-Carrying Data From Arithmetized Random Oracles. IACR Cryptol. ePrint Arch. 2023: 587 (2023) - [i31]Alessandro Chiesa, Marcel Dall'Agnol, Ziyi Guan, Nicholas Spooner:
Concrete Security for Succinct Arguments from Vector Commitments. IACR Cryptol. ePrint Arch. 2023: 1737 (2023) - [i30]John Bostanci, Luowen Qian, Nicholas Spooner, Henry Yuen:
An efficient quantum parallel repetition theorem and applications. IACR Cryptol. ePrint Arch. 2023: 1783 (2023) - 2022
- [j1]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. J. ACM 69(2): 15:1-15:44 (2022) - [c16]Megan Chen, Alessandro Chiesa, Nicholas Spooner:
On Succinct Non-interactive Arguments in Relativized Worlds. EUROCRYPT (2) 2022: 336-366 - [c15]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited or: How to Do Quantum Rewinding Undetectably. FOCS 2022: 851-859 - [c14]Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner:
Quantum Rewinding for Many-Round Protocols. TCC (1) 2022: 80-109 - [i29]Megan Chen, Alessandro Chiesa, Nicholas Spooner:
On Succinct Non-Interactive Arguments in Relativized Worlds. IACR Cryptol. ePrint Arch. 2022: 383 (2022) - [i28]Marcel Dall'Agnol, Nicholas Spooner:
On the necessity of collapsing. IACR Cryptol. ePrint Arch. 2022: 786 (2022) - [i27]Russell W. F. Lai, Giulio Malavolta, Nicholas Spooner:
Quantum Rewinding for Many-Round Protocols. IACR Cryptol. ePrint Arch. 2022: 889 (2022) - [i26]Aarushi Goel, Mathias Hall-Andersen, Gabriel Kaptchuk, Nicholas Spooner:
Speed-Stacking: Fast Sublinear Zero-Knowledge Proofs for Disjunctions. IACR Cryptol. ePrint Arch. 2022: 1419 (2022) - [i25]Sunoo Park, Nicholas Spooner:
The Superlinearity Problem in Post-Quantum Blockchains. IACR Cryptol. ePrint Arch. 2022: 1423 (2022) - 2021
- [c13]Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra, Nicholas Spooner:
Proof-Carrying Data Without Succinct Arguments. CRYPTO (1) 2021: 681-710 - [c12]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments: Breaking the Quantum Rewinding Barrier. FOCS 2021: 49-58 - [i24]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. CoRR abs/2103.08140 (2021) - [i23]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). CoRR abs/2111.12257 (2021) - [i22]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. Electron. Colloquium Comput. Complex. TR21 (2021) - [i21]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to Do Quantum Rewinding Undetectably). Electron. Colloquium Comput. Complex. TR21 (2021) - [i20]Alessandro Chiesa, Fermi Ma, Nicholas Spooner, Mark Zhandry:
Post-Quantum Succinct Arguments. IACR Cryptol. ePrint Arch. 2021: 334 (2021) - [i19]Alex Lombardi, Fermi Ma, Nicholas Spooner:
Post-Quantum Zero Knowledge, Revisited (or: How to do Quantum Rewinding Undetectably). IACR Cryptol. ePrint Arch. 2021: 1543 (2021) - 2020
- [b1]Nicholas Spooner:
Succinct Non-Interactive Arguments for Arithmetic Circuits. University of California, Berkeley, USA, 2020 - [c11]Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-quantum and Transparent Recursive Proofs from Holography. EUROCRYPT (1) 2020: 769-793 - [c10]Cecilia Boschini, Jan Camenisch, Max Ovsiankin, Nicholas Spooner:
Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy. PQCrypto 2020: 247-267 - [c9]Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner:
Recursive Proof Composition from Accumulation Schemes. TCC (2) 2020: 1-18 - [i18]Benedikt Bünz, Alessandro Chiesa, Pratyush Mishra, Nicholas Spooner:
Proof-Carrying Data from Accumulation Schemes. IACR Cryptol. ePrint Arch. 2020: 499 (2020) - [i17]Cecilia Boschini, Jan Camenisch, Max Ovsiankin, Nicholas Spooner:
Efficient Post-Quantum SNARKs for RSIS and RLWE and their Applications to Privacy. IACR Cryptol. ePrint Arch. 2020: 1190 (2020) - [i16]Benedikt Bünz, Alessandro Chiesa, William Lin, Pratyush Mishra, Nicholas Spooner:
Proof-Carrying Data without Succinct Arguments. IACR Cryptol. ePrint Arch. 2020: 1618 (2020)
2010 – 2019
- 2019
- [c8]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. EUROCRYPT (1) 2019: 103-128 - [c7]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. TCC (2) 2019: 1-29 - [c6]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. TCC (2) 2019: 494-521 - [i15]Alessandro Chiesa, Peter Manohar, Nicholas Spooner:
Succinct Arguments in the Quantum Random Oracle Model. IACR Cryptol. ePrint Arch. 2019: 834 (2019) - [i14]Alessandro Chiesa, Dev Ojha, Nicholas Spooner:
Fractal: Post-Quantum and Transparent Recursive Proofs from Holography. IACR Cryptol. ePrint Arch. 2019: 1076 (2019) - [i13]Eli Ben-Sasson, Alessandro Chiesa, Lior Goldberg, Tom Gur, Michael Riabzev, Nicholas Spooner:
Linear-Size Constant-Query IOPs for Delegating Computation. IACR Cryptol. ePrint Arch. 2019: 1230 (2019) - 2018
- [c5]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. FOCS 2018: 755-765 - [i12]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. CoRR abs/1803.01519 (2018) - [i11]Alessandro Chiesa, Michael A. Forbes, Tom Gur, Nicholas Spooner:
Spatial Isolation Implies Zero Knowledge Even in a Quantum World. Electron. Colloquium Comput. Complex. TR18 (2018) - [i10]Eli Ben-Sasson, Alessandro Chiesa, Michael Riabzev, Nicholas Spooner, Madars Virza, Nicholas P. Ward:
Aurora: Transparent Succinct Arguments for R1CS. IACR Cryptol. ePrint Arch. 2018: 828 (2018) - 2017
- [c4]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Interactive Oracle Proofs with Constant Rate and Query Complexity. ICALP 2017: 40:1-40:15 - [c3]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Zero Knowledge Protocols from Succinct Constraint Detection. TCC (2) 2017: 172-206 - [i9]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. CoRR abs/1704.02086 (2017) - [i8]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. Electron. Colloquium Comput. Complex. TR17 (2017) - [i7]Alessandro Chiesa, Michael A. Forbes, Nicholas Spooner:
A Zero Knowledge Sumcheck and its Applications. IACR Cryptol. ePrint Arch. 2017: 305 (2017) - 2016
- [c2]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner:
Interactive Oracle Proofs. TCC (B2) 2016: 31-60 - [i6]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. CoRR abs/1610.03798 (2016) - [i5]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. Electron. Colloquium Comput. Complex. TR16 (2016) - [i4]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. Electron. Colloquium Comput. Complex. TR16 (2016) - [i3]Eli Ben-Sasson, Alessandro Chiesa, Nicholas Spooner:
Interactive Oracle Proofs. IACR Cryptol. ePrint Arch. 2016: 116 (2016) - [i2]Eli Ben-Sasson, Alessandro Chiesa, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
Short Interactive Oracle Proofs with Constant Query Complexity, via Composition and Sumcheck. IACR Cryptol. ePrint Arch. 2016: 324 (2016) - [i1]Eli Ben-Sasson, Alessandro Chiesa, Michael A. Forbes, Ariel Gabizon, Michael Riabzev, Nicholas Spooner:
On Probabilistic Checking in Perfect Zero Knowledge. IACR Cryptol. ePrint Arch. 2016: 988 (2016) - 2015
- [c1]Johannes Lengler, Nicholas Spooner:
Fixed Budget Performance of the (1+1) EA on Linear Functions. FOGA 2015: 52-61
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-13 01:05 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
