Pages that link to "Item:Q4993284"
From MaRDI portal
The following pages link to Foundations of Homomorphic Secret Sharing (Q4993284):
Displaying 32 items.
- Verifiable homomorphic secret sharing (Q1616636) (← links)
- Homomorphic secret sharing from Paillier encryption (Q1616900) (← links)
- 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)
- Recent advances in function and homomorphic secret sharing (invited talk) (Q1746821) (← 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)
- On group-characterizability of homomorphic secret sharing schemes (Q2235752) (← links)
- Homomorphic secret sharing from lattices without FHE (Q2292864) (← 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)
- CNF-FSS and Its Applications (Q5087261) (← links)
- An optimal distributed discrete log protocol with applications to homomorphic secret sharing (Q5918863) (← links)
- Round-optimal black-box secure computation from two-round malicious OT (Q6114280) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6134842) (← links)
- Encryption to the future. A paradigm for sending secret messages to future (anonymous) committees (Q6135431) (← links)
- Two-round MPC without round collapsing revisited -- towards efficient malicious protocols (Q6155260) (← 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)
- Quadratic multiparty randomized encodings beyond honest majority and their applications (Q6166962) (← links)
- Scooby: improved multi-party homomorphic secret sharing based on FHE (Q6204164) (← links)