N.P. Smart and F. Vercauteren. On computable isomorphisms in e#cient pairing based systems. Cryptology ePrint Archive, Report 2005/116. 2005. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Pairings for Cryptographers - Galbraith, Paterson, Smart (2006) Self-citation (Smart) (Correct)
No context found.
N.P. Smart and F. Vercauteren. On computable isomorphisms in e#cient pairing based systems. Cryptology ePrint Archive, Report 2005/116. 2005.
The Eta Pairing Revisited - Hess, Smart, Vercauteren (2006) Self-citation (Smart Vercauteren) (Correct)
No context found.
N.P. Smart and F. Vercauteren. On computable isomorphisms in e#cient pairing based systems. Preprint, 2005.
Provable Efficient Certificateless Public Key Encryption - Shi, Li (2005) (Correct)
No context found.
Smart, N. and Vercauteren, F.,: On computable isomorphisms in e#cient pairing based systems. Cryptology ePrint Archive, Report 2005/116
On Security Proof of McCullagh-Barreto's Key Agreement Protocol .. - Cheng, Chen (2005) (Correct)
No context found.
N. Smart and F. Vercauteren. On computable isomorphisms in e#cient pairing based systems. Cryptology ePrint Archive, Report 2005/116.
Security Proof of Sakai-Kasahara's Identity-Based Encryption.. - Chen, Cheng (2005) (4 citations) (Correct)
No context found.
N. Smart and F. Vercauteren. On computable isomorphisms in e#cient pairing based systems. Cryptology ePrint Archive, Report 2005/116.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC