Rinocchio: SNARKs for Ring Arithmetic

No abstract is available for this paper.

• Publication year

  2023

• Venue

  Journal of Cryptology

• Publication date

  2023-10-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1007/s00145-023-09481-3
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices

  2021cited by this paper
• Circuit Amortization Friendly Encodings and their Application to Statistically Secure Multiparty Computation

  2020cited by this paper
• plookup: A simplified polynomial protocol for lookup tables

  2020cited by this paper
• Marlin: Preprocessing zkSNARKs with Universal and Updatable SRS

  2020cited by this paper
• Evaluating the Effectiveness of Heuristic Worst-Case Noise Analysis in FHE

  2020cited by this paper
• Boosting Verifiable Computation on Encrypted Data

  2020influential reference
• Flexible and Efficient Verifiable Computation on Encrypted Data

  2020influential reference
• Sonic: Zero-Knowledge SNARKs from Linear-Size Universal and Updatable Structured Reference Strings

  2019cited by this paper
• Efficient Information-Theoretic Secure Multiparty Computation over ℤ/pk ℤ via Galois Rings

  2019cited by this paper
• Verifiable Computing for Approximate Computation

  2019cited by this paper
• TFHE: Fast Fully Homomorphic Encryption Over the Torus

  2019influential reference
• Lattice-Based Zero-Knowledge SNARGs for Arithmetic Circuits

  2019cited by this paper
• LegoSNARK: Modular Design and Composition of Succinct Zero-Knowledge Proofs

  2019influential reference
• Updatable and Universal Common Reference Strings with Applications to zk-SNARKs

  2018cited by this paper
• Lattice-Based zk-SNARKs from Square Span Programs

  2018cited by this paper
• Quasi-Optimal SNARGs via Linear Multi-Prover Interactive Proofs

  2018influential reference
• xJsnark: A Framework for Efficient Verifiable Computation

  2018cited by this paper
• Non-Interactive Zero-Knowledge Proofs for Composite Statements

  2018cited by this paper
• Nearly Linear-Time Zero-Knowledge Proofs for Correct Program Execution

  2018cited by this paper
• Efficient Cryptosystems From $$\mathbf{2}^{{\varvec{k}}}$$2k-th Power Residue Symbols

  2017cited by this paper
• Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

  2017influential reference
• Cinderella: Turning Shabby X.509 Certificates into Elegant Anonymous Credentials with the Magic of Verifiable Computation

  2016cited by this paper
• On the Size of Pairing-Based Non-interactive Arguments

  2016influential reference
• Geppetto: Versatile Verifiable Computation

  2015cited by this paper
• On Zeros of a Polynomial in a Finite Grid

  2015influential reference
• Succinct Non-Interactive Zero Knowledge for a von Neumann Architecture

  2014cited by this paper
• TRUESET: Faster Verifiable Set Computations

  2014influential reference
• (Leveled) Fully Homomorphic Encryption without Bootstrapping

  2014cited by this paper
• Zerocash: Decentralized Anonymous Payments from Bitcoin

  2014cited by this paper
• Efficiently Verifiable Computation on Encrypted Data

  2014cited by this paper
• Square Span Programs with Applications to Succinct NIZK Arguments

  2014cited by this paper
• Efficient Cryptosystems From 2k-th Power Residue Symbols

  2013cited by this paper
• SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

  2013cited by this paper
• Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

  2013cited by this paper
• Fast reductions from RAMs to delegatable succinct constraint satisfaction problems: extended abstract

  2013cited by this paper
• Succinct Non-Interactive Arguments via Linear Interactive Proofs

  2013cited by this paper
• Verifying computations with state

  2013cited by this paper
• Quadratic Span Programs and Succinct NIZKs without PCPs

  2013influential reference
• How to Run Turing Machines on Encrypted Data

  2013cited by this paper
• Pinocchio: Nearly Practical Verifiable Computation

  2013influential reference
• E cient Cryptosystems From 2 k -th Power Residue Symbols ?

  2013cited by this paper
• From extractable collision resistance to succinct non-interactive arguments of knowledge, and back again

  2012cited by this paper
• Somewhat Practical Fully Homomorphic Encryption

  2012influential reference
• Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

  2012cited by this paper
• Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

  2012cited by this paper
• Separating succinct non-interactive arguments from all falsifiable assumptions

  2011cited by this paper
• Efficient Fully Homomorphic Encryption from (Standard) LWE

  2011cited by this paper
• Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

  2011cited by this paper
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

  2010cited by this paper
• Improved Delegation of Computation using Fully Homomorphic Encryption

  2010cited by this paper
• On Ideal Lattices and Learning with Errors over Rings

  2010cited by this paper
• Short Pairing-Based Non-interactive Zero-Knowledge Arguments

  2010cited by this paper
