Rinocchio: SNARKs for ring arithmetic (Q6070447)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7768547

Language	Label	Description	Also known as
English	Rinocchio: SNARKs for ring arithmetic	scientific article; zbMATH DE number 7768547

Statements

scholarly article

0 references

Rinocchio: SNARKs for ring arithmetic (English)

0 references

0 references

0 references

Eduardo Soria-Vazquez

0 references

Journal of Cryptology

0 references

publication date

21 November 2023

0 references

zbMATH Keywords

SNARKs

0 references

homomorphic encryption

0 references

rings

0 references

zero-knowledge

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/s00145-023-09481-3

0 references

Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings

0 references

Non-interactive zero-knowledge proofs for composite statements

0 references

SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge

0 references

Scalable Zero Knowledge via Cycles of Elliptic Curves

0 references

Efficient cryptosystems from \(2^k\)-th power residue symbols

0 references

On Zeros of a Polynomial in a Finite Grid

0 references

Succinct Non-interactive Arguments via Linear Interactive Proofs

0 references

Flexible and efficient verifiable computation on encrypted data

0 references

Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

0 references

Quasi-optimal SNARGs via linear multi-prover interactive proofs

0 references

Arya: nearly linear-time zero-knowledge proofs for correct program execution

0 references

Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages

0 references

On fast multiplication of polynomials over arbitrary algebras

0 references

Mon\(\mathbb{Z}_{2^k}\)a: fast maliciously secure two party computation on \(\mathbb{Z}_{2^k} \)

0 references

Marlin: preprocessing zkSNARKs with universal and updatable SRS

0 references

TFHE: fast fully homomorphic encryption over the torus

0 references

Improved Delegation of Computation Using Fully Homomorphic Encryption

0 references

Circuit amortization friendly encodingsand their application to statistically secure multiparty computation

0 references

Boosting verifiable computation on encrypted data

0 references

Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers

0 references

Quadratic Span Programs and Succinct NIZKs without PCPs

0 references

0 references

Short Pairing-Based Non-interactive Zero-Knowledge Arguments

0 references

On the Size of Pairing-Based Non-interactive Arguments

0 references

Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments

0 references

Succinct Non-Interactive Zero Knowledge Arguments from Span Programs and Linear Error-Correcting Codes

0 references

Public-key cryptosystems from the worst-case shortest vector problem

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/s00145-023-09481-3

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6070447

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q6070447&oldid=37605346"