Dynamic threshold secret reconstruction and its application to the threshold cryptography

DOI10.1016/j.ipl.2015.06.014zbMath1333.94037OpenAlexW1194807963MaRDI QIDQ2353654

Lein Harn, Ching-Fang Hsu

Publication date: 15 July 2015

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2015.06.014

zbMATH Keywords

cryptographybivariate polynomialsecret sharing schemedynamic thresholdsecure channel

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (8)

Randomized component based secure secret reconstruction in insecure networks ⋮ Secret sharing with secure secret reconstruction ⋮ Ideal dynamic threshold multi-secret data sharing in smart environments for sustainable cities ⋮ Bivariate polynomial-based secret sharing schemes with secure secret reconstruction ⋮ A new threshold changeable secret sharing scheme based on the Chinese remainder theorem ⋮ Security analysis of a dynamic threshold secret sharing scheme using linear subspace method ⋮ Ramp scheme based on CRT for polynomial ring over finite field ⋮ Threshold changeable secret sharing with secure secret reconstruction

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Threshold changeable secret sharing schemes revisited
• Lattice-based treshold-changeability for standard CRT secret-sharing schemes
• Detection and identification of cheaters in \((t,n)\) secret sharing scheme
• How to share a secret with cheaters
• Shared secret reconstruction
• On dealer-free dynamic threshold schemes
• How to share a function securely
• Publicly Verifiable Secret Sharing
• How to share a secret
• The Round Complexity of Verifiable Secret Sharing: The Statistical Case
• The Round Complexity of Verifiable Secret Sharing Revisited
• Robust and Efficient Sharing of RSA Functions
• Improving the Round Complexity of VSS in Point-to-Point Networks
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A method for obtaining digital signatures and public-key cryptosystems
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience
• How to Share a Secret
• A modular approach to key safeguarding
• The round complexity of verifiable secret sharing and secure multicast
• Dynamic Threshold and Cheater Resistance for Shamir Secret Sharing Scheme
• Lattice-Based Threshold-Changeability for Standard Shamir Secret-Sharing Schemes
• Selected Areas in Cryptography
• Analysis and Design of Multiple Threshold Changeable Secret Sharing Schemes
• Theory of Cryptography

This page was built for publication: Dynamic threshold secret reconstruction and its application to the threshold cryptography