Pages that link to "Item:Q2292864"
From MaRDI portal
The following pages link to Homomorphic secret sharing from lattices without FHE (Q2292864):
Displaying 28 items.
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Breaking the circuit size barrier for secure computation under quasi-polynomial LPN (Q2056771) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- Efficient pseudorandom correlation generators from ring-LPN (Q2096531) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Highly efficient OT-based multiplication protocols (Q2169999) (← links)
- CPA-to-CCA transformation for KDM security (Q2175934) (← links)
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles (Q2175948) (← links)
- Multi-secret sharing model based on Hermite interpolation polynomial and quantum graph state (Q2197027) (← links)
- Secret-shared RAM indefinite private and secure RAM execution of perfectly unrevealed programs (Q2687034) (← links)
- Circular security is complete for KDM security (Q2692344) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- On the local leakage resilience of linear secret sharing schemes (Q5918308) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Non-interactive secure computation of inner-product from LPN and LWE (Q6135407) (← links)
- Homomorphic secret sharing for multipartite and general adversary structures supporting parallel evaluation of low-degree polynomials (Q6157516) (← links)
- Succinct publicly-certifiable proofs. Or, can a blockchain verify a designated-verifier proof? (Q6157611) (← links)
- An algebraic framework for silent preprocessing with trustless setup and active security (Q6166960) (← 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)
- Simple threshold (fully homomorphic) encryption from LWE with polynomial modulus (Q6595688) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
- Succinct homomorphic secret sharing (Q6637573) (← links)
- Compressing unit-vector correlations via sparse pseudorandom generators (Q6653033) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
