Multi-clients verifiable computation via conditional disclosure of secrets

DOI10.1007/978-3-030-57990-6_8MaRDI QIDQ2106638zbMATH OpenOpenAlexFDO

Authors Rishabh Bhadauria, Carmit Hazay

Publication date 16 December 2022

Full work available at URL https://doi.org/10.1007/978-3-030-57990-6_8

zbMATH Keywords

non-interactive constant-rate protocolstwo-party conditional disclosure of secrets

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• Multi-client non-interactive verifiable computation
• Multi-client verifiable computation with stronger security guarantees
• Non-interactive verifiable computing: outsourcing computation to untrusted workers
• Multi-client outsourced computation

Cited in

(5)

• Specifying and verifying secrecy in workflows with arbitrarily many agents
• Efficient oblivious evaluation protocol and conditional disclosure of secrets for DFA
• Private polynomial commitments and applications to MPC
• MPClan: protocol suite for privacy-conscious computations
• Verification protocol for stable matching from conditional disclosure of secrets

This page was built for publication: Multi-clients verifiable computation via conditional disclosure of secrets

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