Pages that link to "Item:Q5261692"
From MaRDI portal
The following pages link to Adaptively Secure, Universally Composable, Multiparty Computation in Constant Rounds (Q5261692):
Displaying 27 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Communication-efficient (proactive) secure computation for dynamic general adversary structures and dynamic groups (Q2106634) (← links)
- Deniable fully homomorphic encryption from learning with errors (Q2128579) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- Leakage resilience from program obfuscation (Q2318088) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- (Q4228521) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma (Q5261632) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- Constant-round linear-broadcast secure computation with penalties (Q6041674) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
