Obserwuj
Nick Spooner
Tytuł
Cytowane przez
Cytowane przez
Rok
Aurora: Transparent succinct arguments for R1CS
E Ben-Sasson, A Chiesa, M Riabzev, N Spooner, M Virza, NP Ward
Advances in Cryptology–EUROCRYPT 2019: 38th Annual International Conference …, 2019
4052019
Interactive oracle proofs
E Ben-Sasson, A Chiesa, N Spooner
Theory of Cryptography: 14th International Conference, TCC 2016-B, Beijing …, 2016
3102016
Fractal: Post-quantum and Transparent Recursive Proofs from Holography
A Chiesa, D Ojha, N Spooner
Advances in Cryptology–EUROCRYPT 2020: 39th Annual International Conference …, 2020
2072020
Proof-carrying data from accumulation schemes
B Bünz, A Chiesa, P Mishra, N Spooner
Cryptology ePrint Archive, 2020
99*2020
Interactive oracle proofs with constant rate and query complexity
E Ben-Sasson, A Chiesa, A Gabizon, M Riabzev, N Spooner
Cryptology ePrint Archive, 2016
76*2016
Succinct arguments in the quantum random oracle model
A Chiesa, P Manohar, N Spooner
Theory of Cryptography: 17th International Conference, TCC 2019, Nuremberg …, 2019
682019
Proof-carrying data without succinct arguments
B Bünz, A Chiesa, W Lin, P Mishra, N Spooner
Advances in Cryptology–CRYPTO 2021: 41st Annual International Cryptology …, 2021
612021
A zero knowledge sumcheck and its applications
A Chiesa, MA Forbes, N Spooner
arXiv preprint arXiv:1704.02086, 2017
592017
Post-quantum succinct arguments: breaking the quantum rewinding barrier
A Chiesa, F Ma, N Spooner, M Zhandry
2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS), 49-58, 2022
512022
Linear-size constant-query IOPs for delegating computation
E Ben-Sasson, A Chiesa, L Goldberg, T Gur, M Riabzev, N Spooner
Theory of Cryptography Conference, 494-521, 2019
432019
Zero knowledge protocols from succinct constraint detection
E Ben-Sasson, A Chiesa, MA Forbes, A Gabizon, M Riabzev, N Spooner
Theory of Cryptography: 15th International Conference, TCC 2017, Baltimore …, 2017
36*2017
Fixed Budget Performance of the (1+ 1)-EA on Linear Functions
J Lengler, N Spooner
FOGA 2015, 2015
302015
Efficient post-quantum SNARKs for RSIS and RLWE and their applications to privacy
C Boschini, J Camenisch, M Ovsiankin, N Spooner
Post-Quantum Cryptography: 11th International Conference, PQCrypto 2020 …, 2020
292020
Post-quantum zero knowledge, revisited or: How to do quantum rewinding undetectably
A Lombardi, F Ma, N Spooner
2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS …, 2022
272022
Spatial isolation implies zero knowledge even in a quantum world
A Chiesa, MA Forbes, T Gur, N Spooner
ACM Journal of the ACM (JACM) 69 (2), 1-44, 2022
162022
On the Necessity of Collapsing for Quantum and Post-Quantum Commitments
M Dall'Agnol, N Spooner
Cryptology ePrint Archive, 2022
14*2022
On succinct non-interactive arguments in relativized worlds
M Chen, A Chiesa, N Spooner
Annual International Conference on the Theory and Applications of …, 2022
112022
Proof-carrying data from arithmetized random oracles
M Chen, A Chiesa, T Gur, J O’Connor, N Spooner
Annual International Conference on the Theory and Applications of …, 2023
92023
Speed-stacking: Fast sublinear zero-knowledge proofs for disjunctions
A Goel, M Hall-Andersen, G Kaptchuk, N Spooner
Annual International Conference on the Theory and Applications of …, 2023
62023
Quantum rewinding for many-round protocols
RWF Lai, G Malavolta, N Spooner
Theory of Cryptography Conference, 80-109, 2022
42022
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20