Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Kooshiar Azimian
2010 – today
- 2010
[j2]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh, Samuel S. Wagstaff Jr.: Provable Partial Key Escrow. I. J. Network Security 10(2): 121-124 (2010)
2000 – 2009
- 2008
- [j1]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh: Weak Composite Diffie-Hellman. I. J. Network Security 7(3): 383-387 (2008)
- [c2]
- 2007
- [c1]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh: A New Public Key Encryption Scheme Equivalent to Factoring. Security and Management 2007: 546-552
- 2005
- [i6]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh, Siamak Fayyaz Shahandashti: A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme. CoRR abs/cs/0505055 (2005)
- [i5]Ali Bagherzandi, Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh: Relations between semantic security and indistinguishability against cpa, non-adaptive cca and adaptive cca in comparison based framework. CoRR abs/cs/0508110 (2005)
- [i4]Kooshiar Azimian, Mahmoud Salmasizadeh, Javad Mohajeri: Weak Composite Diffie-Hellman is not Weaker than Factoring. Electronic Colloquium on Computational Complexity (ECCC)(047) (2005)
- [i3]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh, Siamak Fayyaz Shahandashti: A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme. Electronic Colloquium on Computational Complexity (ECCC)(078) (2005)
- [i2]Kooshiar Azimian: Breaking Diffie-Hellman is no Easier than Root Finding. Electronic Colloquium on Computational Complexity (ECCC)(124) (2005)
- [i1]Kooshiar Azimian, Javad Mohajeri, Mahmoud Salmasizadeh: Weak Composite Diffie-Hellman is not Weaker than Factoring. IACR Cryptology ePrint Archive 2005: 111 (2005)
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-01-15 19:09 CET by the dblp team