홈 editorial content online
Volume 14 (2012)
No 1
Volume 13 (2011)
No 1
Volume 12 (2010)
No 1
Volume 11 (2009)
No 1, No 2
Volume 10 (2008)
No 1, No 2
Volume 9 (2006)
No 1, No 2
Volume 8 (2005)
No 1, No 2
Volume 7 (2004)
No 1, No 2
Volume 6 (2003)
No 1, No 2
Volume 5 (2002)
No 1, No 2
Volume 4 (2001)
No 1, No 2
Volume 3 (2000)
No 1
Volume 2 (1999)
No 1
Volume 1 (1998)
No 1

(2005 / vol.8 / no.1)
A New {ID}-based Signature with Batch Verification
Jung Hee Cheon, Yongdae Kim,Hyo Jin Yoon
Pages. 119-131     



In 1984, Shamir proposed a new public key cryptography, the identity
({ID})-based encryption and signature schemes which allows any pair
of users to communicate securely and to verify each other's
signatures without exchanging certificates. Since then, we have
several ID-based signatures based on the discrete logarithm
problem. While they have an advantage that the system secret can be
shared by several parties through threshold schemes, they have a
critical disadvantage in efficiency. To enhance the efficiency of
verification, we propose a new {ID}-based signature
scheme that allows batch verification of multiple signatures.
The verification cost of the proposed signature scheme for $k$
signatures is almost constant with minimal security loss and
when a new signature by a different
signer is added to the batch verification, the additional cost
is almost a half of that of a single signature.
We prove that the proposed signature scheme is secure
against existential forgery under adaptively chosen message and {ID} attack in the random oracle model and
show why other ID-based signature schemes are hard to achieve these properties.



1. Introduction
2. Preliminary
3. A New ID-based Signature
4. Batch Verification
5. Efficiency
6. Conclusion and Open problem



ID-based signatures, Batch verifications