Javad Mohajeri

Orcid: 0000-0003-1852-2926

According to our database1, Javad Mohajeri authored at least 64 papers between 1996 and 2024.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
HUAP: Practical Attribute-Based Access Control Supporting Hidden Updatable Access Policies for Resource-Constrained Devices.
ISC Int. J. Inf. Secur., January, 2024

2023
Two protocols for improving security during the authentication and key agreement procedure in the 3GPP networks.
Comput. Commun., November, 2023

Highly Efficient and Revocable CP-ABE with Outsourcing Decryption for IoT.
ISC Int. J. Inf. Secur., 2023

2022
A bit-vector differential model for the modular addition by a constant and its applications to differential and impossible-differential cryptanalysis.
Des. Codes Cryptogr., 2022

An Efficient and Physically Secure Privacy-Preserving Authentication Scheme for Vehicular Ad-hoc NETworks (VANETs).
IEEE Access, 2022

2021
Efficient Scalable Multi-Party Private Set Intersection Using Oblivious PRF.
IACR Cryptol. ePrint Arch., 2021

Analysis and Improvement of the SPACF Scheme in Vehicular Ad-hoc Networks.
Proceedings of the 18th International ISC Conference on Information Security and Cryptology, 2021

2020
A fully distributed hierarchical attribute-based encryption scheme.
Theor. Comput. Sci., 2020

A Key-Policy Attribute-Based Temporary Keyword Search scheme for Secure Cloud Storage.
IEEE Trans. Cloud Comput., 2020

GSLHA: Group-based Secure Lightweight Handover Authentication Protocol for M2M Communication.
ISC Int. J. Inf. Secur., 2020

Attribute-based fine-grained access control for outscored private set intersection computation.
Inf. Sci., 2020

A Bit-Vector Differential Model for the Modular Addition by a Constant.
IACR Cryptol. ePrint Arch., 2020

Improved Secure Efficient Delegated Private Set Intersection.
CoRR, 2020

An Efficient Anonymous Authentication Scheme Using Registration List in VANETs.
CoRR, 2020

2019
Biclique Cryptanalysis of Block Ciphers LBlock and TWINE-80 with Practical Data Complexity.
ISC Int. J. Inf. Secur., 2019

Provably secure and efficient PUF-based broadcast authentication schemes for smart grid applications.
Int. J. Commun. Syst., 2019

An Anonymous Attribute-based Access Control System Supporting Access Structure Update.
Proceedings of the 16th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2019

2018
Impossible Differential Cryptanalysis of Reduced-Round Midori64 Block Cipher (Extended Version).
ISC Int. J. Inf. Secur., 2018

On the Security of O-PSI: A Delegated Private Set Intersection on Outsourced Datasets (Extended Version).
ISC Int. J. Inf. Secur., 2018

Improved impossible differential and biclique cryptanalysis of HIGHT.
Int. J. Commun. Syst., 2018

A fully distributed revocable ciphertext-policy hierarchical attribute-based encryption without pairing.
IACR Cryptol. ePrint Arch., 2018

On the security of the hierarchical attribute based encryption scheme proposed by Wang et al.
CoRR, 2018

GSL-AKA: Group-based Secure Lightweight Authentication and Key Agreement Protocol for M2M Communication.
Proceedings of the 9th International Symposium on Telecommunications, 2018

2017
PUF-based solutions for secure communications in Advanced Metering Infrastructure (AMI).
Int. J. Commun. Syst., 2017

Impossible Differential Cryptanalysis of Reduced-Round Midori64 Block Cipher.
Proceedings of the 14th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2017

On the Security of O-PSI a Delegated Private Set Intersection on Outsourced Datasets.
Proceedings of the 14th International ISC (Iranian Society of Cryptology) Conference on Information Security and Cryptology, 2017

2016
A certificate-based proxy signature with message recovery without bilinear pairing.
Secur. Commun. Networks, 2016

An Attribute-Based Anonymous Broadcast Encryption Scheme with Adaptive Security in the Standard Model.
IACR Cryptol. ePrint Arch., 2016

Efficient and Provable Secure Anonymous Hierarchical Identity-based Broadcast Encryption (HIBBE) Scheme without Random Oracle.
IACR Cryptol. ePrint Arch., 2016

A secure attribute based keyword search scheme against keyword guessing attack.
Proceedings of the 8th International Symposium on Telecommunications, 2016

