Parallel method for computing elliptic curve scalar multiplication based on MOF. - Mohammad Anagreh; Azman Samsudin; Mohd. Adib Omar (Int. Arab J. Inf. Technol., 2014)

Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2019)

Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2020)

Parallel Privacy-preserving Computation of Minimum Spanning Trees. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (ICISSP, 2021)

Parallel Privacy-Preserving Shortest Paths by Radius-Stepping. - Mohammad Anagreh; Eero Vainikko; Peeter Laud (PDP, 2021)

Parallel Privacy-Preserving Shortest Path Algorithms. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (Cryptogr., 2021)

A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem. - Mohammad Anagreh; Peeter Laud (DPM/CBT@ESORICS, 2022)

Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (ICISSP, 2022)

Privacy-Preserving Parallel Computation of Minimum Spanning Forest. - Mohammad Anagreh; Peeter Laud; Eero Vainikko (SN Comput. Sci., 2022)

Security Proof of Single-Source Shortest Distance Protocols Built on Secure Multiparty Computation Protocols. - Mohammad Anagreh; Peeter Laud (Cryptogr., 2024)