10-party sublinear secure computation from standard assumptions
type: Item
instance of: scholarly article
title: 10-party sublinear secure computation from standard assumptions
DOI: 10.1007/978-3-031-68400-5_2
author: Geoffroy Couteau
author: Naman Kumar
publication date: 2024-12-13T00:00:00Z
Mathematics Subject Classification ID: 68P25
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94A62
zbMATH DE Number: 7958297
MaRDI profile type: Publication
cites work: An algebraic framework for silent preprocessing with trustless setup and active security
cites work: Pseudorandom generators with long stretch and low locality from random local one-way functions
cites work: Q4638056
cites work: Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE
cites work: Q4279564
cites work: QUAD: A Practical Stream Cipher with Provable Security
cites work: Efficient pseudorandom correlation generators: silent OT extension and more
cites work: Sublinear secure computation from new assumptions
cites work: Sublinear-communication secure multiparty computation does not require FHE
cites work: Function Secret Sharing
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: Homomorphic secret sharing from lattices without FHE
cites work: Constant ciphertext-rate non-committing encryption from standard assumptions
cites work: Batch-OT with optimal rate
cites work: Scooby: improved multi-party homomorphic secret sharing based on FHE
cites work: Q4526995
cites work: Q4231909
cites work: Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
cites work: Secure Two-Party Computation with Low Communication
cites work: Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
cites work: Spooky Encryption and Its Applications
cites work: Trapdoor hash functions and their applications
cites work: A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
cites work: Fully homomorphic encryption using ideal lattices
cites work: Distributed Point Functions and Their Applications
cites work: Q3803032
cites work: Communication preserving protocols for secure function evaluation
cites work: The rise of Paillier: homomorphic secret sharing and public-key silent OT
cites work: Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
cites work: Large message homomorphic secret sharing from DCR and applications
description: scientific article; zbMATH DE number 7958297