• Public-key cryptosystems from the worst-case shortest vector problem: extended abstract

  2009cited by this paper
• Delegating computation: interactive proofs for muggles

  2008cited by this paper
• On Round-Efficient Argument Systems

  2005cited by this paper
• On lattices, learning with errors, random linear codes, and cryptography

  2005influential reference
• Lectures on Finite Fields and Galois Rings

  2003cited by this paper
• An Efficient System for Non-transferable Anonymous Credentials with Optional Anonymity Revocation

  2001cited by this paper
• Efficient Group Signature Schemes for Large Groups (Extended Abstract)

  1997cited by this paper
• Inequalities for convex bodies and polar reciprocal lattices inRn

  1995cited by this paper
• CS proofs

  1994cited by this paper
• A note on efficient zero-knowledge proofs and arguments (extended abstract)

  1992cited by this paper
• On fast multiplication of polynomials over arbitrary algebras

  1991influential reference
• Everything Provable is Provable in Zero-Knowledge

  1990cited by this paper
• Public-key cryptosystems provably secure against chosen ciphertext attacks

  1990cited by this paper
• The Knowledge Complexity of Interactive Proof Systems

  1989cited by this paper
• Non-interactive zero-knowledge and its applications

  1988cited by this paper
• Minimum Disclosure Proofs of Knowledge

  1988cited by this paper
• Zero-knowledge proofs of identity

  1987cited by this paper
• How to play ANY mental game

  1987cited by this paper
• The Complexity of Perfect Zero-Knowledge (Extended Abstract)

  1987cited by this paper
• Proofs that yield nothing but their validity and a methodology of cryptographic protocol design

  1986cited by this paper
• A robust and verifiable cryptographically secure election scheme

  1985cited by this paper
• on Lattices.

  year unknowninfluential reference

• Practical SNARGs for Matrix Multiplications over Encrypted Data

  2026cites this paper
• Systematic Review on Verifiable Fully Homomorphic Encryption: Integrity, Proofs and Open Problems

  2026cites this paper
• Linear Secret-shared Shuffle with Malicious Security

  2025influential citation
• A sustainable urban optimization framework driven by a large language model based on multi-party trusted collaboration

  2025cites this paper
• List Decoding of Folded Reed-Solomon Codes Over Galois Ring

  2025cites this paper
• Blind zkSNARKs: for Private Proof Delegation and Verifiable Computation over Encrypted Data

  2025cites this paper
• Polylogarithmic Polynomial Commitment Scheme over Galois Rings

  2025cites this paper
• BATCH: Secure and Efficient Outsourced Batch Computation for Encrypted Numbers

  2025cites this paper
• Revisiting Module Lattice-based Homomorphic Encryption and Application to Secure-MPC

  2025cites this paper
• A new construction of keyed-FHE without zk-SNARK for homomorphic evaluation

  2025cites this paper
• Verifiability for privacy-preserving computing on distributed data — a survey

  2025cites this paper
• Packed Sumcheck over Fields of Small Characteristic with Application to Verifiable FHE

  2025cites this paper
• Practical Zero-Knowledge PIOP for Maliciously Secure Multiparty Homomorphic Encryption

  2025cites this paper
• Fherret: Proof of FHE Correct-and-Honest Evaluation with Circuit Privacy from MPCitH

  2025cites this paper
• On the Security and Privacy of CKKS-based Homomorphic Evaluation Protocols

  2025cites this paper
• HasteBoots: Proving FHE Bootstrapping in Seconds

  2025cites this paper
• Verifiable Computation for Approximate Homomorphic Encryption Schemes

  2025cites this paper
• FHE-SNARK vs. SNARK-FHE: From Analysis to Practical Verifiable Computation

  2025cites this paper
• Cryptanalysis on Lightweight Verifiable Homomorphic Encryption

  2025cites this paper
• Sublinear Proofs over Polynomial Rings

  2025cites this paper
• Zero-Knowledge Proof Frameworks: A Systematic Survey

  2025cites this paper
• Relations among new CCA security notions for approximate FHE

  2025cites this paper
• Towards Verifiable FHE in Practice: Proving Correct Execution of TFHE's Bootstrapping using plonky2

  2025cites this paper
• Practical Zero-Knowledge PIOP for Public Key and Ciphertext Generation in (Multi-Group) Homomorphic Encryption

  2024cites this paper
• Vector Commitments with Proofs of Smallness: Short Range Proofs and More

  2024cites this paper
• Quantum Oblivious LWE Sampling and Insecurity of Standard Model Lattice-Based SNARKs

  2024cites this paper
• Verifiable FHE via Lattice-based SNARKs

  2024cites this paper
• Fully Homomorphic Encryption beyond IND-CCA1 Security: Integrity through Verifiability

  2024influential citation
