Pages that link to "Item:Q2056710"
From MaRDI portal
The following pages link to The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710):
Displaying 19 items.
- Homomorphic secret sharing from Paillier encryption (Q1616900) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Secure multiparty computation with sublinear preprocessing (Q2170009) (← links)
- Distributed (correlation) samplers: how to remove a trusted dealer in one round (Q2170033) (← links)
- Sublinear secure computation from new assumptions (Q6114267) (← links)
- Threshold linearly homomorphic encryption on \(\mathrm{Z}/2^k\mathrm{Z}\) (Q6132407) (← 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)
- Correlated pseudorandomness from expand-accumulate codes (Q6162058) (← 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)
- On the correlation complexity of MPC with cheater identification (Q6573954) (← links)
- Beyond MPC-in-the-head: black-box constructions of short zero-knowledge proofs (Q6581781) (← links)
- Efficient and generic methods to achieve active security in private information retrieval and more advanced database search (Q6637539) (← links)
- Fast public-key silent OT and more from constrained Naor-Reingold (Q6637563) (← links)
- Two-round maliciously-secure oblivious transfer with optimal rate (Q6637571) (← links)
- Succinct homomorphic secret sharing (Q6637573) (← links)
- 10-party sublinear secure computation from standard assumptions (Q6653039) (← links)
