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

DOI10.1007/978-3-030-03326-2_20zbMath1446.94108OpenAlexW2811026317MaRDI QIDQ1633476

Mary Maller, Jens Groth, Andrea Cerulli, Jonathan Bootle, Sune Kristian Jakobsen

Publication date: 20 December 2018

Full work available at URL: https://discovery.ucl.ac.uk/id/eprint/10063978/

zbMATH Keywords

zero-knowledge proofspost-quantum securityideal linear commitmentssuccinct arguments of knowledgeTinyRAM

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25)

Related Items (6)

Gemini: elastic SNARKs for diverse environments ⋮ Rinocchio: SNARKs for ring arithmetic ⋮ Obtaining simulation extractable NIZKs in the updatable CRS model generically ⋮ Efficient proof of RAM programs from any public-coin zero-knowledge system ⋮ Boosting verifiable computation on encrypted data ⋮ Arya

Uses Software

• SNARKs for C
• Ligero
• ZKBoo
• vSQL
• vRAM

This page was built for publication: Arya: nearly linear-time zero-knowledge proofs for correct program execution