Proxy signature without random oracles

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4325 LNCS, Issue , 2006, Pages 473-484

  Huang, Xinyi ^a   Susilo, Willy ^a   Mu, Yi ^a   Wu, Wei ^a  

^a UNIVERSITY OF WOLLONGONG   (Australia)

Author keywords

Bilinear pairings; CDH problem; Proxy signature; Without random oracles

Indexed keywords

BILINEAR PAIRING; CDH PROBLEM; DISTRIBUTED SYSTEMS; MOBILE AGENT APPLICATION; PROXY SIGNATURE SCHEME; PROXY SIGNATURES; SERVICE AVAILABILITY; WITHOUT RANDOM ORACLES;

AUTHENTICATION; MOBILE AD HOC NETWORKS; MOBILE AGENTS; NETWORK SECURITY; SENSOR NETWORKS;

ELECTRONIC DOCUMENT IDENTIFICATION SYSTEMS;

EID: 84880373553     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11943952_40     Document Type: Conference Paper

References (22)

1. D. Boneh and X. Boyen. Short signatures without random oracles. In Advances in Cryptology, Proc. EUROCRYPT 2004, Lecture Notes in Computer Science 3027, pages. 56-73. Springer-Verlag, 2004.
2. D. Boneh and M. Franklin. Identity-based encryption from the Weil pairing. In Advances in Cryptology, Proc. CRYPTO 2001, Lecture Notes in Computer Science 2139, pages. 213-229. Springer-Verlag, 2001.
3. D. Boneh, B. Lynn, and H. Shacham. Short signatures from the Weil pairing. In Advances in Cryptology-ASIACRYPT 2001, Lecture Notes in Computer Science 2248, pages. 514-532. Springer-Verlag, 2001.
4. A. Boldyreva, A. Palacio and B. Warinschi. Secure proxy signature scheme for delegation of signing rights. IACR ePrint Archive, available at http://eprint.iacr.org/2003/096/, 2003.
5. M. Bellare and P. Rogaway. The Exact Security of Digital Signatures - How to Sign with RSA and Rabin. Advances in Cryptology - Eurocrypt'96, Lecture Notes in Computer Science 950, pages 399-416, Springer-Verlag, Berlin, 1996.
6. J. H. Cheon. Security analysis of the strong diffie-hellman problem. EUROCRYPT 2006, to appear.
7. R. Canetti, O. Goldreich and S. Halevi. The Random Oracle Methodology, revisited. In Proceedings of the 30th Annual Symposium on the Theory of Computing (STOC'98), pages 209-218, 1998.
8. S. Goldwasser, S. Micali and R. Rivest. A digital signature scheme secure against adaptively chosen message attacks. SIAM Journal on Computing, 17(2): 281-308, 1988
9. S.D. Galbraith and K.G. Paterson and N.P. Smart. Pairings for cryptographers. IACR ePrint Archive, available at http://eprint.iacr.org/2006/ 165, 2006.
10. X. Huang, Y. Mu, W. Susilo, F. Zhang and X. Chen. A short proxy signature scheme: efficient authentication in the ubiquitous world. The Second International Symposium on Ubiquitous Intelligence and Smart Worlds (UISW2005), Lecture Notes in Computer Science 3823, pages. 480-489, Springer-Verlag, 2005.
11. J.-Y. Lee, J. H. Cheon and S. Kim. An analysis of proxy signatures: Is a secure channel necessary? In Topics in Cryptology - CT-RSA 2003, Lecture Notes in Computer Science 2612, pages. 68-79. Springer-Verlag, 2003.
12. B. Lee, H. Kim and K. Kim. Strong proxy signature and its applications. In Proc of SCIS'01, pages. 603-08. 2001.
13. B. Lee, H. Kim, and K. Kim. Secure mobile agent using strong nondesignated proxy signature. In Information Security and Privacy (ACISP01), Lecture Notes in Computer Science 2119, pages. 474-486. Springer-Verlag, 2001.
14. S. Kim, S. Park and D. Won. Proxy signatures, revisited. In Information and Communications Security (ICICS97), Lecture Notes in Computer Science 1334, pages. 223-232. Springer-Verlag, 1997.
15. M. Mambo, K. Usuda and E. Okamoto. Proxy signature: delegation of the power to sign messages. IEICE Trans. Fundamentals, Vol. E79-A, No. 9, Sep., pages. 1338-1353, 1996.
16. T. Okamoto, A. Inomata, and E. Okamoto. A proposal of short proxy signature using pairing. In International Conference on Information Technology (ITCC 2005), pages. 631-635. IEEE Computer Society, 2005.
17. T. Okamoto, M. Tada, and E. Okamoto. Extended proxy signatures for smart cards. In ISW 99, Lecture Notes in Computer Science 1729, pages. 247-258, Springer Verlag, 1999.
18. H.-U. Park and I.-Y. Lee. A digital nominative proxy signature scheme for mobile communications. In Information and Communications Security (ICICS 2001), Lecture Notes in Computer Science 2229, pages. 451-455, Springer-Verlag, 2001.
19. R. Waters. Efficient identity-based encryption without random oracles. In EUROCRYPT 2005, Lecture Notes in Computer Science 3494, pages. 114-127. Springer-Verlag, 2005.
20. G. Wang, F. Bao, J. Zhou and Robert H. Deng. Security analysis of some proxy signatures. In ICICS 2003, Lecture Notes in Computer Science 2971, pages. 305-319. Springer-Verlag, 2003.
21. R. Zhang, J. Furukawa and H. Imai. Short signature and universal designated verifier signature without random oracles. In Applied Cryptography and Network Security (ACNS 2005), Lecture Notes in Computer Science 3531, pages. 483-498. Springer-Verlag, 2005.
22. F. Zhang, R. Safavi-Naini, and W. Susilo. An efficient signature scheme from bilinear pairings and its applications. In Public Key Cryptography (PKC'04), Lecture Notes in Computer Science 2947, pages 277-290. Springer-Verlag, 2004.