Fully-succinct publicly verifiable delegation from constant-size assumptions
From MaRDI portal
Publication:2695648
DOI10.1007/978-3-030-90459-3_18OpenAlexW3213104665MaRDI QIDQ2695648
Alexandros Zacharakis, Alonso González
Publication date: 31 March 2023
Full work available at URL: https://doi.org/10.1007/978-3-030-90459-3_18
Related Items (3)
SNARGs for P from sub-exponential DDH and QR ⋮ SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption ⋮ Batch arguments for \textsf{NP} and more from standard bilinear group assumptions
Cites Work
- Unnamed Item
- Unnamed Item
- Structure-preserving signatures and commitments to group elements
- On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments
- Compact NIZKs from standard assumptions on bilinear maps
- Recursive proof composition from accumulation schemes
- Proof-carrying data without succinct arguments
- Somewhere statistically binding commitment schemes with applications
- Shorter pairing-based arguments under standard assumptions
- Shorter quadratic QA-NIZK proofs
- Ring signatures: logarithmic-size, no setup -- from standard assumptions
- Exploring constructions of compact NIZKs from various assumptions
- Cryptography for Parallel RAM from Indistinguishability Obfuscation
- New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators
- QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions
- New Techniques for Non-interactive Shuffle and Range Arguments
- An Algebraic Framework for Diffie-Hellman Assumptions
- Linearly Homomorphic Structure-Preserving Signatures and Their Applications
- Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces
- Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
- Square Span Programs with Applications to Succinct NIZK Arguments
- Indistinguishability Obfuscation for Turing Machines with Unbounded Memory
- Succinct Garbling and Indistinguishability Obfuscation for RAM Programs
- Succinct Randomized Encodings and their Applications
- Quasi-Adaptive NIZK for Linear Subspaces Revisited
- The Kernel Matrix Diffie-Hellman Assumption
- On the Communication Complexity of Secure Function Evaluation with Long Output
- Delegating RAM Computations with Adaptive Soundness and Privacy
- Delegating RAM Computations
- Structure-Preserving Signatures and Commitments to Group Elements
- Perfect Non-interactive Zero Knowledge for NP
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Non-interactive delegation and batch NP verification from standard computational assumptions
- Fiat-Shamir: from practice to theory
- How to delegate computations publicly
- Succinct delegation for low-space non-deterministic computation
- How to delegate computations
- Advances in Cryptology – CRYPTO 2004
- Constant-round interactive proofs for delegating computation
- Separating succinct non-interactive arguments from all falsifiable assumptions
- Efficient Non-interactive Proof Systems for Bilinear Groups
- Delegation for bounded space
- On the Size of Pairing-Based Non-interactive Arguments
This page was built for publication: Fully-succinct publicly verifiable delegation from constant-size assumptions
