Pages that link to "Item:Q5746333"
From MaRDI portal
The following pages link to Two-Round Secure MPC from Indistinguishability Obfuscation (Q5746333):
Displaying 50 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- A simple construction of iO for Turing machines (Q1631340) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- On constructing one-way permutations from indistinguishability obfuscation (Q2413613) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Towards efficiency-preserving round compression in MPC. Do fewer rounds mean more computation? (Q2691585) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- How to Avoid Obfuscation Using Witness PRFs (Q2799104) (← links)
- On Constructing One-Way Permutations from Indistinguishability Obfuscation (Q2799107) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- How to Generate and Use Universal Samplers (Q2953794) (← links)
- Limits on the Power of Indistinguishability Obfuscation and Functional Encryption (Q3179266) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation (Q5261693) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- On Removing Graded Encodings from Functional Encryption (Q5738968) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- One-Way Functions and (Im)perfect Obfuscation (Q5885583) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Candidate iO from homomorphic encryption schemes (Q6109075) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
- mrNISC from LWE with polynomial modulus (Q6134835) (← links)
- Collusion-resistant functional encryption for RAMs (Q6135396) (← 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)
- The final nail in the coffin of statistically-secure obfuscator (Q6161431) (← links)
