Pages that link to "Item:Q5261691"
From MaRDI portal
The following pages link to Adaptively Secure Two-Party Computation from Indistinguishability Obfuscation (Q5261691):
Displaying 21 items.
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Incentive-driven attacker for corrupting two-party protocols (Q1626274) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← 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)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Deniable Attribute Based Encryption for Branching Programs from LWE (Q3181031) (← links)
- Equivocating Yao: Constant-Round Adaptively Secure Multiparty Computation in the Plain Model (Q5026392) (← links)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation (Q5261693) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- One-Sided Adaptively Secure Two-Party Computation (Q5746345) (← links)
- Adaptively secure MPC with sublinear communication complexity (Q5925696) (← links)
- How to obfuscate MPC inputs (Q6114268) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← links)
- Two-round adaptively secure MPC from isogenies, LPN, or CDH (Q6157520) (← links)
