Universally composable almost-everywhere secure computation

DOI10.1007/S00145-025-09565-2MaRDI QIDQ6868482zbMATH OpenFDO

Authors Nishanth Chandran, Pouyan Forghani, Juan Garay, Rafail Ostrovsky, Rutvik Patel, Vassilis Zikas

Publication date 23 January 2026

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00145-025-09565-2

zbMATH Keywords

sparse graphssecure multi-party computationuniversal composabilitysecure message transmissionalmost-everywhere secure computation

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites work

• scientific article; zbMATH DE number 1302842 (Why is no real title available?)
• A full proof of the BGW protocol for perfectly secure multiparty computation
• Advances in Cryptology – CRYPTO 2004
• Almost-Everywhere Secure Computation
• Almost-everywhere secure computation with edge corruptions
• Asymptotically Optimal Two-Round Perfectly Secure Message Transmission
• Bitcoin as a transaction ledger: a composable treatment
• Breaking the O(√ n)-Bit Barrier
• Complete characterization of adversaries tolerable in secure multi-party computation (extended abstract)
• Efficient constructions for almost-everywhere secure computation
• Efficient perfectly secure message transmission in synchronous networks
• Efficient player-optimal protocols for strong and differential consensus
• From Almost Everywhere to Everywhere: Byzantine Agreement with $\tilde{O}(n^{3/2})$ Bits
• GNUC: a new universal composability framework
• Improved fault tolerance and secure computation on sparse networks
• MPC vs. SFE: Perfect Security in a Unified Corruption Model
• MPC with friends and foes
• Must the communication graph of MPC protocols be an expander?
• Perfectly Secure Message Transmission in Two Rounds
• Perfectly secure message transmission
• Reaching Agreement in the Presence of Faults
• Secure computation without authentication
• Secure message transmission in asynchronous networks
• Security and composition of multiparty cryptographic protocols
• Static vs. adaptive security in perfect MPC: a separation and the adaptive security of BGW
• The Byzantine Generals Problem
• Tolerating linear number of faults in networks of bounded degree
• Truly Efficient 2-Round Perfectly Secure Message Transmission Scheme
• Universal composition with global subroutines: capturing global setup within plain UC
• Universally Composable Security with Global Setup
• Universally composable almost-everywhere secure computation
• Universally composable synchronous computation
• iUC: flexible universal composability made simple

This page was built for publication: Universally composable almost-everywhere secure computation

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