Weaknesses in Some Threshold Cryptosystems

DOI10.1007/3-540-68697-5_6zbMath1329.94071OpenAlexW1968661709MaRDI QIDQ3452341

Susan K. Langford

Publication date: 11 November 2015

Published in: Advances in Cryptology — CRYPTO ’96 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-68697-5_6

zbMATH Keywords

cryptanalysissecret sharingdigital signaturesthreshold signaturesundeniable signaturesthreshold cryptosystems

Mathematics Subject Classification ID

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

Related Items (4)

MuSig2: simple two-round Schnorr multi-signatures ⋮ Round Optimal Secure Multisignature Schemes from Lattice with Public Key Aggregation and Signature Compression ⋮ Simple Schnorr multi-signatures with applications to bitcoin ⋮ Identity based group-oriented undeniable signature scheme

Cites Work

• How to share a secret
• On the modular distance (Corresp.)
• A method for obtaining digital signatures and public-key cryptosystems
• Group-oriented (t, n) threshold digital signature scheme and digital multisignature
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Weaknesses in Some Threshold Cryptosystems