Perfect MPC over layered graphs

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

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)

Cites Work

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

Cited In (2)

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

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)