Evolving homomorphic secret sharing for hierarchical access structures
DOI10.1007/978-3-030-85987-9_5zbMATH Open1496.94079OpenAlexW3198188822MaRDI QIDQ2128751FDOQ2128751
Kanta Matsuura, Nuttapong Attrapadung, Vorapong Suppakitpaisarn, Kittiphop Phalakarn
Publication date: 22 April 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-85987-9_5
secure multi-party computationhomomorphic secret sharinghierarchical secret sharingevolving secret sharing
Data encryption (aspects in computer science) (68P25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Authentication, digital signatures and secret sharing (94A62) Computer security (68M25)
Cites Work
- Title not available (Why is that?)
- Fully homomorphic encryption using ideal lattices
- How to share a secret
- A minimal model for secure computation (extended abstract)
- Strongly Multiplicative Hierarchical Threshold Secret Sharing
- Theory of Cryptography
- How to Share a Secret, Infinitely
- Breaking the Circuit Size Barrier for Secure Computation Under DDH
- Foundations of Homomorphic Secret Sharing
- Secure Computation on the Web: Computing without Simultaneous Interaction
- Performing computations on hierarchically shared secrets
- Evolving secret sharing: dynamic thresholds and robustness
- Evolving ramp secret-sharing schemes
- Homomorphic secret sharing for low degree polynomials
- Evolving ramp secret sharing with a small gap
- Can a public blockchain keep a secret?
- Homomorphic secret sharing from lattices without FHE
- Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
Cited In (2)
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)
