Paillier-based publicly verifiable (non-interactive) secret sharing

DOI10.1007/S10623-014-9952-6MaRDI QIDQ398963zbMATHOpenAlexFDO

Authors Mahabir P. Jhanwar, Ayineedi Venkateswarlu, Reihaneh Safavi-Naini

Publication date 18 August 2014

Published in Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10623-014-9952-6

zbMATH Keywords

secret sharingdecisional composite residuosity assumptionnon-interactive PVSSPaillier's encryption scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• A practical (non-interactive) publicly verifiable secret sharing scheme
• A pairing-based publicly verifiable secret sharing scheme
• Publication:4941853
• Publicly verifiable secret sharing
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme

Cites work

• scientific article; zbMATH DE number 1618044 (Why is no real title available?)
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 708801 (Why is no real title available?)
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• A practical (non-interactive) publicly verifiable secret sharing scheme
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Advances in Cryptology – CRYPTO 2004
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• How to share a secret
• Increased resilience in threshold cryptography: sharing a secret with devices that cannot store shares
• Practical threshold signatures
• Probabilistic encryption
• Public Verifiability from Pairings in Secret Sharing Schemes
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Publicly verifiable secret sharing
• Publicly verifiable secret sharing for cloud-based key management
• The Round Complexity of Verifiable Secret Sharing Revisited
• The round complexity of verifiable secret sharing and secure multicast
• Threshold cryptography based on Asmuth-Bloom secret sharing

Cited in

(12)

• Non-interactive verifiable secret sharing for monotone circuits
• An efficient publicly verifiable and proactive secret sharing scheme
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• Round-optimal, fully secure distributed key generation
• Publicly verifiable secret sharing for cloud-based key management
• SCRAPE: scalable randomness attested by public entities
• A new, publicly verifiable, secret sharing scheme
• Publicly verifiable secret sharing over class groups and applications to DKG and YOSO
• A bivariate polynomial-based cryptographic hard problem and its applications
• scientific article; zbMATH DE number 1759349 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• Practical non-interactive publicly verifiable secret sharing with thousands of parties

This page was built for publication: Paillier-based publicly verifiable (non-interactive) secret sharing

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