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

DOI10.1007/S10623-014-9952-6zbMATH Open1335.94056OpenAlexW1975861567MaRDI QIDQ398963FDOQ398963

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

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

zbMATH Keywords

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

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Probabilistic encryption
• How to share a secret
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Practical threshold signatures
• Advances in Cryptology – CRYPTO 2004
• Threshold cryptography based on Asmuth-Bloom secret sharing
• Publicly Verifiable Secret Sharing
• A practical (non-interactive) publicly verifiable secret sharing scheme
• 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
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• The round complexity of verifiable secret sharing and secure multicast

Cited In (10)

• Publicly verifiable secret sharing for cloud-based key management
• SCRAPE: Scalable Randomness Attested by Public Entities
• A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• A new, publicly verifiable, secret sharing scheme
• A bivariate polynomial-based cryptographic hard problem and its applications
• Round-optimal, fully secure distributed key generation
• An efficient publicly verifiable and proactive secret sharing scheme
• Title not available (Why is that?)
• Title not available (Why is that?)

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)