A note on low-communication secure multiparty computation via circuit depth-reduction

DOI10.1007/978-3-031-78023-3_6MaRDI QIDQ6955269zbMATH OpenFDO

Authors Pierre Charbit, Geoffroy Couteau, Pierre-Jean Meyer, Reza Naserasr

Publication date 23 July 2025

Full work available at URL https://doi.org/10.1007/978-3-031-78023-3_6

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Networks and circuits as models of computation; circuit complexity (68Q06) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Communication complexity, information complexity (68Q11) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• (Leveled) fully homomorphic encryption without bootstrapping
• k-Degenerate Graphs
• A feedback vertex set of 2-degenerate graphs
• A note on the communication complexity of multiparty computation in the correlated randomness model
• An algebraic framework for silent preprocessing with trustless setup and active security
• Breaking the circuit size barrier for secure computation under DDH
• Breaking the circuit size barrier for secure computation under quasi-polynomial LPN
• Collision resistant hashing from sub-exponential learning parity with noise
• DAG reversal is NP-complete
• Depth-robust graphs and their cumulative memory complexity
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Efficiently computing data-independent memory-hard functions
• Financial cryptography and data security. FC 2013 workshops, USEC and WAHC 2013, Okinawa, Japan, April 1, 2013. Revised selected papers
• Fully homomorphic encryption using ideal lattices
• Homomorphic secret sharing from lattices without FHE
• Homomorphic secret sharing from Paillier encryption
• scientific article; zbMATH DE number 176564 (Why is no real title available?)
• scientific article; zbMATH DE number 3597878 (Why is no real title available?)
• scientific article; zbMATH DE number 503242 (Why is no real title available?)
• Large message homomorphic secret sharing from DCR and applications
• Minimizing the number of bootstrappings in fully homomorphic encryption
• Minimum \(k\)-path vertex cover
• Multi-party homomorphic secret sharing and sublinear MPC from sparse LPN
• Multiparty computation with low communication, computation and interaction via threshold FHE
• On chromatic number of graphs and set-systems
• On the Cryptographic Complexity of the Worst Functions
• On the power of correlated randomness in secure computation
• Optimization of bootstrapping in circuits
• Planar orientations with low out-degree and compaction of adjacency matrices
• Secure two-party computation with low communication
• Sublinear secure computation from new assumptions
• Sublinear-communication secure multiparty computation does not require FHE
• Succinct homomorphic secret sharing
• The rise of Paillier: homomorphic secret sharing and public-key silent OT
• The size and depth of layered Boolean circuits
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited

Cited in

(2)

• Silent circuit relinearisation: sublinear-size (Boolean and arithmetic) garbled circuits from DCR
• A randomized rounding approach for DAG edge deletion

This page was built for publication: A note on low-communication secure multiparty computation via circuit depth-reduction

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