Perfect MPC over layered graphs

DOI10.1007/978-3-031-38557-5_12MaRDI QIDQ6186597

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

Publication date: 2 February 2024

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

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The sleepy model of consensus
• Adaptive versus non-adaptive security of multi-party protocols
• Player simulation and general adversary structures in perfect multiparty computation
• Security and composition of multiparty cryptographic protocols
• Can a public blockchain keep a secret?
• Asynchronous Byzantine agreement with subquadratic communication
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles
• Fluid MPC: secure multiparty computation with dynamic participants
• Round-optimal Byzantine agreement
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Algorand: a secure and efficient distributed ledger
• Secure multi-party computation made simple
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups
• Secure Multiparty Computation with General Interaction Patterns
• Efficient player-optimal protocols for strong and differential consensus
• Information-Theoretically Secure Protocols and Security under Composition
• Simplified Threshold RSA with Adaptive and Proactive Security
• Foundations of Cryptography
• Storing and Retrieving Secrets on a Blockchain
• The round complexity of verifiable secret sharing and secure multicast
• How to withstand mobile virus attacks (extended abstract)
• Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
• Secure Multiparty Computation and Secret Sharing
• On Expected Constant-Round Protocols for Byzantine Agreement
• SCALES. MPC with small clients and larger ephemeral servers

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