Pages that link to "Item:Q5495781"
From MaRDI portal
The following pages link to Recursive composition and bootstrapping for SNARKS and proof-carrying data (Q5495781):
Displaying 50 items.
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- Practical homomorphic message authenticators for arithmetic circuits (Q1747657) (← links)
- \textsc{Fractal}: post-quantum and transparent recursive proofs from holography (Q2055643) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- Keyed-fully homomorphic encryption without indistinguishability obfuscation (Q2096599) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments (Q2120097) (← links)
- Proof-carrying data without succinct arguments (Q2120099) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Non-interactive batch arguments for NP from standard assumptions (Q2139642) (← links)
- Efficient proof composition for verifiable computation (Q2167734) (← links)
- On succinct non-interactive arguments in relativized worlds (Q2170051) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Gemini: elastic SNARKs for diverse environments (Q2170056) (← links)
- SNARGs for P from sub-exponential DDH and QR (Q2170061) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- On the (In)security of Kilian-based SNARGs (Q2175953) (← links)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Constrained PRFs for Unbounded Inputs with Short Keys (Q2822688) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- On Zero-Knowledge with Strict Polynomial-Time Simulation and Extraction from Differing-Input Obfuscation for Circuits (Q2947522) (← links)
- Multi-key Homomorphic Authenticators (Q2953787) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Delegating RAM Computations (Q3181023) (← links)
- Three-Round Public-Coin Bounded-Auxiliary-Input Zero-Knowledge Arguments of Knowledge (Q3454578) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- The bottleneck complexity of secure multiparty computation (Q5002694) (← links)
- Computational Integrity with a Public Random String from Quasi-Linear PCPs (Q5270376) (← links)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
- Sublinear Zero-Knowledge Arguments for RAM Programs (Q5738888) (← links)
- No-signaling linear PCPs (Q5915596) (← links)
- No-signaling linear PCPs (Q5925695) (← links)
- Plumo: an ultralight blockchain client (Q6045243) (← links)
- Proof-carrying data from arithmetized random oracles (Q6061366) (← links)
- Ligero: lightweight sublinear arguments without a trusted setup (Q6063128) (← links)
- Breaking the \(O(\sqrt{n})\)-bit barrier: Byzantine agreement with polylog bits per party (Q6070449) (← links)
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract) (Q6104330) (← links)
- Efficient zero-knowledge arguments in discrete logarithm setting: sublogarithmic proof or sublinear verifier (Q6132419) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- Proofs for inner pairing products and applications (Q6157545) (← links)
- Nova: recursive zero-knowledge arguments from folding schemes (Q6166957) (← links)
- Fully succinct batch arguments for \textsf{NP} from indistinguishability obfuscation (Q6169370) (← links)
- Protostar: generic efficient accumulation/folding for special-sound protocols (Q6562560) (← links)
- Folding schemes with selective verification (Q6619934) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
