Skip to main content

Advanced Search

Projected result for your current search: 0

Search Operators:

You can use operators in your search query to narrow down your results even more. Click on the search operator to see an explanation of how it works.
Finds documents with exactly this word group, in exactly this word order and spelling (e.g. "employer branding").
Finds documents with both search terms (e.g. sales AND bonus).
Finds documents with one or the other search term (e.g. porsche OR volkswagen).
Finds documents with all search terms. Blank space is understood as AND (e.g. man robot production).
Finds documents with no appearance of the word behind NOT (e.g. ford NOT "harrison ford").
Finds documents where the search term is mentioned at least "n" times."n" may be any number (e.g. COUNT(gear)>8).
Finds documents with both search terms in any word order, permitting "n" words as a maximum distance between them. Best choose between 15 and 30 (e.g. NEAR(recruit, professionals, 20)).
Finds documents with the search term in word versions or composites. The asterisk * marks whether you wish them BEFORE, BEHIND, or BEFORE and BEHIND the search term (e.g. lightweight*, *lightweight, *lightweight*).
Finds documents with the search term in different spellings. "?" allows only one character (e.g. organi?ation).
Special characters are understood as AND (e.g. Miller Bros. & Sons).

Semantic Search

powered by (Link opens in a new window)
loading …
Log in
Top

Information-Theoretic Broadcast-Optimal MPC

  • 2026
  • OriginalPaper
  • Chapter
Published in:
Authors
Michele Ciampi
Ivan Damgárd
Divya Ravi
Luisa Siniscalchi
Sophia Yakoubov
Published in
Theory of Cryptography
Publisher
Springer Nature Switzerland

Activate our intelligent search to find suitable subject content or patents.

search-config
loading …

Abstract

This chapter delves into the critical aspect of broadcast usage in secure multi-party computation (MPC) protocols, particularly focusing on information-theoretic MPC with optimal resilience. The study determines which of the four rounds necessary for information-theoretic MPC truly require broadcast, aiming to design more efficient protocols. Key contributions include proving that the four-round protocol of Applebaum, Kachlon, and Patra remains secure even without broadcast in the last round, while demonstrating the necessity of broadcast in the second and third rounds for secure protocols. The research also explores the broadcast complexity of verifiable secret sharing (VSS), showing that broadcast is necessary in the second and third rounds of the sharing phase. The chapter provides a detailed analysis of the broadcast patterns and security thresholds, summarizing the results for both VSS and MPC. Through a series of thought experiments and adversarial strategies, the study illustrates the impossibility of secure protocols without broadcast in specific rounds, offering a deeper understanding of the trade-offs involved in designing broadcast-optimal MPC protocols.
AI Generated

This summary of the content was generated with the help of AI.

M. Ciampi—Partially supported by the Input Output Research Hub (IORH) of the University of Edinburgh and by Sunday Group Inc.
D. Ravi—Funded by the gravitation project Challenges in Cyber Security (CiCS) with file number 024.006.037, financed by the Dutch Research Council (NWO).

Already a customer? Then log in here to gain access.

Customer login

Dont have a licence yet? Then find out more about our products and how to get one now:

Springer Professional "Business + Economics & Engineering + Technology"

Online-Abonnement

Springer Professional "Business + Economics & Engineering + Technology" gives you access to:

  • more than 130.000 books
  • more than 540 journals

from the following subject areas:

  • Automotive
  • Construction + Real Estate
  • Business IT + Informatics
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Mechanical Engineering + Materials
  • Surfaces + Materials Technology
  • Insurance + Risk


Secure your knowledge advantage now!

inform now

Springer Professional "Engineering + Technology"

Online-Abonnement

Springer Professional "Engineering + Technology" gives you access to:

  • more than 75.000 books
  • more than 390 journals

from the following specialised fileds:

  • Automotive
  • Business IT + Informatics
  • Construction + Real Estate
  • Electrical Engineering + Electronics
  • Energy + Sustainability
  • Mechanical Engineering + Materials
  • Surfaces + Materials Technology





 

Secure your knowledge advantage now!

inform now

Springer Professional "Business + Economics"

Online-Abonnement

Springer Professional "Business + Economics" gives you access to:

  • more than 100.000 books
  • more than 340 journals

from the following specialised fileds:

  • Construction + Real Estate
  • Business IT + Informatics
  • Finance + Banking
  • Management + Leadership
  • Marketing + Sales
  • Insurance + Risk



Secure your knowledge advantage now!

inform now

For explorers: Get to know our platforms better with a free registration.

Register for free
previous chapter On Achieving “Best-in-the-Multiverse” MPC
next chapter Vive Galois! Part 1: Optimal SIMD Packing and Packed Bootstrapping for FHE
Title
Information-Theoretic Broadcast-Optimal MPC
Authors
Michele Ciampi
Ivan Damgárd
Divya Ravi
Luisa Siniscalchi
Sophia Yakoubov
Copyright Year
2026
Book
Theory of Cryptography

Print ISBN: 978-3-032-12286-5

Electronic ISBN: 978-3-032-12287-2

Copyright Year: 2026

DOI
https://doi.org/10.1007/978-3-032-12287-2_6
This content is only visible if you are logged in and have the appropriate permissions.
This content is only visible if you are logged in and have the appropriate permissions.

Premium Partner

    Image Credits
    Neuer Inhalt/© ITandMEDIA, Nagarro GmbH/© Nagarro GmbH, AvePoint Deutschland GmbH/© AvePoint Deutschland GmbH, AFB Gemeinnützige GmbH/© AFB Gemeinnützige GmbH, USU GmbH/© USU GmbH, Ferrari electronic AG/© Ferrari electronic AG