Homomorphic extensions of CRT-based secret sharing

DOI10.1016/J.DAM.2020.06.006MaRDI QIDQ2197441zbMATH OpenOpenAlexWikidataFDO

Authors Oğuzhan Ersoy, Thomas Brochmann Pedersen, Emin Anarim

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

zbMATH Keywords

Chinese remainder theoremAsmuth-Bloom secret sharingsecret sharing homomorphism

Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)

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

Cites work

• scientific article; zbMATH DE number 2085431 (Why is no real title available?)
• scientific article; zbMATH DE number 4039795 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• scientific article; zbMATH DE number 4195886 (Why is no real title available?)
• A Verifiable Secret Sharing Scheme Based on the Chinese Remainder Theorem
• A method for obtaining digital signatures and public-key cryptosystems
• A modular approach to key safeguarding
• A public key cryptosystem and a signature scheme based on discrete logarithms
• CRT-based fully homomorphic encryption over the integers
• Chinese remaindering with errors
• Fully homomorphic encryption using ideal lattices
• General secret sharing based on the Chinese remainder theorem with applications in e-voting
• Homomorphic AES evaluation using the modified LTV scheme
• How to share a secret
• How to share a secret
• Multi-party computation with conversion of secret sharing
• On secret sharing systems
• On the asymptotic idealness of the Asmuth-Bloom threshold secret sharing scheme
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Theory of Cryptography
• Threshold cryptography based on Asmuth-Bloom secret sharing

Cited in

(2)

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

Describes a project that uses

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)