Scooby: improved multi-party homomorphic secret sharing based on FHE
From MaRDI portal
Publication:6204164
DOI10.1016/j.ic.2023.105133MaRDI QIDQ6204164
Emmanuela Orsini, Peter Scholl, Ilaria Chillotti, Barry Van Leeuwen
Publication date: 27 March 2024
Published in: Information and Computation (Search for Journal in Brave)
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)
Cites Work
- The rise of Paillier: homomorphic secret sharing and public-key silent OT
- Actively secure setup for SPDZ
- Large message homomorphic secret sharing from DCR and applications
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Homomorphic secret sharing from lattices without FHE
- TFHE: fast fully homomorphic encryption over the torus
- Efficient pseudorandom correlation generators: silent OT extension and more
- Bootstrapping for helib
- (Leveled) fully homomorphic encryption without bootstrapping
- 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
- Function Secret Sharing
- Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds
- Lattice-based FHE as secure as PKE
- Number-theoretic constructions of efficient pseudo-random functions
- Multi-identity and Multi-key Leveled FHE from Learning with Errors
- Foundations of Homomorphic Secret Sharing
- Distributed Point Functions and Their Applications
- Two Round Multiparty Computation via Multi-key FHE
This page was built for publication: Scooby: improved multi-party homomorphic secret sharing based on FHE
