default search action
Saleh Khalaj Monfared
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [i11]Saleh Khalaj Monfared, Domenic Forte
, Shahin Tajik:
RandOhm: Mitigating Impedance Side-channel Attacks using Randomized Circuit Configurations. CoRR abs/2401.08925 (2024) - [i10]Mohammad Sina Karvandi, Soroush Meghdadi Zanjani, Sima Arasteh, Saleh Khalaj Monfared, Mohammad K. Fallah, Saeid Gorgin, Jeong-A Lee, Erik van der Kouwe:
The Reversing Machine: Reconstructing Memory Assumptions. CoRR abs/2405.00298 (2024) - [i9]Saleh Khalaj Monfared, Kyle Mitard, Andrew Cannon, Domenic Forte, Shahin Tajik:
LaserEscape: Detecting and Mitigating Optical Probing Attacks. CoRR abs/2405.03632 (2024) - 2023
- [j4]Saleh Khalaj Monfared, Saeed Shokrollahi
DARVAN: A fully decentralized anonymous and reliable routing for VANets. Comput. Networks 223: 109561 (2023) - [j3]Tahoura Mosavirik, Saleh Khalaj Monfared, Maryam Saadat-Safa, Shahin Tajik:
Silicon Echoes: Non-Invasive Trojan and Tamper Detection using Frequency-Selective Impedance Analysis. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2023(4): 238-261 (2023) - [c7]Saleh Khalaj Monfared
LeakyOhm: Secret Bits Extraction using Impedance Analysis. CCS 2023: 1675-1689 - [i8]Saleh Khalaj Monfared, Tahoura Mosavirik, Shahin Tajik:
LeakyOhm: Secret Bits Extraction using Impedance Analysis. CoRR abs/2310.07014 (2023) - [i7]Tahoura Mosavirik, Saleh Khalaj Monfared, Maryam Saadat-Safa, Shahin Tajik:
Silicon Echoes: Non-Invasive Trojan and Tamper Detection using Frequency-Selective Impedance Analysis. IACR Cryptol. ePrint Arch. 2023: 75 (2023) - [i6]Saleh Khalaj Monfared, Tahoura Mosavirik, Shahin Tajik:
LeakyOhm: Secret Bits Extraction using Impedance Analysis. IACR Cryptol. ePrint Arch. 2023: 693 (2023) - 2022
- [c6]Mohammad Sina Karvandi, MohammadHosein Gholamrezaei, Saleh Khalaj Monfared, Soroush Meghdadi Zanjani, Behrooz Abbassi, Ali Amini, Reza Mortazavi, Saeid Gorgin, Dara Rahmati, Michael Schwarz:
HyperDbg: Reinventing Hardware-Assisted Debugging. CCS 2022: 1709-1723 - [i5]Mohammad Sina Karvandi, MohammadHosein Gholamrezaei, Saleh Khalaj Monfared, Suorush Medi, Behrooz Abbassi, Ali Amini, Reza Mortazavi, Saeid Gorgin, Dara Rahmati, Michael Schwarz:
HyperDbg: Reinventing Hardware-Assisted Debugging. CoRR abs/2207.05676 (2022) - 2021
- [j2]Saleh Khalaj Monfared, Omid Hajihassani, Vahid Mohsseni, Dara Rahmati, Saeid Gorgin
A High-throughput Parallel Viterbi Algorithm via Bitslicing. ACM Trans. Parallel Comput. 8(4): 19:1-19:25 (2021) - [c5]Mohammad Sina Karvandi, Saleh Khalaj Monfared, Mohammad Sina Kiarostami, Dara Rahmati, Saeid Gorgin:
A TSX-Based KASLR Break: Bypassing UMIP and Descriptor-Table Exiting. CRiSIS 2021: 38-54 - [c4]Mohammad Sina Kiarostami, Mohammad Reza Daneshvaramoli, Saleh Khalaj Monfared, Aku Visuri
On Using Monte-Carlo Tree Search to Solve Puzzles. ICCTA 2021: 18-26 - [c3]Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Mohammad Reza Daneshvaramoli, Negar Yousefian, Mahsa Massoud, Aku Visuri
Unlucky Explorer: A Complete non-Overlapping Map Exploration. WSSE 2021: 150-154 - 2020
- [c2]Saleh Khalaj Monfared, Omid Hajihassani, Mohammad Sina Kiarostami, Soroush Meghdadi Zanjani, Dara Rahmati
BSRNG: A High Throughput Parallel BitSliced Approach for Random Number Generators. ICPP Workshops 2020: 12:1-12:10 - [i4]Mohammad Sina Karvandi, Saleh Khalaj Monfared, Mohammad Sina Kiarostami, Dara Rahmati, Saeid Gorgin:
A Way Around UMIP and Descriptor-Table Exiting via TSX-based Side-Channel Attack. CoRR abs/2005.10333 (2020) - [i3]Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Mohammad Reza Daneshvaramoli, Ali Oliayi, Negar Yousefian, Dara Rahmati, Saeid Gorgin:
Unlucky Explorer: A Complete non-Overlapping Map Exploration. CoRR abs/2005.14156 (2020)
2010 – 2019
- 2019
- [j1]Omid Hajihassani
Fast AES Implementation: A High-Throughput Bitsliced Approach. IEEE Trans. Parallel Distributed Syst. 30(10): 2211-2222 (2019) - [c1]Mohammad Sina Kiarostami, Mohammad Reza Daneshvaramoli, Saleh Khalaj Monfared, Dara Rahmati
Multi-Agent non-Overlapping Pathfinding with Monte-Carlo Tree Search. CoG 2019: 1-4 - [i2]Saleh Khalaj Monfared, Omid Hajihassani, Soroush Meghdadi Zanjani, Sina Kiarostami, Dara Rahmati, Saeid Gorgin:
High-performance Cryptographically Secure Pseudo-random Number Generation via Bitslicing. CoRR abs/1909.04750 (2019) - [i1]Mohammad Reza Daneshvaramoli, Mohammad Sina Kiarostami, Saleh Khalaj Monfared, Helia Karisani, Hamed Khashehchi, Dara Rahmati, Saeid Gorgin, Amir Rahmati:
Decentralized Cooperative Communication-less Multi-Agent Task Assignment with Monte-Carlo Tree Search. CoRR abs/1910.12062 (2019)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: