Pages that link to "Item:Q2829944"
From MaRDI portal
The following pages link to Spooky Encryption and Its Applications (Q2829944):
Displaying 40 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Succinct spooky free compilers are not black box sound (Q1701441) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Delegation with updatable unambiguous proofs and PPAD-hardness (Q2104236) (← links)
- Broadcast-optimal two-round MPC (Q2119034) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- Round-optimal and communication-efficient multiparty computation (Q2169992) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Single-server private information retrieval with sublinear amortized time (Q2170035) (← 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)
- Incrementally verifiable computation via incremental PCPs (Q2175954) (← links)
- Rate-1 quantum fully homomorphic encryption (Q2695630) (← links)
- Somewhere statistical soundness, post-quantum security, and SNARGs (Q2695640) (← links)
- Spooky Encryption and Its Applications (Q2829944) (← links)
- Breaking the Circuit Size Barrier for Secure Computation Under DDH (Q2835599) (← 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 bottleneck complexity of secure multiparty computation (Q5002694) (← links)
- The Usefulness of Sparsifiable Inputs: How to Avoid Subexponential iO (Q5041157) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- CNF-FSS and Its Applications (Q5087261) (← links)
- Chosen-Ciphertext Secure Fully Homomorphic Encryption (Q5738757) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Maliciously secure massively parallel computation for all-but-one corruptions (Q6155275) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
- Multi-key homomorphic secret sharing from LWE without multi-key HE (Q6535488) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)