\textsc{Fractal}: post-quantum and transparent recursive proofs from holography
type: Item
instance of: scholarly article
title: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
DOI: 10.1007/978-3-030-45721-1_27
author: Alessandro Chiesa
author: Dev Ojha
author: Nicholas Spooner
publication date: 2021-12-01T00:00:00Z
Mathematics Subject Classification ID: 68Qxx
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 81P94
zbMATH DE Number: 7436938
zbMATH Keywords: succinct arguments
zbMATH Keywords: holographic proofs
zbMATH Keywords: recursive proof composition
zbMATH Keywords: post-quantum cryptography
MaRDI profile type: Publication
full work available at URL: 978-3-030-45721-1 27
OpenAlex ID: W3023964980
cites work: UC-secure CRS generation for SNARKs
cites work: Fast Reed-Solomon Interactive Oracle Proofs of Proximity
cites work: Scalable zero knowledge with no trusted setup
cites work: Linear-size constant-query IOPs for delegating computation
cites work: Aurora: transparent succinct arguments for R1CS
cites work: Interactive Oracle Proofs
cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves
cites work: Q5875697
cites work: Robust PCPs of Proximity, Shorter PCPs, and Applications to Coding
cites work: Recursive composition and bootstrapping for SNARKS and proof-carrying data
cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs
cites work: Random Oracles in a Quantum World
cites work: The random oracle methodology, revisited
cites work: Q4005200
cites work: On Cycles of Pairing-Friendly Elliptic Curves
cites work: Marlin: preprocessing zkSNARKs with universal and updatable SRS
cites work: Succinct arguments in the quantum random oracle model
cites work: Cluster Computing in Zero Knowledge
cites work: Assignment Testers: Towards a Combinatorial Proof of the PCP Theorem
cites work: Fast approximate probabilistically checkable proofs
cites work: Q4289278
cites work: A taxonomy of pairing-friendly elliptic curves
cites work: Quadratic Span Programs and Succinct NIZKs without PCPs
cites work: Delegating Computation
cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments
cites work: On the Size of Pairing-Based Non-interactive Arguments
cites work: Updatable and universal common reference strings with applications to zk-SNARKs
cites work: Non-Interactive Proofs of Proximity
cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
cites work: Algebraic methods for interactive proof systems
cites work: Computationally Sound Proofs
cites work: Constant-round interactive proofs for delegating computation
cites work: Interactive proofs of proximity
cites work: Spartan: efficient and general-purpose zkSNARKs without trusted setup
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
cites work: Libra: succinct zero-knowledge proofs with optimal prover computation
description: scientific article; zbMATH DE number 7436938