Cluster Computing in Zero Knowledge

DOI10.1007/978-3-662-46803-6_13zbMath1371.68257OpenAlexW2188776605MaRDI QIDQ2948390

Madars Virza, Alessandro Chiesa, Eran Tromer

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

cluster computingMapReducezero knowledgecomputationally-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)

Related Items (7)

Proof-carrying data without succinct arguments ⋮ Proof-carrying data from arithmetized random oracles ⋮ Scalable zero knowledge via cycles of elliptic curves ⋮ Maliciously secure massively parallel computation for all-but-one corruptions ⋮ Revisiting cycles of pairing-friendly elliptic curves ⋮ \textsc{Fractal}: post-quantum and transparent recursive proofs from holography ⋮ Trinocchio: Privacy-Preserving Outsourcing by Distributed Verifiable Computation

This page was built for publication: Cluster Computing in Zero Knowledge