Homomorphic extensions of CRT-based secret sharing

DOI10.1016/J.DAM.2020.06.006zbMATH Open1452.94102OpenAlexW3035389378WikidataQ122195876 ScholiaQ122195876MaRDI QIDQ2197441FDOQ2197441

Thomas Brochmann Pedersen, Emin Anarim, Oğuzhan Ersoy

Publication date: 31 August 2020

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2020.06.006

Recommendations

• On abelian and homomorphic secret sharing schemes
• On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
• Constructing ideal secret sharing schemes based on Chinese remainder theorem
• Constructive \(t\)-secure homomorphic secret sharing for low degree polynomials
• Threshold cryptography based on Asmuth-Bloom secret sharing

zbMATH Keywords

Chinese remainder theoremAsmuth-Bloom secret sharingsecret sharing homomorphism

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Fully homomorphic encryption using ideal lattices
• Theory of Cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• How to share a secret
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• On secret sharing systems
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Homomorphic AES evaluation using the modified LTV scheme
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Title not available (Why is that?)
• A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
• General secret sharing based on the Chinese remainder theorem with applications in e-voting
• Title not available (Why is that?)
• Title not available (Why is that?)
• A modular approach to key safeguarding
• Title not available (Why is that?)
• How to Share a Secret
• Multi-party computation with conversion of secret sharing
• Chinese remaindering with errors
• CRT-based fully homomorphic encryption over the integers
• On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme

Cited In (2)

• Recent advances in function and homomorphic secret sharing (invited talk)
• Homomorphic secret sharing from lattices without FHE

Uses Software

• Sharemind

This page was built for publication: Homomorphic extensions of CRT-based secret sharing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2197441)