A robust \((k,n)+1\) threshold proxy signature scheme based on factoring

DOI10.1016/J.AMC.2004.04.104zbMath1075.94010OpenAlexW2007929723MaRDI QIDQ2485606

Haojin Zhu, Rongxing Lu, Zhen Fu Cao

Publication date: 5 August 2005

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.amc.2004.04.104

zbMATH Keywords

Proxy signatureFactoringThreshold signatureImproved RSA scheme

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (3)

Provably secure and efficient proxy signature with untrustworthy proxy signer ⋮ New \((t, n)\) threshold directed signature scheme with provable security ⋮ Designated verifier proxy signature scheme with message recovery

Cites Work

• New multi-proxy multi-signature schemes
• The Exact Security of Digital Signatures-How to Sign with RSA and Rabin
• Efficient generation of shared RSA keys
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A robust \((k,n)+1\) threshold proxy signature scheme based on factoring