One-way functions are necessary and sufficient for secure signatures
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Communications of the ACM
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Digital Signcryption or How to Achieve Cost(Signature & Encryption)
CRYPTO '97 Proceedings of the 17th Annual International Cryptology Conference on Advances in Cryptology
Short Signatures from the Weil Pairing
ASIACRYPT '01 Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Signcryption and Its Applications in Efficient Public Key Solutions
ISW '97 Proceedings of the First International Workshop on Information Security
An Identity-Based Signature from Gap Diffie-Hellman Groups
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Hi-index | 0.00 |
Relations between various cryptographic schemes make it possible to build a new cryptographic scheme from (some components of) other kinds of cryptographic schemes. Recently, three new schemes are proposed by exploiting these relationships: a group signature scheme from identity-based signature, another group signature scheme from proxy signature and a signcryption scheme from secret sharing. Unfortunately, we show that these schemes are insecure. These group signature schemes cannot satisfy at least half of the standard security requirements while the signcryption scheme does not even satisfy the basic requirement of a secure signcryption scheme. We hope this work can exhibit the precautions one should take when making schemes with a similar approach.