Cluster computing in zero knowledge

DOI10.1007/978-3-662-46803-6_13MaRDI QIDQ2948390zbMATH OpenOpenAlexFDO

Authors Alessandro Chiesa, Eran Tromer, Madars Virza

Publication date 30 September 2015

Published in Advances in Cryptology - EUROCRYPT 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46803-6_13

zbMATH Keywords

MapReducezero knowledgecluster computingcomputationally-sound proofsproof-carrying data

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Knowledge representation (68T30) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Scalable zero knowledge via cycles of elliptic curves
• Scalable zero knowledge via cycles of elliptic curves
• Zero-knowledge proofs from secure multiparty computation
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• MPC-in-multi-heads: a multi-prover zero-knowledge proof system (or: how to jointly prove any NP statements in ZK)

Cited in

(11)

• Security bounds for proof-carrying data from straightline extractors
• Protostar: generic efficient accumulation/folding for special-sound protocols
• Proof-carrying data without succinct arguments
• Trinocchio: privacy-preserving outsourcing by distributed verifiable computation
• Proof-carrying data from arithmetized random oracles
• Maliciously secure massively parallel computation for all-but-one corruptions
• Revisiting cycles of pairing-friendly elliptic curves
• Linear-time accumulation schemes
• \textsc{Fractal}: post-quantum and transparent recursive proofs from holography
• \textsc{Arc}: accumulation for Reed-Solomon codes
• Scalable zero knowledge via cycles of elliptic curves

This page was built for publication: Cluster computing in zero knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2948390)