Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions (Q6061364): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: 1-out-of-n Signatures from a Variety of Keys / rank
 
Normal rank
Property / cites work
 
Property / cites work: KVaC: key-value commitments for blockchains and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compressing proofs of \(k\)-out-of-\(n\) partial knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: A compressed \(\varSigma \)-protocol theory for lattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsf{Mac'n'Cheese}: zero-knowledge proofs for Boolean and arithmetic circuits with nested disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aurora: transparent succinct arguments for R1CS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interactive Oracle Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Scalable Zero Knowledge via Cycles of Elliptic Curves / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5875697 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Public-coin zero-knowledge arguments with (almost) minimal time and space overheads / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time- and space-efficient arguments from groups of unknown order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Batching techniques for accumulators with applications to IOPs and stateless blockchains / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast modular transforms / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsc{Fractal}: post-quantum and transparent recursive proofs from holography / rank
 
Normal rank
Property / cites work
 
Property / cites work: Online/Offline OR Composition of Sigma Protocols / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4940695 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4434875 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quadratic Span Programs and Succinct NIZKs without PCPs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure multiparty computation with free branching / rank
 
Normal rank
Property / cites work
 
Property / cites work: The knowledge complexity of interactive proof-systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Size of Pairing-Based Non-interactive Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-Out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stacked garbling. Garbled circuit proportional to longest execution path / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stacked garbling for disjunctive zero-knowledge proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \textsf{LogStack}: stacked garbling with \(O(b \log b)\) computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new approach to efficient non-malleable zero-knowledge / rank
 
Normal rank
Property / cites work
 
Property / cites work: Free IF: how to omit inactive branches and implement \(\mathcal{S}\)-universal garbled circuit (almost) for free / rank
 
Normal rank
Property / cites work
 
Property / cites work: Pushing the limits of Valiant's universal circuits: simpler, tighter and more compact / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-round interactive proofs for delegating computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210171 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Universal circuits (Preliminary Report) / rank
 
Normal rank

Latest revision as of 10:17, 21 August 2024

scientific article; zbMATH DE number 7773992
Language Label Description Also known as
English
Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions
scientific article; zbMATH DE number 7773992

    Statements

    Speed-stacking: fast sublinear zero-knowledge proofs for disjunctions (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    8 December 2023
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references