A pairing-based publicly verifiable secret sharing scheme

DOI10.1007/s11424-011-8408-6zbMath1217.94111OpenAlexW2049651562MaRDI QIDQ545465

Tsu-Yang Wu, Yuh-Min Tseng

Publication date: 22 June 2011

Published in: Journal of Systems Science and Complexity (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11424-011-8408-6

zbMATH Keywords

cryptographysecret sharingrandom oracle modelbilinear pairing

Mathematics Subject Classification ID

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

Related Items (3)

A non-interactive \((t, n)\)-publicly verifiable multi-secret sharing scheme ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Secure publicly verifiable and proactive secret sharing schemes with general access structure

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Efficient identity-based authenticated key agreement protocol from pairings
• Publicly Verifiable Secret Sharing
• How to share a secret
• The random oracle methodology, revisited
• Identity-based authenticated key agreement protocol based on Weil pairing
• A practical and provably secure scheme for publicly verifiable secret sharing and its applications
• Reducing elliptic curve logarithms to logarithms in a finite field
• An Identity-Based Signature from Gap Diffie-Hellman Groups
• Identity-Based Encryption from the Weil Pairing
• Batch Verifications with ID-Based Signatures
• Efficient and Provably-Secure Identity-Based Signatures and Signcryption from Bilinear Maps
• Public Key Cryptography - PKC 2005
• Public Key Cryptography – PKC 2004

This page was built for publication: A pairing-based publicly verifiable secret sharing scheme