A practical and provably secure scheme for publicly verifiable secret sharing and its applications

DOI10.1007/BFb0054115zbMath0919.94021OpenAlexW1543585825MaRDI QIDQ4249626

Eiichiro Fujisaki, Tatsuaki Okamoto

Publication date: 9 September 1999

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bfb0054115

zbMATH Keywords

publicly verifiable secret sharing schemeprovably secure PVSS scheme

Mathematics Subject Classification ID

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

Related Items

Non-interactive provably secure attestations for arbitrary RSA prime generation algorithms ⋮ Practical non-interactive publicly verifiable secret sharing with thousands of parties ⋮ Paillier-based publicly verifiable (non-interactive) secret sharing ⋮ Zero-knowledge arguments for subverted RSA groups ⋮ Structure-preserving signatures on equivalence classes and constant-size anonymous credentials ⋮ YOLO YOSO: fast and simple encryption and secret sharing in the YOSO model ⋮ Efficient VSS free of computational assumption ⋮ An attack on a payment scheme ⋮ A pairing-based publicly verifiable secret sharing scheme ⋮ Tightly coupled multi-group threshold secret sharing based on Chinese remainder theorem ⋮ Public Verifiability from Pairings in Secret Sharing Schemes ⋮ A Secure and Efficient Proof of Integer in an Interval Range

This page was built for publication: A practical and provably secure scheme for publicly verifiable secret sharing and its applications