Zobrazeno 1 - 10
of 49
pro vyhledávání: '"Stanislaw Radziszowski"'
Publikováno v:
MILCOM 2022 - 2022 IEEE Military Communications Conference (MILCOM).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d75f8773ac60edc4a0148da90081e48d
https://doi.org/10.1109/milcom55135.2022.10017558
https://doi.org/10.1109/milcom55135.2022.10017558
Publikováno v:
2022 29th International Conference on Mixed Design of Integrated Circuits and System (MIXDES).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::95e66fdd24573c2ec2a1d0d17167ab57
https://doi.org/10.23919/mixdes55591.2022.9838004
https://doi.org/10.23919/mixdes55591.2022.9838004
Publikováno v:
MILCOM 2021 - 2021 IEEE Military Communications Conference (MILCOM).
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ae67153b5906eb0c38db49eb9dac7423
https://doi.org/10.1109/milcom52596.2021.9652958
https://doi.org/10.1109/milcom52596.2021.9652958
Autor:
Jason Blocklove, Michael Thomas Kurdziel, Marcin Lukowiak, Steve Farris, Stanislaw Radziszowski
Publikováno v:
MIXDES
At different stages of the Integrated Circuit (IC) lifecycle there are attacks which threaten to compromise the integrity of the design through piracy, reverse engineering, hardware Trojan insertion, side channel analysis, and other physical attacks.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::c6b5f5fc025f1f6b38cebf0276e046e8
https://doi.org/10.23919/mixdes52406.2021.9497537
https://doi.org/10.23919/mixdes52406.2021.9497537
Publikováno v:
Involve 12, no. 5 (2019), 813-822
Edge Folkman numbers [math] can be viewed as a generalization of more commonly studied Ramsey numbers. [math] is defined as the smallest order of any [math] -free graph [math] such that any red-blue coloring of the edges of [math] contains either a r
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2795535e89925d0632c201d0c079f212
https://doi.org/10.2140/involve.2019.12.813
https://doi.org/10.2140/involve.2019.12.813
Publikováno v:
2012 ASEE Annual Conference & Exposition Proceedings.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::9fbcd2bb9397abfba1628c249dd74c21
https://doi.org/10.18260/1-2--21178
https://doi.org/10.18260/1-2--21178
Publikováno v:
ReConFig
Homomorphic Encryption (HE) allows for encrypted data to be sent to, stored, and operated on by untrusted parties without the risk of privacy compromise. The benefits and applications of HE are far reaching, especially in regard to cloud computing. H
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f343ab053da44dd56edd6a010f4f9bde
https://doi.org/10.1109/reconfig48160.2019.8994790
https://doi.org/10.1109/reconfig48160.2019.8994790
Publikováno v:
Graphs and Combinatorics. 34:1101-1110
For an undirected simple graph $G$, we write $G \rightarrow (H_1, H_2)^v$ if and only if for every red-blue coloring of its vertices there exists a red $H_1$ or a blue $H_2$. The generalized vertex Folkman number $F_v(H_1, H_2; H)$ is defined as the
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ed1ad67294390c3499d68e2d4567393d
https://doi.org/10.1007/s00373-018-1935-3
https://doi.org/10.1007/s00373-018-1935-3
Publikováno v:
Discrete Applied Mathematics. 214:216-221
Let Δ s = R ( K 3 , K s ) − R ( K 3 , K s − 1 ) , where R ( G , H ) is the Ramsey number of graphs G and H defined as the smallest n such that any edge coloring of K n with two colors contains G in the first color or H in the second color. In 19
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::56e26242c344cbce142e10d9766f116a
https://doi.org/10.1016/j.dam.2016.06.003
https://doi.org/10.1016/j.dam.2016.06.003
Autor:
Stanislaw Radziszowski, Cody Tinker, Alan Kaminsky, Marcin Lukowiak, Michael Thomas Kurdziel, Kevin Millar
Publikováno v:
MILCOM
A Cross Domain Solution (CDS) is a means of secure information exchange that provides the ability to access or transfer digital data between varying security domains. Most existing CDS methods focus on risk management policies that rely on using prot
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::f3da0fa78bae77074ce522838a12188c
https://doi.org/10.1109/milcom47813.2019.9021015
https://doi.org/10.1109/milcom47813.2019.9021015