Ruxandra F. Olimid

dblp:127/3282 · DBLP profile ↗
← Back
8ranked-venue papers
1as first author
3since 2021 · last 2026
0000-0003-3563-9851ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Security and privacy · 6 · 1 first-author · 2 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1Theory of computation · 1
YearPublicationVenuePosition
2026 On Addressing Isolation in Blockchain-Based Self-Sovereign Identity
Andreea-Elena Dragnoiu, Andrei Ciobanu, Ruxandra F. Olimid
ICISSP (1)3
2026 Multi-objective 5G-MEC service relocation: A joint view on performance, availability, and privacy
Annisa Sarah, Gianfranco Nencioni, Ruxandra F. Olimid
Future Gener. Comput. Syst.3
2025 Secret Sharing in 5G-MEC: Applicability for joint Security and Dependability
abstract
Multi-access Edge Computing (MEC), an enhancement of 5G, processes data closer to its generation point, reducing latency and network load. However, the distributed and edge-based nature of 5G-MEC presents privacy and security challenges, including data exposure risks. Ensuring efficient manipulation and security of sensitive data at the edge is crucial. To address these challenges, we investigate the usage of threshold secret sharing in 5G-MEC storage, an approach that enhances both security and dependability. A (k,n) threshold secret sharing scheme splits and stores sensitive data among n nodes, requiring at least k nodes for reconstruction. The solution ensures confidentiality by protecting data against fewer than k colluding nodes and enhances availability by tolerating up to n – k failing nodes. This approach mitigates threats such as unauthorized access and node failures, whether accidental or intentional. We further discuss a method for selecting the convenient MEHs to store the shares, considering the MEHs’ trustworthiness level as a main criterion. Although we define our proposal in the context of secret-shared data storage, it can be seen as an independent, standalone selection process for 5G-MEC trustworthy node selection in other scenarios too.
Thilina Pathirana, Ruxandra F. Olimid
PST2
2020 Analysis of uPort Open, an Identity Management Blockchain-Based Solution
Andreea-Elena Panait, Ruxandra F. Olimid, Alin Stefanescu
TrustBus2
2020 On cryptographic anonymity and unpredictability in secret sharing
Anat Paskin-Cherniavsky, Ruxandra F. Olimid
Inf. Process. Lett.2
2017 Experimental Assessment of Private Information Disclosure in LTE Mobile Networks
Stig Fr. Mjølsnes, Ruxandra F. Olimid
SECRYPT2
2016 SETUP in secret sharing schemes using random values
abstract
Abstract Secret sharing schemes divide a secret among multiple participants so that only authorized subsets of parties can reconstruct it. We show that secretly embedded trapdoor with universal protection attack can be embedded in secret sharing schemes that employ enough randomness to give the attacker an overwhelming advantage to access the secret. In case of ideal schemes, a coalition of a few participants (within at least one is the attacker) can succeed the attack, while in case of non‐ideal schemes, the attacker's knowledge can be enough to reveal the secret. We exemplify the attack against Shamir's threshold scheme, which is the most well known and used secret sharing scheme. Finally, we consider some prevention techniques against the proposed attack. Copyright © 2017 John Wiley & Sons, Ltd.
Ruxandra F. Olimid
Secur. Commun. Networks1
2015 Security of Linear Secret-Sharing Schemes Against Mass Surveillance
Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci
CANS2