References
1. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. SIAM, J. Com-
puting, 32(3), pp.583-615, 2003.
2. D. Boneh, C. Gentry, B. Lynn, H. Shacham, Aggregate and veriﬁably encrypted signatures
from bilinear maps. Advances in Cryptology–EUROCRYPT 2003, Lecture Notes in Com-
puter. Science, Vol. 2656, pp.416-432, Springer, 2003.
3. D. Boneh, B. Lymn and H. Shacham. Short signatures from the Weil pairing. Prodeedings of
Asiacrypt 2001, Vol. 2248, Lecture Notes in Computer Science, pp.514-532, Springer, 2001.
4. M. Bellare and G.. Neven. Transitive signatures based on factoring and RSA. Advances in
Cryptology - ASIACRYPT’02, Lecture Noted in Computer Science Vol.2501, pp.391-414,
Springer, 2002.
5. M. Bellare and P. Rogaway. Random oracles are practical: A paradigm for designing efﬁcient
protocols. Proceeding s of the 1st Annual Conference on Computer and Communications
Security, ACM. pp.62-73, 1993.
6. J.-S. Coron, On the exact security of full domain hash. Advances in Cryptology–CRYPTO
2000, Lecture Notes in Computer Science, Vol.1880, pp.229-235, Springer, Berlin, 2000.
7. S. Chari, T. Rabin and R. Rivest. An efﬁcient signature scheme for route aggregation.
http://theory.lcs.mit.edu/ rivest/publications.html, 2002.
8. R. Housley, M. Ford, W. Polk, D.solo. Internet X.509 Public Key Infrastructure: Certiﬁcate
and CRL Proﬁle. http://www.ietf.org/rfc.html, January 1999.
9. R. Johnson, D. Molnar, D. Song and D. Wagner. Homomorphic signature schemes. Topics
in Cryptology - CT-RSA ’02, Lecture Notes in Computer Science Vol.2271, pp.244-262,
Springer, 2002.
10. A. Joux and K. Nguyen. Separating decision Difﬁe-Hellman form Difﬁe-Hellman in crypto-
graphic groups. Cryptology ePrint Archive, Report 2001/003, 2001. http://eprint.iacr.org/.
11. Changshe Ma and Kefei Chen, Publicly veriﬁable authenticated encryption. Electronics Let-
ters, vol 39, pp.281-282, 2003.
12. S. Micali and R. L. Rivest. Transitive signature schemes. Topics in Cryptology - CT-RSA
’02, Lecture Notes in Computer Science Vol.2271 , pp.236-243, Springer, 2002.
13. R. Steinfeld, L. Bull and Y. Zheng. Content Extraction signatures. Information security and
cryptology-ICI 2001, Lecture Notes in Computer SCience Vol.2288, pp.285-304, Spring-
Verlag, 2002.
14. Fangguo Zhang, Rei Safavi-Naini, and Willy Susilo. An Efﬁcient Signature Scheme from
Bilinear Pairings and Its Application. Public Key Cryptography - PKC 2004, Lecture Notes
in Computer Science, volume 2947, pages 277-290. Springer, 2004.
15. H.Zhu and B. Feng, Robert H. Deng. Computing of Trust in Distributed Networks.
http://www.iacr.org, eprint.
56