A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
The knowledge complexity of interactive proof systems
SIAM Journal on Computing
Non-cryptographic fault-tolerant computing in constant number of rounds of interaction
Proceedings of the eighth annual ACM Symposium on Principles of distributed computing
The random oracle methodology, revisited (preliminary version)
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
Signature schemes based on the strong RSA assumption
ACM Transactions on Information and System Security (TISSEC)
Communications of the ACM
Robust threshold DSS signatures
Information and Computation
Adaptive Security for Threshold Cryptosystems
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Non-interactive Distributed-Verifier Proofs and Proving Relations among Commitments
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Robust Distributed Multiplicaton with out Interaction
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
A threshold cryptosystem without a trusted party
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
Secure hash-and-sign signatures without the random oracle
EUROCRYPT'99 Proceedings of the 17th 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
Practical threshold signatures without random oracles
ProvSec'07 Proceedings of the 1st international conference on Provable security
(Convertible) undeniable signatures without random oracles
ICICS'07 Proceedings of the 9th international conference on Information and communications security
Distributed private-key generators for identity-based cryptography
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Certificateless threshold signature secure in the standard model
Information Sciences: an International Journal
A practical coercion resistant voting scheme revisited
Vote-ID'13 Proceedings of the 4th international conference on E-Voting and Identity
Signcryption schemes with threshold unsigncryption, and applications
Designs, Codes and Cryptography
Hi-index | 0.00 |
Recently, Boneh and Boyen proposed a short digital signature scheme where signatures are as short as DSA signatures, but are provably secure in the absence of random oracles. We propose threshold signature schemes based on their short signature scheme. Signatures of our schemes are the same as the underlying short signature scheme. We also prove security of our schemes under q-SDH assumption without using random oracles. To the best of our knowledge, this is the first threshold construction for the short signature scheme without random oracles.