Create accountLogin

Recent searches

No recent searches

Search options

Only available when logged in.
mastodon.social is one of the many independent Mastodon servers you can use to participate in the fediverse.
The original server operated by the Mastodon gGmbH non-profit

Administered by:

Server stats:

334K
active users

mastodon.social: AboutStatusProfiles directoryPrivacy policy

Mastodon: AboutGet the appKeyboard shortcutsView source codev4.4.0-nightly.2025-04-01

#csp

6 posts6 participants0 posts today
Public
GripNews

🌘 強化 Firefox 前端安全防護：內容安全策略
➤ 透過內容安全策略強化 Firefox 前端安全
✤ attackanddefense.dev/2025/04/0
Firefox 的使用者介面，包含網址列和分頁列等，使用 HTML、CSS 及 JavaScript 等網頁技術建構。如同許多網頁應用程式一樣，Firefox 易受注入攻擊，尤其是跨網站指令碼攻擊 (XSS)。為了提升安全性，Firefox 團隊已移除瀏覽器主介面 (browser.xhtml) 中超過 600 個內聯事件處理器，並導入內容安全策略 (CSP) 來限制可執行的腳本，大幅降低潛在攻擊面。此項強化措施將於 Firefox 138 版本中推出，團隊也計畫將此技術擴展至其他介面。
+ 聽起來 Firefox 的安全性又提升了一層，這對使用者來說是個好消息！
+ 移除這麼多事件處理器，應該需要花費不少時間和精

Attack & Defense · Hardening the Firefox Frontend with Content Security PoliciesMost of the Firefox User Interface (UI), including the address bar and the tab strip, are implemented using standard web technologies like HTML, CSS and JavaScript plus some additional custom components like XUL. One of the advantages of using web technologies for the front end is that it allows rendering the frontend using the browser engine on all desktop operating systems. However, just like many web applications are susceptible to some form of injection attack (OWASP Top Ten), Firefox’s use of web technologies for the frontend makes it no exception and hence it is vulnerable to injection attacks as well.
Public
arXiv cs.CC bot

Dichotomies for \#CSP on graphs that forbid a clique as a minor

Boning Meng, Yicheng Pan
arxiv.org/abs/2504.01354 arxiv.org/pdf/2504.01354 arxiv.org/html/2504.01354

arXiv:2504.01354v1 Announce Type: new
Abstract: We prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomies give a complete characterization of the complexity of \#CSP on graph classes that forbid a complete graph as a minor. In particular, we also demonstrate that, whether the maximum degree of vertices is bounded may influence the complexity on specific minor-closed graph classes, and this phenomenon has never been observed in the previous related studies. Furthermore, our proofs integrate the properties of each graph class with the techniques from counting complexity, and develop a systematic approach for analyzing the complexity of \#CSP on these graph classes.

arXiv logo
arXiv.orgDichotomies for \#CSP on graphs that forbid a clique as a minorWe prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomies give a complete characterization of the complexity of \#CSP on graph classes that forbid a complete graph as a minor. In particular, we also demonstrate that, whether the maximum degree of vertices is bounded may influence the complexity on specific minor-closed graph classes, and this phenomenon has never been observed in the previous related studies. Furthermore, our proofs integrate the properties of each graph class with the techniques from counting complexity, and develop a systematic approach for analyzing the complexity of \#CSP on these graph classes.
Public
TCS blog aggregator

Dichotomies for #CSP on graphs that forbid a clique as a minor arxiv.org/abs/2504.01354v1

Authors: Boning Meng, Yicheng PanWe prove complexity dichotomies for #CSP problems (not necessarily
symmetric) with Boolean domain and complex range on several typical
minor-closed graph classes. These dichotomies give a complete characterization
of the complexity of #CSP on graph classes that forbid a complete graph as a
minor. In particular, we also demonstrate that, whether the maximum

arXiv logo
arXiv.orgDichotomies for \#CSP on graphs that forbid a clique as a minorWe prove complexity dichotomies for \#CSP problems (not necessarily symmetric) with Boolean domain and complex range on several typical minor-closed graph classes. These dichotomies give a complete characterization of the complexity of \#CSP on graph classes that forbid a complete graph as a minor. In particular, we also demonstrate that, whether the maximum degree of vertices is bounded may influence the complexity on specific minor-closed graph classes, and this phenomenon has never been observed in the previous related studies. Furthermore, our proofs integrate the properties of each graph class with the techniques from counting complexity, and develop a systematic approach for analyzing the complexity of \#CSP on these graph classes.
Public
🖌️Eibhé🔪 Horror Art

WIP for a Thomas Hewitt concept skin for The Cannibal in Dead By Daylight. Unfortunately the chapter's no longer available for The Cannibal, but the skin likely would not be added due to licensing issues between studios/directors anyways :< I'm still working on it for fun and to hope that someday it could be added as a skin

ExploreLive feeds
About