Universally Composable Synchronous Computation

DOI10.1007/978-3-642-36594-2_27zbMath1316.68051OpenAlexW165274269MaRDI QIDQ4910294

Björn Tackmann, Ueli M. Maurer, Vassilis Zikas, Jonathan N. Katz

Publication date: 18 March 2013

Published in: Theory of Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36594-2_27

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Network protocols (68M12)

Related Items

YOSO: You only speak once. Secure MPC with stateless ephemeral roles, Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security, A Simpler Variant of Universally Composable Security for Standard Multiparty Computation, PoW-Based Distributed Cryptography with No Trusted Setup, Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting, Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols, Universally Composable Firewall Architectures Using Trusted Hardware, Correction to: ``Topology-hiding communication from minimal assumptions, CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime, Efficient and universally composable single secret leader election from pairings, A universally composable PAKE with zero communication cost. (And why it shouldn't be considered UC-secure), Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions, Formalizing delayed adaptive corruptions and the security of flooding networks, Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries, Astrolabous: a universally composable time-lock encryption scheme, Generalized channels from limited blockchain scripts and adaptor signatures, Revisiting the efficiency of perfectly secure asynchronous multi-party computation against general adversaries, Permissionless clock synchronization with public setup, Categorical composable cryptography: extended version, Endemic oblivious transfer via random oracles, revisited, Categorical composable cryptography, Completeness theorems for adaptively secure broadcast, Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications, MPC with synchronous security and asynchronous responsiveness, Adaptive security of multi-party protocols, revisited, On the communication efficiency of statistically secure asynchronous MPC with optimal resilience, Etherless Ethereum Tokens: simulating native tokens in Ethereum, A universally composable framework for the privacy of email ecosystems, Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era, On the Computational Overhead of MPC with Dishonest Majority, Round-preserving parallel composition of probabilistic-termination cryptographic protocols, Topology-hiding computation for networks with unknown delays, Adaptively secure MPC with sublinear communication complexity, Dynamic ad hoc clock synchronization, TARDIS: a foundation of time-lock puzzles in UC, Probabilistic Termination and Composability of Cryptographic Protocols, Probabilistic termination and composability of cryptographic protocols, Always have a backup plan: fully secure synchronous MPC with asynchronous fallback, Coin-based multi-party fair exchange, P2DEX: privacy-preserving decentralized cryptocurrency exchange, Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era