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

DOI10.1007/s10623-014-9952-6zbMath1335.94056OpenAlexW1975861567MaRDI QIDQ398963

Mahabir Prasad Jhanwar, Reihaneh Safavi-Naini, Ayineedi Venkateswarlu

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)

Related Items

A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ A bivariate polynomial-based cryptographic hard problem and its applications ⋮ An efficient publicly verifiable and proactive secret sharing scheme

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Probabilistic encryption
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Publicly Verifiable Secret Sharing
• A Practical (Non-interactive) Publicly Verifiable Secret Sharing Scheme
• How to share a secret
• Increased Resilience in Threshold Cryptography: Sharing a Secret with Devices That Cannot Store Shares
• Publicly Verifiable Secret Sharing for Cloud-Based Key Management
• The Round Complexity of Verifiable Secret Sharing Revisited
• Public Verifiability from Pairings in Secret Sharing Schemes
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• The round complexity of verifiable secret sharing and secure multicast
• Advances in Cryptology – CRYPTO 2004