Perfect MPC over layered graphs

DOI10.1007/978-3-031-38557-5_12MaRDI QIDQ6186597zbMATH OpenFDO

Authors Bernardo David, Giovanni Deligios, Aarushi Goel, Yuval Ishai, Anders Konring, Eyal Kushilevitz, Chen-Da Liu-Zhang, Varun Narayanan

Publication date 2 February 2024

Published in Advances in Cryptology – CRYPTO 2023 (Search for Journal in Brave)

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Graph theory (including graph drawing) in computer science (68R10) Cryptography (94A60)

Recommendations

• Perfectly-Secure MPC with Linear Communication Complexity
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Simple and Efficient Perfectly-Secure Asynchronous MPC
• Perfectly-secure asynchronous MPC for general adversaries (extended abstract)
• Proactive secure multiparty computation with a dishonest majority

Cites work

• scientific article; zbMATH DE number 1304080 (Why is no real title available?)
• scientific article; zbMATH DE number 1031003 (Why is no real title available?)
• scientific article; zbMATH DE number 1406798 (Why is no real title available?)
• Adaptive versus non-adaptive security of multi-party protocols
• Algorand: a secure and efficient distributed ledger
• Asynchronous Byzantine agreement with subquadratic communication
• Can a public blockchain keep a secret?
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Communication-optimal proactive secret sharing for dynamic groups
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Efficient player-optimal protocols for strong and differential consensus
• Fluid MPC: secure multiparty computation with dynamic participants
• Foundations of Cryptography
• General secure multi-party computation from any linear secret-sharing scheme
• How to withstand mobile virus attacks (extended abstract)
• Information-theoretically secure protocols and security under composition
• On Expected Constant-Round Protocols for Byzantine Agreement
• Player simulation and general adversary structures in perfect multiparty computation
• Round-optimal Byzantine agreement
• SCALES. MPC with small clients and larger ephemeral servers
• Secure multi-party computation made simple
• Secure multiparty computation and secret sharing
• Secure multiparty computation with general interaction patterns
• Security and composition of multiparty cryptographic protocols
• Simplified Threshold RSA with Adaptive and Proactive Security
• Storing and retrieving secrets on a blockchain
• The round complexity of verifiable secret sharing and secure multicast
• The sleepy model of consensus
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

Cited in

(2)

• Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
• On information-theoretic secure multiparty computation with local repairability

This page was built for publication: Perfect MPC over layered graphs

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