Sum it up: verifiable additive homomorphic secret sharing

DOI10.1007/978-3-030-40921-0_7MaRDI QIDQ776347zbMATH OpenOpenAlexFDO

Authors Georgia Tsaloli, Aikaterini Mitrokotsa

Publication date 8 July 2020

Full work available at URL https://www.alexandria.unisg.ch/262278/1/PaperC.pdf

zbMATH Keywords

verifiable computationfunction secret sharinghomomorphic secret sharingpublic verifiability

Mathematics Subject Classification ID

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

Recommendations

• Verifiable homomorphic secret sharing
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• Verifiable computation on outsourced encrypted data
• Achieving privacy in verifiable computation with multiple servers -- without FHE and without pre-processing
• CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case

Cited in

(5)

• Verifiable homomorphic secret sharing
• Practical private computation of vector addition-based functions
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials
• A communication-privacy tradeoff for modular addition
• Multi-key homomorphic secret sharing from LWE without multi-key HE

This page was built for publication: Sum it up: verifiable additive homomorphic secret sharing

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