Non-interactive zero-knowledge and its applications
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of 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 method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
PKC '03 Proceedings of the 6th International Workshop on Theory and Practice in Public Key Cryptography: Public Key Cryptography
Efficiency improvements for signature schemes with tight security reductions
Proceedings of the 10th ACM conference on Computer and communications security
Multi-signatures in the plain public-Key model and a general forking lemma
Proceedings of the 13th ACM conference on Computer and communications security
Proceedings of the 14th ACM conference on Computer and communications security
The exact security of digital signatures-how to sign with RSA and Rabin
EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques
Proving in zero-knowledge that a number is the product of two safe primes
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
Aggregate and verifiably encrypted signatures from bilinear maps
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Identity-Based aggregate signatures
PKC'06 Proceedings of the 9th international conference on Theory and Practice of Public-Key Cryptography
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
Identity-Based multi-signatures from RSA
CT-RSA'07 Proceedings of the 7th Cryptographers' track at the RSA conference on Topics in Cryptology
Secure Border Gateway Protocol (S-BGP)
IEEE Journal on Selected Areas in Communications
Unrestricted aggregate signatures
ICALP'07 Proceedings of the 34th international conference on Automata, Languages and Programming
New Multiparty Signature Schemes for Network Routing Applications
ACM Transactions on Information and System Security (TISSEC)
Key Evolution Systems in Untrusted Update Environments
Information Security and Cryptology
Aggregate and Verifiably Encrypted Signatures from Multilinear Maps without Random Oracles
ISA '09 Proceedings of the 3rd International Conference and Workshops on Advances in Information Security and Assurance
Synchronized aggregate signatures: new definitions, constructions and applications
Proceedings of the 17th ACM conference on Computer and communications security
Key Evolution Systems in Untrusted Update Environments
ACM Transactions on Information and System Security (TISSEC)
History-free aggregate message authentication codes
SCN'10 Proceedings of the 7th international conference on Security and cryptography for networks
Non-interactive editable signatures for assured data provenance
Proceedings of the first ACM conference on Data and application security and privacy
How to aggregate the CL signature scheme
ESORICS'11 Proceedings of the 16th European conference on Research in computer security
Non-interactive CDH-based multisignature scheme in the plain public key model with tighter security
ISC'11 Proceedings of the 14th international conference on Information security
Identity-Based aggregate and multi-signature schemes based on RSA
PKC'10 Proceedings of the 13th international conference on Practice and Theory in Public Key Cryptography
Deterministic identity based signature scheme and its application for aggregate signatures
ACISP'12 Proceedings of the 17th Australasian conference on Information Security and Privacy
An efficient certificateless aggregate signature with constant pairing computations
Information Sciences: an International Journal
History-Free sequential aggregate signatures
SCN'12 Proceedings of the 8th international conference on Security and Cryptography for Networks
Sequential aggregate signatures with lazy verification from trapdoor permutations
ASIACRYPT'12 Proceedings of the 18th international conference on The Theory and Application of Cryptology and Information Security
Sequential aggregate signatures made shorter
ACNS'13 Proceedings of the 11th international conference on Applied Cryptography and Network Security
Hi-index | 0.00 |
We generalize the concept of sequential aggregate signatures (SAS), proposed by Lysyanskaya, Micali, Reyzin, and Shacham (LMRS) at Eurocrypt 2004, to a new primitive called sequential aggregate signed data (SASD) that tries to minimize the total amount of transmitted data, rather than just signature length. We present SAS and SASD schemes that offer numerous advantages over the LMRS scheme. Most importantly, our schemes can be instantiated with uncertified claw-free permutations, thereby allowing implementations based on low-exponent RSA and factoring, and drastically reducing signing and verification costs. Our schemes support aggregation of signatures under keys of different lengths, and the SASD scheme even has as little as 160 bits of bandwidth overhead. Finally, we present a multi-signed data scheme that, when compared to the state-of-the-art multi-signature schemes, is the first scheme with non-interactive signature generation not based on pairings. All of our constructions are proved secure in the random oracle model based on families of claw-free permutations.