On round-optimal computational VSS

DOI10.62056/A0ZO-4TW9MaRDI QIDQ7346681zbMATH OpenFDO

Authors Karim Baghery, Navid Ghaedi Bardeh, Shahram Khazaei, Mahdi Rahimi

Publication date 11 September 2026

Published in IACR Communications in Cryptology (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.62056/A0ZO-4TW9

Mathematics Subject Classification ID

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

Cites work

• : a unified framework for computational verifiable secret sharing
• ALBATROSS: publicly AttestabLe BATched Randomness based On Secret Sharing
• Computational verifiable secret sharing revisited
• Efficient batch zero-knowledge arguments for low degree polynomials
• How to share a secret
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1418293 (Why is no real title available?)
• Lightweight asynchronous verifiable secret sharing with optimal resilience
• Practical non-interactive publicly verifiable secret sharing with thousands of parties
• SCRAPE: scalable randomness attested by public entities
• Simplified VSS and fast-track multiparty computations with applications to threshold cryptography
• The round complexity of verifiable secret sharing and secure multicast
• Verifiable secret sharing from symmetric key cryptography with improved optimistic complexity
• VSS from distributed ZK proofs and applications
• Zero-knowledge proofs on secret-shared data via fully linear PCPs

This page was built for publication: On round-optimal computational VSS

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7346681)