Pages that link to "Item:Q5739221"
From MaRDI portal
The following pages link to Two Round Multiparty Computation via Multi-key FHE (Q5739221):
Displaying 50 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Yet another compiler for active security or: efficient MPC over arbitrary rings (Q1784116) (← 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)
- 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)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← 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)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Privacy preserving multi-party computation delegation for deep learning in cloud computing (Q2198099) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- Toward non-interactive zero-knowledge proofs for NP from LWE (Q2661693) (← links)
- On the exact round complexity of best-of-both-worlds multi-party computation (Q2691581) (← links)
- Secure MPC: laziness leads to GOD (Q2691583) (← links)
- SLAP: simpler, improved private stream aggregation from ring learning with errors (Q2693220) (← links)
- Secure quantum computation with classical communication (Q2695622) (← links)
- Blockchains enable non-interactive MPC (Q2697855) (← links)
- Succinct LWE sampling, random polynomials, and obfuscation (Q2697860) (← links)
- Maliciously circuit-private multi-key FHE and MPC based on LWE (Q2701482) (← links)
- Universal Constructions and Robust Combiners for Indistinguishability Obfuscation and Witness Encryption (Q2829226) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Probabilistic Termination and Composability of Cryptographic Protocols (Q2829949) (← links)
- Lattice-Based Fully Dynamic Multi-key FHE with Short Ciphertexts (Q2835588) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← links)
- Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based (Q2980857) (← links)
- Multi-key FHE from LWE, Revisited (Q3181028) (← links)
- Targeted Homomorphic Attribute-Based Encryption (Q3181032) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Multikey Fully Homomorphic Encryption and Applications (Q4599146) (← links)
- (Q4638057) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- (Q5002694) (← links)
- Homomorphic Encryption (Q5021133) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
- Private Puncturable PRFs from Standard Lattice Assumptions (Q5738885) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Towards Round-Optimal Secure Multiparty Computations: Multikey FHE Without a CRS (Q5859732) (← links)
- On the exact round complexity of secure three-party computation (Q5918099) (← links)
