An efficient publicly verifiable and proactive secret sharing scheme

DOI10.3934/amc.2022086zbMath1517.94176OpenAlexW4313171313MaRDI QIDQ6112179

Bagher Bagherpour

Publication date: 7 July 2023

Published in: Advances in Mathematics of Communications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3934/amc.2022086

zbMATH Keywords

homogeneous linear recursionspublicly verifiable secret sharingproactive secret sharing

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (1)

A bivariate polynomial-based cryptographic hard problem and its applications

Cites Work

• Paillier-based publicly verifiable (non-interactive) secret sharing
• Optimal information ratio of secret sharing schemes on Dutch windmill graphs
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• Communication-efficient proactive secret sharing for dynamic groups with dishonest majorities
• Secure publicly verifiable and proactive secret sharing schemes with general access structure
• New efficient and practical verifiable multi-secret sharing schemes
• Communication-Optimal Proactive Secret Sharing for Dynamic Groups
• Publicly Verifiable Secret Sharing
• How to share a secret
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• The Byzantine Generals Problem
• Ideal secret sharing schemes on graph-based $3$-homogeneous access structures
• How to withstand mobile virus attacks (extended abstract)
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: An efficient publicly verifiable and proactive secret sharing scheme