Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

DOI10.1007/978-3-030-62974-8_5MaRDI QIDQ6488003zbMATH OpenFDO

Authors Xin Chen, Liang Feng Zhang

Publication date 21 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-62974-8_5

Mathematics Subject Classification ID

Computer security (68M25) Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Verifiable homomorphic secret sharing
• Homomorphic secret sharing for low degree polynomials
• Sum it up: verifiable additive homomorphic secret sharing
• A geometric approach to homomorphic secret sharing
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials

Cited in

(13)

• Verifiable homomorphic secret sharing
• Homomorphic secret sharing for low degree polynomials
• A geometric approach to homomorphic secret sharing
• Large message homomorphic secret sharing from DCR and applications
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Polly Two: a new algebraic polynomial-based public-key scheme
• scientific article; zbMATH DE number 5811700 (Why is no real title available?)
• scientific article; zbMATH DE number 1500489 (Why is no real title available?)
• Encrypted polynomial control based on tailored two‐party computation
• Multi-key homomorphic secret sharing from LWE without multi-key HE
• Homomorphic secret sharing with verifiable evaluation
• Malicious homomorphic secret sharing with applications to DV-NIZK and more
• Sum it up: verifiable additive homomorphic secret sharing

This page was built for publication: Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

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