Non-interactive publicly-verifiable delegation of committed programs (Q6067380): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-031-31371-4_20 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4367666496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct delegation for low-space non-deterministic computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hunting of the SNARK / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recursive composition and bootstrapping for SNARKS and proof-carrying data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct Non-interactive Arguments via Linear Interactive Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multi-collision resistance: a paradigm for keyless hash functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive delegation and batch NP verification from standard computational assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Witness indistinguishability for any single-round argument with applications to access control / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat-Shamir: from practice to theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive batch arguments for NP from standard assumptions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Delegation of Computation Using Fully Homomorphic Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Practical verified computation with streaming interactive proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Secure Two-Party Computation with Low Communication / rank
 
Normal rank
Property / cites work
 
Property / cites work: Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers / 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: Delegating Computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short Pairing-Based Non-interactive Zero-Knowledge Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fiat–Shamir via list-recoverable codes (or: parallel repetition of GMW is not zero-knowledge) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Communication Complexity of Secure Function Evaluation with Long Output / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegating RAM Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to delegate computations publicly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Delegation for bounded space / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to delegate computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Somewhere statistical soundness, post-quantum security, and SNARGs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computationally Sound Proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noninteractive zero knowledge for NP from (Plain) Learning With Errors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant-Round Interactive Proofs for Delegating Computation / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 09:55, 19 August 2024

scientific article; zbMATH DE number 7766994
Language Label Description Also known as
English
Non-interactive publicly-verifiable delegation of committed programs
scientific article; zbMATH DE number 7766994

    Statements

    Non-interactive publicly-verifiable delegation of committed programs (English)
    0 references
    0 references
    0 references
    0 references
    16 November 2023
    0 references
    0 references

    Identifiers