Evolving homomorphic secret sharing for hierarchical access structures
From MaRDI portal
Publication:2128751
Recommendations
Cites work
- scientific article; zbMATH DE number 3960854 (Why is no real title available?)
- A minimal model for secure computation (extended abstract)
- Breaking the circuit size barrier for secure computation under DDH
- Can a public blockchain keep a secret?
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
- Evolving ramp secret sharing with a small gap
- Evolving ramp secret-sharing schemes
- Evolving secret sharing: dynamic thresholds and robustness
- Foundations of homomorphic secret sharing
- Fully homomorphic encryption using ideal lattices
- Homomorphic secret sharing for low degree polynomials
- Homomorphic secret sharing from lattices without FHE
- How to Share a Secret, Infinitely
- How to share a secret
- Performing computations on hierarchically shared secrets
- Secure computation on the web: computing without simultaneous interaction
- Strongly multiplicative hierarchical threshold secret sharing
- Theory of Cryptography
Cited in
(4)
This page was built for publication: Evolving homomorphic secret sharing for hierarchical access structures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128751)