Mohammad Anagreh

According to our database, Mohammad Anagreh authored at least 9 papers between 2014 and 2022.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

2022

Privacy-Preserving Parallel Computation of Minimum Spanning Forest.

Mohammad Anagreh, Peeter Laud, Eero Vainikko

SN Comput. Sci., 2022

Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity.

Mohammad Anagreh, Peeter Laud, Eero Vainikko

Proceedings of the 8th International Conference on Information Systems Security and Privacy, 2022

A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem.

Mohammad Anagreh, Peeter Laud

Proceedings of the Data Privacy Management, Cryptocurrencies and Blockchain Technology, 2022

2021

Parallel Privacy-Preserving Shortest Path Algorithms.

Mohammad Anagreh, Peeter Laud, Eero Vainikko

Cryptogr., 2021

Parallel Privacy-Preserving Shortest Paths by Radius-Stepping.

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Proceedings of the 29th Euromicro International Conference on Parallel, 2021

Parallel Privacy-preserving Computation of Minimum Spanning Trees.

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Proceedings of the 7th International Conference on Information Systems Security and Privacy, 2021

2020

Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM.

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Proceedings of the 6th International Conference on Information Systems Security and Privacy, 2020

2019

Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing.

Mohammad Anagreh, Eero Vainikko, Peeter Laud

Proceedings of the 5th International Conference on Information Systems Security and Privacy, 2019

2014

Parallel method for computing elliptic curve scalar multiplication based on MOF.

Mohammad Anagreh, Azman Samsudin, Mohd. Adib Omar

Int. Arab J. Inf. Technol., 2014