On the security of YRL, an anonymous broadcast encryption scheme.
Proceedings of the 8th International Symposium on Telecommunications, 2016

A multi sender attribute-based broadcast authentication scheme.
Proceedings of the 8th International Symposium on Telecommunications, 2016

2015
Identity-based universal re-encryption for mixnets.
Secur. Commun. Networks, 2015

A Generic Construction for Verifiable Attribute-based Keyword Search Schemes.
IACR Cryptol. ePrint Arch., 2015

2014
Low-Data Complexity Biclique Cryptanalysis of Block Ciphers With Application to Piccolo and HIGHT.
IEEE Trans. Inf. Forensics Secur., 2014

Impossible differential cryptanalysis of Piccolo lightweight block cipher.
Proceedings of the 11th International ISC Conference on Information Security and Cryptology, 2014

Security analysis of CLEFIA-128.
Proceedings of the 11th International ISC Conference on Information Security and Cryptology, 2014

2013
Introducing proxy zero-knowledge proof and utilization in anonymous credential systems.
Secur. Commun. Networks, 2013

Secure untraceable off-line electronic cash system.
Sci. Iran., 2013

Superpoly algebraic normal form monomial test on Trivium.
IET Inf. Secur., 2013

Identity based universal re-encryption for mix nets.
Proceedings of the 10th International ISC Conference on Information Security and Cryptology, 2013

Security analysis of an identity-based mix net.
Proceedings of the 10th International ISC Conference on Information Security and Cryptology, 2013

2012
On the multi _ chi-square tests and their data complexity.
ISC Int. J. Inf. Secur., 2012

Cryptanalysis of GSM encryption algorithm A5/1.
ISC Int. J. Inf. Secur., 2012

2011
Guess and Determine Attack on Bivium.
J. Inf. Process. Syst., 2011

Double voter perceptible blind signature based electronic voting protocol.
ISC Int. J. Inf. Secur., 2011

2010
A practical distinguisher for the Shannon cipher.
J. Syst. Softw., 2010

Provable Partial Key Escrow.
Int. J. Netw. Secur., 2010

Guess and Determine Attack on Trivium Family.
Proceedings of the IEEE/IFIP 8th International Conference on Embedded and Ubiquitous Computing, 2010

Distinguishing Attack on Bivium.
Proceedings of the 10th IEEE International Conference on Computer and Information Technology, 2010

2009
A Related Key Attack on the Feistel Type Block Ciphers.
Int. J. Netw. Secur., 2009

Cryptanalysis and Security Enhancement on the Generation of Mu-Varadharajan Electronic Voting Protocol.
IACR Cryptol. ePrint Arch., 2009

2008
Comparison Based Semantic Security is Probabilistic Polynomial Time Equivalent to Indistinguishability.
Int. J. Netw. Secur., 2008

Weak Composite Diffie-Hellman.
Int. J. Netw. Secur., 2008

Another security improvement over the Lin et al.'s electronic-voting scheme.
Int. J. Electron. Secur. Digit. Forensics, 2008

New Proxy Signature, Proxy Blind Signature and Blind Proxy Signature Based on the Okamoto Signature.
Proceedings of the 2008 International Conference on Security & Management, 2008

Security Modification for the Hwang-Wen-Hwang's E-voting Scheme.
Proceedings of the 2008 International Conference on Security & Management, 2008

2007
A New Public Key Encryption Scheme Equivalent to Factoring.
Proceedings of the 2007 International Conference on Security & Management, 2007

2005
On the Statistically Optimal Divide and Conquer Correlation Attack on the Shrinking Generator.
IACR Cryptol. ePrint Arch., 2005

A Verifiable Partial Key Escrow, Based on McCurley Encryption Scheme
Electron. Colloquium Comput. Complex., 2005

Weak Composite Diffie-Hellman is not Weaker than Factoring
Electron. Colloquium Comput. Complex., 2005

Relations between semantic security and indistinguishability against cpa, non-adaptive cca and adaptive cca in comparison based framework
CoRR, 2005

2004
A Provably Secure Short Transitive Signature Scheme from Bilinear Group Pairs.
Proceedings of the Security in Communication Networks, 4th International Conference, 2004

1996
A new universal test for bit strings.
Proceedings of the Information Security and Privacy, First Australasian Conference, 1996


  Loading...