Rinocchio: SNARKs for ring arithmetic
From MaRDI portal
Publication:6070447
DOI10.1007/s00145-023-09481-3zbMath1527.94039OpenAlexW3157709467MaRDI QIDQ6070447
Eduardo Soria-Vazquez, Anca Nitulescu, Chaya Ganesh
Publication date: 21 November 2023
Published in: Journal of Cryptology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00145-023-09481-3
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Non-interactive zero-knowledge proofs for composite statements
- On fast multiplication of polynomials over arbitrary algebras
- Arya: nearly linear-time zero-knowledge proofs for correct program execution
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Marlin: preprocessing zkSNARKs with universal and updatable SRS
- Boosting verifiable computation on encrypted data
- Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)
- Flexible and efficient verifiable computation on encrypted data
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- TFHE: fast fully homomorphic encryption over the torus
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- (Leveled) fully homomorphic encryption without bootstrapping
- SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
- Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes
- Scalable Zero Knowledge via Cycles of Elliptic Curves
- Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments
- Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
- Short Pairing-Based Non-interactive Zero-Knowledge Arguments
- Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
- Improved Delegation of Computation Using Fully Homomorphic Encryption
- On Zeros of a Polynomial in a Finite Grid
- Succinct Non-interactive Arguments via Linear Interactive Proofs
- Quadratic Span Programs and Succinct NIZKs without PCPs
- Public-key cryptosystems from the worst-case shortest vector problem
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation
- On the Size of Pairing-Based Non-interactive Arguments
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Rinocchio: SNARKs for ring arithmetic
