How to prove yourself: practical solutions to identification and signature problems
Proceedings on Advances in cryptology---CRYPTO '86
An identity-based key-exchange protocol
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Secure audit logs to support computer forensics
ACM Transactions on Information and System Security (TISSEC)
Simple forward-secure signatures from any signature scheme
Proceedings of the 7th ACM conference on Computer and communications security
Efficient Generic Forward-Secure Signatures with an Unbounded Number Of Time Periods
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
Logcrypt: forward security and public verification for secure audit logs
ACSW Frontiers '06 Proceedings of the 2006 Australasian workshops on Grid computing and e-research - Volume 54
Forward-secure signatures with untrusted update
Proceedings of the 13th ACM conference on Computer and communications security
Extended Abstract: Forward-Secure Sequential Aggregate Authentication
SP '07 Proceedings of the 2007 IEEE Symposium on Security and Privacy
Cryptographic support for secure logs on untrusted machines
SSYM'98 Proceedings of the 7th conference on USENIX Security Symposium - Volume 7
Forward-secure signatures in untrusted update environments: efficient and generic constructions
Proceedings of the 14th ACM conference on Computer and communications security
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Forward-secure signatures with fast key update
SCN'02 Proceedings of the 3rd international conference on Security in communication networks
Forward-security in private-key cryptography
CT-RSA'03 Proceedings of the 2003 RSA conference on The cryptographers' track
Sequential aggregate signatures and multisignatures without random oracles
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
A New Approach to Secure Logging
Proceeedings of the 22nd annual IFIP WG 11.3 working conference on Data and Applications Security
A new approach to secure logging
ACM Transactions on Storage (TOS)
Efficient data structures for tamper-evident logging
SSYM'09 Proceedings of the 18th conference on USENIX security symposium
ACM Transactions on Information and System Security (TISSEC)
Deterministic identity based signature scheme and its application for aggregate signatures
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
Self-healing in unattended wireless sensor networks
ACM Transactions on Sensor Networks (TOSN)
Authenticating operation-based history in collaborative systems
Proceedings of the 17th ACM international conference on Supporting group work
Hi-index | 0.00 |
A forward secure sequential aggregate (FssAgg) signature scheme allows a signer to iteratively combine signatures generated in different time intervals - and with different keys - into a single constant-size signature. Such a signature offers forward security, storage/communication efficiency, as well as overall integrity of the signed messages. FssAgg schemes are therefore suitable for data-intensive applications on untrusted and/or unattended devices, e.g., logging systems. The first FssAgg signature scheme [21] is based on bilinear maps and is thus rather costly. In this paper, we propose two more practical FssAgg1 signature schemes. A FssAgg1 signature scheme is a special FssAgg signature scheme where exactly ONE message can be signed at each time interval and key update is invoked immediately after each signature generation. Both new schemes are derived from existing forward secure signature schemes. Unlike the scheme in [21], each new scheme has constant-size public and private keys, constant-size signatures as well as constant-time key update and signature generation complexity. We show how to apply proposed schemes in secure logging applications.