Universally composable synchronous computation
From MaRDI portal
Recommendations
Cited in
(74)- Universally serializable computation
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security
- A universally composable framework for the privacy of email ecosystems
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols
- Topology-hiding computation for networks with unknown delays
- Dynamic ad hoc clock synchronization
- TARDIS: a foundation of time-lock puzzles in UC
- 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
- Synchronous constructive cryptography
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era
- Probabilistic termination and composability of cryptographic protocols
- 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
- Synchronous universally composable computer networks
- Probabilistic Termination and Composability of Cryptographic Protocols
- Universally composable firewall architectures using trusted hardware
- Constant-round asynchronous multi-party computation based on one-way functions
- 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
- Universally Composable Simultaneous Broadcast
- Concurrent general composition of secure protocols in the timing model
- On the computational overhead of MPC with dishonest majority
- Adaptively secure MPC with sublinear communication complexity
- 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)
- 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
- Bitcoin as a Transaction Ledger: A Composable Treatment
- Lightweight asynchronous verifiable secret sharing with optimal resilience
- Eagle: efficient privacy preserving smart contracts
- State machines across isomorphic layer 2 ledgers
- Taming adaptivity in YOSO protocols: the modular way
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited
- Simplex consensus: a simple and fast consensus protocol
- Ordering transactions with bounded unfairness: definitions, complexity and constructions
- Proof-of-work-based consensus in expected-constant time
- Secure multiparty computation with identifiable abort via vindicating release
- Linear-communication asynchronous complete secret sharing with optimal resilience
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs
- CaSCaDE: (time-based) Cryptography from Space Communications DElay
- Universally composable transaction order fairness: refined definitions and adaptive security
- State machine replication among strangers, fast and self-sufficient
- Universally composable almost-everywhere secure computation
- Peeking into the future: MPC resilient to super-rushing adversaries
- Proofs of sequential communication delays from physical assumptions and their applications
- Statistical layered MPC
- Adaptive security, erasures, and network assumptions in communication-local MPC
- General adversary structures in Byzantine agreement and multi-party computation with active and omission corruption
- The bitcoin backbone protocol: analysis and applications
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols
- Is it even possible? On the parallel composition of asynchronous MPC protocols
- An unstoppable ideal functionality for signatures and a modular analysis of the Dolev-Strong broadcast
- Fast and efficient perfectly secure network-agnostic secure computation
- Information-theoretic network-agnostic MPC with polynomial communication
- Perfectly secure network-agnostic MPC comes for free
This page was built for publication: Universally composable synchronous computation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4910294)
