Resumable zero-knowledge for circuits from symmetric key primitives
From MaRDI portal
Publication:6108797
DOI10.1007/978-3-031-22301-3_19zbMath1527.94072OpenAlexW4312652232MaRDI QIDQ6108797
Wei Wang, Haiyang Xue, Guoxiao Liu, Puwen Wei, Jinsong Li, Handong Zhang, Yi Deng
Publication date: 26 July 2023
Published in: Information Security and Privacy (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-031-22301-3_19
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- BBQ: using AES in Picnic signatures
- Efficient batch zero-knowledge arguments for low degree polynomials
- Signatures from sequential-OR proofs
- Banquet: short and fast signatures from AES
- Stacking sigmas: a framework to compose \(\varSigma\)-protocols for disjunctions
- Aurora: transparent succinct arguments for R1CS
- Scalable zero knowledge with no trusted setup
- Non-interactive composition of sigma-protocols via Share-then-Hash
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Batch Proofs of Partial Knowledge
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Ciphers for MPC and FHE
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Perfect Non-interactive Zero Knowledge for NP
- Digital Signatures
- Batch ZK Proof and Verification of OR Logic
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- The Knowledge Complexity of Interactive Proof Systems
- Noninteractive Zero-Knowledge
- Multiple NonInteractive Zero Knowledge Proofs Under General Assumptions
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography
- On the Size of Pairing-Based Non-interactive Arguments
- Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting
This page was built for publication: Resumable zero-knowledge for circuits from symmetric key primitives
