Mohammad Anagreh

11 papers C 5Journal 5Unranked 1
YearRankTypeTitle / Venue / Authors
2024 J jnl
Security Proof of Single-Source Shortest Distance Protocols Built on Secure Multiparty Computation Protocols.
Cryptogr.
Mohammad Anagreh, Peeter Laud
2022 — conf
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem.
DPM/CBT@ESORICS
Mohammad Anagreh, Peeter Laud
2022 J jnl
A Parallel Privacy-Preserving Shortest Path Protocol from a Path Algebra Problem.
CoRR
Mohammad Anagreh, Peeter Laud
2022 J jnl
Privacy-Preserving Parallel Computation of Minimum Spanning Forest.
SN Comput. Sci.
Mohammad Anagreh, Peeter Laud, Eero Vainikko
2022 C conf
Privacy-preserving Parallel Computation of Shortest Path Algorithms with Low Round Complexity.
ICISSP
Mohammad Anagreh, Peeter Laud, Eero Vainikko
2021 J jnl
Parallel Privacy-Preserving Shortest Path Algorithms.
Cryptogr.
Mohammad Anagreh, Peeter Laud, Eero Vainikko
2021 C conf
Parallel Privacy-Preserving Shortest Paths by Radius-Stepping.
PDP
Mohammad Anagreh, Eero Vainikko, Peeter Laud
2021 C conf
Parallel Privacy-preserving Computation of Minimum Spanning Trees.
ICISSP
Mohammad Anagreh, Eero Vainikko, Peeter Laud
2020 C conf
Speeding Up the Computation of Elliptic Curve Scalar Multiplication based on CRT and DRM.
ICISSP
Mohammad Anagreh, Eero Vainikko, Peeter Laud
2019 C conf
Accelerate Performance for Elliptic Curve Scalar Multiplication based on NAF by Parallel Computing.
ICISSP
Mohammad Anagreh, Eero Vainikko, Peeter Laud
2014 J jnl
Parallel method for computing elliptic curve scalar multiplication based on MOF.
Int. Arab J. Inf. Technol.
Mohammad Anagreh, Azman Samsudin, Mohd. Adib Omar