A digital signature scheme secure against adaptive chosen-message attacks
SIAM Journal on Computing - Special issue on cryptography
Fast Probabilistic Algorithms for Verification of Polynomial Identities
Journal of the ACM (JACM)
Group Encryption: Non-interactive Realization in the Standard Model
ASIACRYPT '09 Proceedings of the 15th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Strengthening zero-knowledge protocols using signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Efficient non-interactive proof systems for bilinear groups
EUROCRYPT'08 Proceedings of the theory and applications of cryptographic techniques 27th annual international conference on Advances in cryptology
Structure-preserving signatures and commitments to group elements
CRYPTO'10 Proceedings of the 30th annual conference on Advances in cryptology
Simulation-sound NIZK proofs for a practical language and constant size group signatures
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Multi-show anonymous credentials with encrypted attributes in the standard model
CANS'11 Proceedings of the 10th international conference on Cryptology and Network Security
| Hi-index | 0.01 |
An automorphic signature scheme is a signature scheme that is structure-preserving (messages are group elements and never hashed or sliced into bits in the signing function) and allows self-signing (can sign its own verification-key, i.e., the message space covers the verification-key space). Given an automorphic signature scheme that can sign only one group element as a message, we show how to efficiently sign n group elements where n is sufficiently large or even unbounded. With an existing construction, the size of the resulting signature grows with factor of 4n and it is claimed to be optimal in some sense. Our constructions achieve 3n and even 2n. Since the signature scheme may be used repeatedly or even recursively in applications, the improvement in the multiplicative factor results in considerable efficiency gain in practice.