Random oracles are practical: a paradigm for designing efficient protocols
CCS '93 Proceedings of the 1st ACM conference on Computer and communications security
Hierarchical ID-Based Cryptography
ASIACRYPT '02 Proceedings of the 8th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
HIBE with short public parameters without random oracle
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
ICALP'05 Proceedings of the 32nd international conference on Automata, Languages and Programming
Efficient identity-based encryption without random oracles
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hierarchical identity based encryption with constant size ciphertext
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Hi-index | 0.00 |
Most of digital signatures require the secret key when signing a message, however, there does exists a kind of signature scheme which is able to sign by appending new message only, so-called Append-Only Signature (AOS) [9]. Motivated by its numerous useful applications in network security such as secure routing, etc., in this paper, we propose new efficient AOS scheme with shorter public key (parameters) using ID-based cryptographic techniques. To our surprise, it is the first time to achieve a practical, adaptively secure AOS via ID-based encryption approach. The proposed signature enjoys the merit of security against adaptive attack, while the previously presented AOS is only secure in a weak sense of selective unforgeability. Finally, we also present a new Restricted AOS (RAOS) signature, which may be of independent interest in practice.