Pages that link to "Item:Q1648848"
From MaRDI portal
The following pages link to Two-round multiparty secure computation from minimal assumptions (Q1648848):
Displaying 50 items.
- Two-round multiparty secure computation minimizing public key operations (Q775971) (← links)
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- A new approach to round-optimal secure multiparty computation (Q1675737) (← links)
- Two-message witness indistinguishability and secure computation in the plain model from new assumptions (Q1701448) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Combiners for functional encryption, unconditionally (Q2055605) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Efficient and tight oblivious transfer from PKE with tight multi-user security (Q2096634) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- On the round complexity of secure quantum computation (Q2120084) (← links)
- Broadcast-optimal two round MPC with an honest majority (Q2128559) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- On reductions from multi-domain noninterference to the two-level case (Q2165480) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Optimal bounded-collusion secure functional encryption (Q2175911) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← 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)
- Efficient and round-optimal oblivious transfer and commitment with adaptive security (Q2691588) (← links)
- Cryptographic group actions and applications (Q2692390) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Laconic private set intersection and applications (Q2697887) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS (Q5859732) (← links)
- Injective trapdoor functions via derandomization: how strong is Rudich's black-box barrier? (Q5918098) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
- On the enumeration of minimal non-pairwise compatibility graphs (Q5918254) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Multi-theorem preprocessing NIZKs from lattices (Q5918862) (← links)
- Minicrypt primitives with algebraic structure and applications (Q5925579) (← links)
- Minimizing setup in broadcast-optimal two round MPC (Q6061355) (← links)
- Beyond honest majority: the round complexity of fair and robust multi-party computation (Q6109085) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
