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

DOI10.1007/978-3-031-14791-3_24MaRDI QIDQ6134842zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

homomorphic encryption with decryption to shares

Mathematics Subject Classification ID

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

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

Cites work

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

Cited in

(4)

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

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)