Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials

DOI10.1007/978-3-030-65277-7_34zbMath1492.94192OpenAlexW3111147403MaRDI QIDQ2152064

Nuttapong Attrapadung, Vorapong Suppakitpaisarn, Kanta Matsuura, Kittiphop Phalakarn

Publication date: 6 July 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-65277-7_34

zbMATH Keywords

homomorphic encryptionhomomorphic secret sharingthreshold non-access structure

Mathematics Subject Classification ID

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

Related Items (3)

Evolving homomorphic secret sharing for hierarchical access structures ⋮ Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials ⋮ A geometric approach to homomorphic secret sharing

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On \(d\)-multiplicative secret sharing
• Probabilistic encryption
• Homomorphic secret sharing for low degree polynomials
• Recent advances in function and homomorphic secret sharing (invited talk)
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• Spooky Encryption and Its Applications
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Non-Interactive Secure Multiparty Computation
• Function Secret Sharing
• How to share a secret
• Fully Homomorphic Encryption over the Integers
• Converting Pairing-Based Cryptosystems from Composite-Order Groups to Prime-Order Groups
• A public key cryptosystem and a signature scheme based on discrete logarithms
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Simultaneous messages vs. communication
• Foundations of Homomorphic Secret Sharing
• Fully homomorphic encryption using ideal lattices
• On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Theory of Cryptography

This page was built for publication: Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials