Pages that link to "Item:Q4993284"
From MaRDI portal
The following pages link to Foundations of Homomorphic Secret Sharing (Q4993284):
Displaying 18 items.
- Two-round MPC: information-theoretic and black-box (Q1629402) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Formalisation of Bayesian concealment (Q2044153) (← links)
- The rise of Paillier: homomorphic secret sharing and public-key silent OT (Q2056710) (← links)
- Threshold garbled circuits and ad hoc secure computation (Q2056781) (← links)
- A geometric approach to homomorphic secret sharing (Q2061949) (← links)
- BETA: biometric-enabled threshold authentication (Q2061958) (← links)
- Three-round secure multiparty computation from black-box two-round oblivious transfer (Q2128560) (← links)
- Evolving homomorphic secret sharing for hierarchical access structures (Q2128751) (← links)
- Large message homomorphic secret sharing from DCR and applications (Q2129016) (← links)
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials (Q2152064) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Fully homomorphic NIZK and NIWI proofs (Q2175946) (← links)
- Accumulating automata and cascaded equations automata for communicationless information theoretically secure multi-party computation (Q2330096) (← links)
- Multi-client oblivious RAM with poly-logarithmic communication (Q2692380) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)
