Pages that link to "Item:Q2894425"
From MaRDI portal
The following pages link to Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE (Q2894425):
Displaying 50 items.
- On the existence of provably secure cloud computing systems (Q309152) (← links)
- A homomorphic encryption scheme with adaptive chosen ciphertext security but without random oracle (Q897888) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Topology-hiding computation beyond semi-honest adversaries (Q1631311) (← links)
- Perennial secure multi-party computation of universal Turing machine (Q1737594) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Actively secure setup for SPDZ (Q2072211) (← links)
- Reverse firewalls for actively secure MPCs (Q2096547) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- YOSO: You only speak once. Secure MPC with stateless ephemeral roles (Q2128556) (← links)
- On the round complexity of black-box secure MPC (Q2128561) (← links)
- A complete characterization of game-theoretically fair, multi-party coin toss (Q2169995) (← links)
- Round-optimal black-box protocol compilers (Q2170000) (← links)
- Asymptotically quasi-optimal cryptography (Q2170004) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Efficient, actively secure MPC with a dishonest majority: a survey (Q2232208) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Secure cloud computing based on threshold homomorphic encryption (Q2405865) (← links)
- Analysis of Gong et al.'s CCA2-secure homomorphic encryption (Q2629237) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Incremental symmetric puncturable encryption with support for unbounded number of punctures (Q2697484) (← links)
- An efficient threshold access-structure for RLWE-based multiparty homomorphic encryption (Q2697678) (← links)
- On communication models and best-achievable security in two-round MPC (Q2697851) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Updatable public key encryption in the standard model (Q2697895) (← links)
- Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing (Q2827715) (← links)
- The Feasibility of Outsourced Database Search in the Plain Model (Q2827726) (← links)
- Quantum Homomorphic Encryption for Polynomial-Sized Circuits (Q2829941) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
- Size-Hiding Computation for Multiple Parties (Q2953801) (← links)
- Efficient Secure Multiparty Computation with Identifiable Abort (Q3179367) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- Improved Multiplication Triple Generation over Rings via RLWE-Based AHE (Q3297630) (← links)
- Secure Computation with Minimal Interaction, Revisited (Q3457074) (← links)
- Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs (Q3457093) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
