Scooby: improved multi-party homomorphic secret sharing based on FHE

DOI10.1007/978-3-031-14791-3_24zbMATH Open1518.94111OpenAlexW4294698891MaRDI QIDQ6134842FDOQ6134842

Authors: Ilaria Chillotti, Emmanuela Orsini, Peter Scholl, N. P. Smart, Barry Van Leeuwen 

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://lirias.kuleuven.be/handle/20.500.12942/709840

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)
• Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials

zbMATH Keywords

homomorphic encryption with decryption to shares

Mathematics Subject Classification ID

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

Cites Work

• TFHE: fast fully homomorphic encryption over the torus
• (Leveled) fully homomorphic encryption without bootstrapping
• Number-theoretic constructions of efficient pseudo-random functions
• Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
• Title not available (Why is that?)
• Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
• Spooky Encryption and Its Applications
• Breaking the circuit size barrier for secure computation under DDH
• Function secret sharing
• Multi-identity and multi-key leveled FHE from learning with errors
• Foundations of homomorphic secret sharing
• Two round multiparty computation via multi-key FHE
• Distributed Point Functions and Their Applications
• Faster fully homomorphic encryption: bootstrapping in less than 0.1 seconds
• Lattice-based FHE as secure as PKE
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• Compressible FHE with applications to PIR
• Homomorphic secret sharing from lattices without FHE
• Efficient pseudorandom correlation generators: silent OT extension and more
• Actively secure setup for SPDZ
• Large message homomorphic secret sharing from DCR and applications
• Bootstrapping for helib
• An algebraic framework for silent preprocessing with trustless setup and active security

Cited In (4)

• On homomorphic secret sharing from polynomial-modulus LWE
• Sublinear-communication secure multiparty computation does not require FHE
• Scooby: improved multi-party homomorphic secret sharing based on FHE
• 10-party sublinear secure computation from standard assumptions

This page was built for publication: Scooby: improved multi-party homomorphic secret sharing based on FHE

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