The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
A Linear Construction of Secret Sharing Schemes
Designs, Codes and Cryptography
Communications of the ACM
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Threshold DSS Signatures without a Trusted Party
CRYPTO '95 Proceedings of the 15th Annual International Cryptology Conference on Advances in Cryptology
Provably Secure Implicit Certificate Schemes
FC '01 Proceedings of the 5th International Conference on Financial Cryptography
Some Recent Research Aspects of Threshold Cryptography
ISW '97 Proceedings of the First International Workshop on Information Security
Postal Revenue Collection in the Digital Age
FC '00 Proceedings of the 4th International Conference on Financial Cryptography
A practical scheme for non-interactive verifiable secret sharing
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Security proofs for signature schemes
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure distributed key generation for discrete-log based cryptosystems
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
An Efficient and Provably Secure Threshold Blind Signature
ICISC '01 Proceedings of the 4th International Conference Seoul on Information Security and Cryptology
Efficient revocation and threshold pairing based cryptosystems
Proceedings of the twenty-second annual symposium on Principles of distributed computing
Robust ID-based threshold signcryption scheme from pairings
InfoSecu '04 Proceedings of the 3rd international conference on Information security
Efficient and robust key management for large mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Efficient and robust key management for large mobile ad hoc networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Noninteractive self-certification for long-lived mobile ad hoc networks
IEEE Transactions on Information Forensics and Security - Special issue on electronic voting
Certificateless threshold signature scheme from bilinear maps
Information Sciences: an International Journal
Revisiting fully distributed proxy signature schemes
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
New ID-Based threshold signature scheme from bilinear pairings
INDOCRYPT'04 Proceedings of the 5th international conference on Cryptology in India
Certificateless threshold signature secure in the standard model
Information Sciences: an International Journal
Signcryption schemes with threshold unsigncryption, and applications
Designs, Codes and Cryptography
| Hi-index | 0.00 |
In a (t, n) threshold digital signature scheme, t out of n signers must co-operate to issue a signature. We present an efficient and robust (t, n) threshold version of Schnorr's signature scheme. We prove it to be as secure as Schnorr's signature scheme, i.e., existentially unforgeable under adaptively chosen message attacks. The signature scheme is then incorporated into a (t, n) threshold scheme for implicit certificates. We prove the implicit certificate scheme to be as secure as the distributed Schnorr signature scheme.