Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDVedad Hadzic
Person information
- unicode name: Vedad Hadžić
- affiliation: TU Graz, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j3]Vedad Hadzic, Gaëtan Cassiers, Robert Primas, Stefan Mangard, Roderick Bloem:
Quantile: Quantifying Information Leakage. IACR Trans. Cryptogr. Hardw. Embed. Syst. 2024(1): 433-456 (2024)- [i5]Simon Tollec, Vedad Hadzic, Pascal Nasahl, Mihail Asavoae, Roderick Bloem, Damien Couroussé, Karine Heydemann, Mathieu Jan, Stefan Mangard:
Fault-Resistant Partitioning of Secure CPUs for System Co-Verification against Faults. IACR Cryptol. ePrint Arch. 2024: 247 (2024) - 2022
- [j2]Vedad Hadzic
, Robert Primas, Roderick Bloem:
Proving SIFA protection of masked redundant circuits. Innov. Syst. Softw. Eng. 18(3): 471-481 (2022) - [c7]Roderick Bloem, Barbara Gigerl, Marc Gourjon, Vedad Hadzic, Stefan Mangard, Robert Primas:
Power Contracts: Provably Complete Power Leakage Models for Processors. CCS 2022: 381-395 - [c6]Vedad Hadzic, Roderick Bloem, Ankit Shukla, Martina Seidl:
FERPModels: A Certification Framework for Expansion-Based QBF Solving. SYNASC 2022: 80-83 - [i4]Roderick Bloem, Barbara Gigerl, Marc Gourjon, Vedad Hadzic, Stefan Mangard, Robert Primas:
Power Contracts: Provably Complete Power Leakage Models for Processors. IACR Cryptol. ePrint Arch. 2022: 565 (2022) - 2021
- [j1]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Two SAT solvers for solving quantified Boolean formulas with an arbitrary number of quantifier alternations. Formal Methods Syst. Des. 57(2): 157-177 (2021) - [c5]Vedad Hadzic, Robert Primas, Roderick Bloem:
Proving SIFA Protection of Masked Redundant Circuits. ATVA 2021: 249-265 - [c4]Vedad Hadzic, Roderick Bloem:
COCOALMA: A Versatile Masking Verifier. FMCAD 2021: 1-10 - [c3]Barbara Gigerl, Vedad Hadzic, Robert Primas, Stefan Mangard, Roderick Bloem:
Coco: Co-Design and Co-Verification of Masked Software Implementations on CPUs. USENIX Security Symposium 2021: 1469-1468 - [i3]Vedad Hadzic, Robert Primas, Roderick Bloem:
Proving SIFA Protection of Masked Redundant Circuits. CoRR abs/2107.01917 (2021) - 2020
- [c2]Moritz Lipp, Vedad Hadzic, Michael Schwarz, Arthur Perais, Clémentine Maurice, Daniel Gruss:
Take A Way: Exploring the Security Implications of AMD's Cache Way Predictors. AsiaCCS 2020: 813-825 - [i2]Barbara Gigerl, Vedad Hadzic, Robert Primas, Stefan Mangard, Roderick Bloem:
Coco: Co-Design and Co-Verification of Masked Software Implementations on CPUs. IACR Cryptol. ePrint Arch. 2020: 1294 (2020)
2010 – 2019
- 2018
- [c1]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. FMCAD 2018: 1-10 - [i1]Roderick Bloem, Nicolas Braud-Santoni, Vedad Hadzic, Uwe Egly, Florian Lonsing, Martina Seidl:
Expansion-Based QBF Solving Without Recursion. CoRR abs/1807.08964 (2018)
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-03-20 04:13 CET 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:
