Deniable secret sharing

DOI10.1007/978-3-032-12293-3_13MaRDI QIDQ7233200zbMATH OpenFDO

Authors Ran Canetti, Ivan B. Damgård, Sebastian Kolby, Divya Ravi, Sophia Yakoubov

Publication date 24 April 2026

Full work available at URL https://doi.org/10.1007/978-3-032-12293-3_13

zbMATH Keywords

faker anonymityShamir secret sharing

Mathematics Subject Classification ID

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

Cites work

• Can a public blockchain keep a secret?
• Disincentivize collusion in verifiable secret sharing
• Fully deniable interactive encryption
• How to use indistinguishability obfuscation
• scientific article; zbMATH DE number 1088228 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• Incoercible multi-party computation and universally composable receipt-free voting
• On the cryptographic hardness of finding a Nash equilibrium
• Receipt-free secret-ballot elections (extended abstract)
• Towards multiparty computation withstanding coercion of all parties
• Traceable secret sharing and applications
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

This page was built for publication: Deniable secret sharing

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