Public Verifiability from Pairings in Secret Sharing Schemes

DOI10.1007/978-3-642-04159-4_19zbMath1256.94052OpenAlexW1481767347MaRDI QIDQ3644208

Somayeh Heidarvand, Jorge Luis Villar

Publication date: 3 November 2009

Published in: Selected Areas in Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-04159-4_19

zbMATH Keywords

pairingssecret sharingsemantic securitythreshold cryptographypublic verification

Mathematics Subject Classification ID

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

Related Items (7)

A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model ⋮ ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing ⋮ SCRAPE: Scalable Randomness Attested by Public Entities ⋮ Secure publicly verifiable and proactive secret sharing schemes with general access structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Publicly Verifiable Secret Sharing
• How to share a secret
• Perfect Non-interactive Zero Knowledge for NP
• 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
• Threshold Signatures, Multisignatures and Blind Signatures Based on the Gap-Diffie-Hellman-Group Signature Scheme
• Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption

This page was built for publication: Public Verifiability from Pairings in Secret Sharing Schemes