Large message homomorphic secret sharing from DCR and applications

DOI10.1007/978-3-030-84252-9_23zbMATH Open1487.94158OpenAlexW3159942927MaRDI QIDQ2129016FDOQ2129016

Authors: Lawrence Roy, Jaspal Singh 

Publication date: 22 April 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84252-9_23

Recommendations

• Homomorphic secret sharing from lattices without FHE
• Foundations of homomorphic secret sharing
• A geometric approach to homomorphic secret sharing
• Recent advances in function and homomorphic secret sharing (invited talk)
• Two-Server Verifiable Homomorphic Secret Sharing for High-Degree Polynomials

zbMATH Keywords

homomorphic secret sharingdecisional composite residuosityfully-homomorphic encryption

Mathematics Subject Classification ID

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

Cites Work

• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Software protection and simulation on oblivious RAMs
• Homomorphic secret sharing from Paillier encryption
• Breaking the Circuit Size Barrier for Secure Computation Under DDH
• Foundations of Homomorphic Secret Sharing
• Trapdoor hash functions and their applications
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Homomorphic secret sharing from lattices without FHE
• An optimal distributed discrete log protocol with applications to homomorphic secret sharing
• Onion ORAM: A Constant Bandwidth Blowup Oblivious RAM

Cited In (14)

• On homomorphic secret sharing from polynomial-modulus LWE
• 3-party distributed ORAM from oblivious set membership
• Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs
• Sublinear-communication secure multiparty computation does not require FHE
• Sublinear secure computation from new assumptions
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• An algebraic framework for silent preprocessing with trustless setup and active security
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Two-round stateless deterministic two-party Schnorr signatures from pseudorandom correlation functions
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• Efficient and generic methods to achieve active security in private information retrieval and more advanced database search
• Succinct homomorphic secret sharing
• Constrained pseudorandom functions from homomorphic secret sharing
• 10-party sublinear secure computation from standard assumptions

This page was built for publication: Large message homomorphic secret sharing from DCR and applications

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