Searcharxiv⌕ Search

arXiv subjects

Marius C. Silaghi

Publications and source records attributed to Marius C. Silaghi.

5 recordsLinked to original sources

The Environmental Cost of Digital Sovereignty: Water, Energy, and Emissions Impacts of Sovereign AI Infrastructure in the Global South

Sovereign AI has become a strategic priority across the Global South, with over \$200 billion in state-led commitments announced between 2024 and 2026. Yet the physical infrastructure that compute sovereignty demands, above all data centers, imposes water, energy, and carbon costs that fall hardest on countries least equipped to absorb them. This paper presents a comparative environmental stress analysis across four cases: the United Arab Emirates, Bangladesh, India, and Africa (with a focus on Kenya). Using publicly available water stress data, grid carbon intensity factors, and GPU power specifications, we model the water consumption, energy demand, and carbon emissions of hypothetical sovereign AI deployments under multiple cooling technology scenarios. We find that a 1,024-GPU cluster using evaporative cooling in the UAE would consume over 30 million liters of water annually in a country classified as ``extremely high'' water stress. In Bangladesh, sovereign AI policy documents call for centralized GPU procurement but do not address where to site data centers in a country where more than a fifth of the land floods in an average year and the power grid struggles to deliver reliable supply. We identify a sovereignty-sustainability trilemma in which no country can simultaneously maximize AI sovereignty, minimize environmental impact, and maintain affordable resource access for citizens. We propose design principles for environmentally responsible sovereign AI, including mandatory water usage effectiveness reporting, climate-vulnerability siting assessments, and a preference for frugal small language models over frontier pre-training in resource-constrained settings.

cs.CY↗

Speeding Up Elliptic Curve Multiplication with Mixed-base Representation for Applications to SIDH Ciphers

Elliptic curve multiplications can be improved by replacing the standard ladder algorithm's base 2 representation of the scalar multiplicand, with mixed-base representations with power-of-2 bases, processing the n bits of the current digit in one optimized step. For this purpose, we also present a new methodology to compute, for Weierstrass form elliptic curves in the affine plane, operations of the type mP+nQ where m and n are small integers. This provides implementations with the lower cost than previous algorithms, using only one inversion. In particular, the proposed techniques enable more opportunities for optimizing computations, leading to an important speed-up for applications based on elliptic curves, including the post-quantum cryptosystem Super Singular Isogeny Diffie Hellman (SIDH).

cs.CR↗

Privacy of Existence of Secrets: Introducing Steganographic DCOPs and Revisiting DCOP Frameworks

Here we identify a type of privacy concern in Distributed Constraint Optimization (DCOPs) not previously addressed in literature, despite its importance and impact on the application field: the privacy of existence of secrets. Science only starts where metrics and assumptions are clearly defined. The area of Distributed Constraint Optimization has emerged at the intersection of the multi-agent system community and constraint programming. For the multi-agent community, the constraint optimization problems are an elegant way to express many of the problems occurring in trading and distributed robotics. For the theoretical constraint programming community the DCOPs are a natural extension of their main object of study, the constraint satisfaction problem. As such, the understanding of the DCOP framework has been refined with the needs of the two communities, but sometimes without spelling the new assumptions formally and therefore making it difficult to compare techniques. Here we give a direction to the efforts for structuring concepts in this area.

cs.MA↗

The Device War - The War Between IOT Brands In A Household

Users buy compatible IOT devices from different brands with an expectation that their cooperation is smooth, but while function may superficially look friendly, cohabitation can subversively cause early battery depletion in competitor devices. The Wi-Fi Direct standard was introduced with the intention of simplifying peer-to-peer connections in home applications while helping devices to save power through centralization of effort into a single group owner device negotiated on start-up. Attacks on the group formation stage can be based on manipulating a victim device to frequently end up being assigned the group owner function, thereby depleting its batteries at faster rates than its peer devices. This manipulation is made easy by the group formation mechanism adopted by the standard. We show that group formation procedures could be better secured with features ensuring fairness by relying on commitments and by learning about the behavior observed for peer devices in the past. Simulations are used to quantify the resistance achieved against several attack strategies.

cs.NI↗

Recommending the Most Encompassing Opposing and Endorsing Arguments in Debates

Arguments are essential objects in DirectDemocracyP2P, where they can occur both in association with signatures for petitions, or in association with other debated decisions, such as bug sorting by importance. The arguments of a signer on a given issue are grouped into one single justification, are classified by the type of signature (e.g., supporting or opposing), and can be subject to various types of threading. Given the available inputs, the two addressed problems are: (i) how to recommend the best justification, of a given type, to a new voter, (ii) how to recommend a compact list of justifications subsuming the majority of known arguments for (or against) an issue. We investigate solutions based on weighted bipartite graphs.

cs.AI↗