Pages that link to "Item:Q3596372"
From MaRDI portal
The following pages link to Universally Composable Security with Global Setup (Q3596372):
Displaying 31 items.
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
- A Universally Composable Group Key Exchange Protocol with Minimum Communication Effort (Q3540059) (← links)
- Universally Composable Adaptive Oblivious Transfer (Q3600373) (← links)
- A note on the feasibility of generalised universal composability (Q3616225) (← links)
- How to Build a Hash Function from Any Collision-Resistant Function (Q5387097) (← links)
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware (Q5458612) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Removing Erasures with Explainable Hash Proof Systems (Q5738786) (← links)
- Formal Abstractions for Attested Execution Secure Processors (Q5738880) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← 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)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Astrolabous: a universally composable time-lock encryption scheme (Q6157525) (← links)
- Generalized channels from limited blockchain scripts and adaptor signatures (Q6157536) (← links)
- Giving an adversary guarantees (or: how to model designated verifier signatures in a composable framework) (Q6157549) (← links)
- Algebraic adversaries in the universal composability framework (Q6157553) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Universally composable \(\varSigma \)-protocols in the global random-oracle model (Q6169354) (← links)
- (Public) verifiability for composable protocols without adaptivity or zero-knowledge (Q6173120) (← links)
- GUC-secure commitments via random oracles: new impossibility and feasibility (Q6175972) (← links)
- Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model (Q6488035) (← links)
- Bitcoin as a Transaction Ledger: A Composable Treatment (Q6489334) (← links)
- Enabling scalable and unlinkable payment channel hubs with oblivious puzzle transfer (Q6496183) (← links)
- On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
- Eagle: efficient privacy preserving smart contracts (Q6573970) (← links)
- Taming adaptivity in YOSO protocols: the modular way (Q6582166) (← links)
- Composable long-term security with rewinding (Q6587965) (← links)
- Practically efficient private set intersection from trusted hardware with side-channels (Q6604877) (← links)
- Chosen-ciphertext secure dual-receiver encryption in the standard model based on post-quantum assumptions (Q6635899) (← links)