• SoK: What don't we know? Understanding Security Vulnerabilities in SNARKs

  2024cites this paper
• Secure outsourced decryption for FHE-based privacy-preserving cloud computing

  2024cites this paper
• PEEV: Parse Encrypt Execute Verify—A Verifiable FHE Framework

  2024cites this paper
• What Have SNARGs Ever Done for FHE?

  2024cites this paper
• Fully-Succinct Arguments over the Integers from First Principles

  2024cites this paper
• DataSeal: Ensuring the Verifiability of Private Computation on Encrypted Data

  2024cites this paper
• Verifiable Multi-Agent Multi-Task Assignment

  2024cites this paper
• Verifiable computation over encrypted data via MPC-in-the-head zero-knowledge proofs

  2024cites this paper
• Efficient and Privacy-Preserving Integrity Verification for Federated Learning with TEEs

  2024cites this paper
• VERITAS: Plaintext Encoders for Practical Verifiable Homomorphic Encryption

  2024cites this paper
• Garbled Circuits with 1 Bit per Gate

  2024cites this paper
• Integrity Verifiable Privacy-preserving Federated Learning for Healthcare-IoT

  2024cites this paper
• Cryptanalysis of Symmetric Primitives over Rings and a Key Recovery Attack on Rubato

  2023cites this paper
• Vector Commitments With Short Proofs of Smallness

  2023cites this paper
• PELTA - Shielding Multiparty-FHE against Malicious Adversaries

  2023influential citation
• vr2FHE- Securing FHE from Reaction-based Key Recovery Attacks

  2023cites this paper
• HELIOPOLIS: Verifiable Computation over Homomorphically Encrypted Data from Interactive Oracle Proofs is Practical

  2023influential citation
• THE-V: Verifiable Privacy-Preserving Neural Network via Trusted Homomorphic Execution

  2023cites this paper
• SEVCOD: secure and efficient verifiable computation on outsourced data

  2023cites this paper
• More Efficient Zero-Knowledge Protocols over ℤ2k via Galois Rings

  2023cites this paper
• Verifiable Fully Homomorphic Encryption

  2023influential citation
• Verifiable Privacy-Preserving Computing

  2023cites this paper
• Verifiable encodings in multigroup fully homomorphic encryption

  2023cites this paper
• Blockchain-based Trustless Fair Payment Protocol for Verifiable Confidential Outsourcing Computation

  2023cites this paper
• Improved SNARK Frontend for Highly Repetitive Computations

  2023cites this paper
• Privacy-Preserving Large Language Models (PPLLMs)

  2023cites this paper
• Practical and Efficient FHE-based MPC

  2023cites this paper
• vFHE: Verifiable Fully Homomorphic Encryption with Blind Hash

  2023cites this paper
• Poster: Verifiable Encodings for Maliciously-Secure Homomorphic Encryption Evaluation

  2023cites this paper
• Survey on Fully Homomorphic Encryption, Theory, and Applications

  2022cites this paper
• Verifiable Encodings for Secure Homomorphic Analytics

  2022influential citation
• Moz Z 2 k arella: Efficient Vector-OLE and Zero-Knowledge Proofs Over Z 2 k

  2022cites this paper
• Doubly Efficient Interactive Proofs over Infinite and Non-Commutative Rings

  2022cites this paper
• Vector Commitments over Rings and Compressed Σ-Protocols

  2022cites this paper
• Lower Bound on SNARGs in the Random Oracle Model

  2022cites this paper
• Practical Integrity Protection for Private Computations

  2022cites this paper
• Succinct Non-interactive Arguments of Knowledge from Supersingular Isogenies

  2022cites this paper
• MyOPE: Malicious securitY for Oblivious Polynomial Evaluation

  2021cites this paper
• Shorter and Faster Post-Quantum Designated-Verifier zkSNARKs from Lattices

  2021cites this paper
• Subtractive Sets over Cyclotomic Rings: Limits of Schnorr-like Arguments over Lattices

  2021cites this paper
• Privacy-Preserving Large Language Models

  year unknowncites this paper
• Privacy-Preserving Large Language Models

  year unknowncites this paper
• Fully Homomorphic Encryption with Efficient Public Verification

  year unknowncites this paper
• This paper is included in the Proceedings of the 33rd USENIX Security Symposium.

  year unknowncites this paper
• Zero-Knowledge Proof Frameworks: A Survey

  year unknowncites this paper
• Fast and Designated-verifier Friendly zkSNARKs in the BPK Model

  year unknowncites this paper
• Verifiable and Privacy-Preserving Computation via FHE, MPC, and ZKP

  year unknowncites this paper
• Towards Verifiable FHE in Practice Proving Correct Execution of TFHE’s Bootstrapping using plonky2

  year unknowncites this paper