Pages that link to "Item:Q4910294"
From MaRDI portal
The following pages link to Universally Composable Synchronous Computation (Q4910294):
Displaying 48 items.
- Universally serializable computation (Q1384538) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- A universally composable framework for the privacy of email ecosystems (Q1710670) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Coin-based multi-party fair exchange (Q2117033) (← links)
- P2DEX: privacy-preserving decentralized cryptocurrency exchange (Q2117034) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- Guaranteed output in \(O(\sqrt{n})\) rounds for round-robin sampling protocols (Q2170001) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On the communication efficiency of statistically secure asynchronous MPC with optimal resilience (Q2697681) (← links)
- Etherless Ethereum Tokens: simulating native tokens in Ethereum (Q2698288) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Universally Composable Firewall Architectures Using Trusted Hardware (Q2947101) (← links)
- Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions (Q2953803) (← links)
- A Simpler Variant of Universally Composable Security for Standard Multiparty Computation (Q3457057) (← links)
- PoW-Based Distributed Cryptography with No Trusted Setup (Q3457075) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- On the Computational Overhead of MPC with Dishonest Majority (Q5738762) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Correction to: ``Topology-hiding communication from minimal assumptions'' (Q6054730) (← links)
- CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime (Q6070771) (← links)
- Formalizing delayed adaptive corruptions and the security of flooding networks (Q6104341) (← links)
- Revisiting the efficiency of asynchronous MPC with optimal resilience against general adversaries (Q6110376) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Generalized channels from limited blockchain scripts and adaptor signatures (Q6157536) (← links)
- Permissionless clock synchronization with public setup (Q6169555) (← links)
- Categorical composable cryptography: extended version (Q6178713) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Lightweight asynchronous verifiable secret sharing with optimal resilience (Q6570529) (← links)
- Eagle: efficient privacy preserving smart contracts (Q6573970) (← links)
- State machines across isomorphic layer 2 ledgers (Q6573991) (← links)
- Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
- Concurrent asynchronous Byzantine agreement in expected-constant rounds, revisited (Q6587962) (← links)
- Simplex consensus: a simple and fast consensus protocol (Q6587963) (← links)
- Ordering transactions with bounded unfairness: definitions, complexity and constructions (Q6637324) (← links)
- Proof-of-work-based consensus in expected-constant time (Q6637326) (← links)
- Secure multiparty computation with identifiable abort via vindicating release (Q6653023) (← links)
- Linear-communication asynchronous complete secret sharing with optimal resilience (Q6653035) (← links)
- Cheater identification on a budget: MPC with identifiable abort from pairwise MACs (Q6653036) (← links)
- CaSCaDE: (time-based) Cryptography from Space Communications DElay (Q6660393) (← links)
