Endre søk
Link to record
Permanent link

Direct link
Publikasjoner (4 av 4) Visa alla publikasjoner
Shen, S., Jia, X., Luo, M., Xu, Z. & Zhou, Z. (2026). Towards privacy preservation in smart grids via controlled redactable signatures. Journal of systems architecture, 172, Article ID 103688.
Åpne denne publikasjonen i ny fane eller vindu >>Towards privacy preservation in smart grids via controlled redactable signatures
Vise andre…
2026 (engelsk)Inngår i: Journal of systems architecture, ISSN 1383-7621, E-ISSN 1873-6165, Vol. 172, artikkel-id 103688Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

The smart grid provides a flexible interactive platform for energy stakeholders by sharing energy usage data to enhance management efficiency and service accuracy. However, such data are often highly sensitive and vulnerable to eavesdropping and tampering during transmission. Ensuring data authenticity, integrity and users’ privacy is therefore critical. Redactable signatures have emerged as a promising cryptographic primitive to address these concerns. Nonetheless, most existing redactable signature schemes lack fine-grained control over the redaction process, making them susceptible to unauthorized or malicious modifications. To address this issue, we propose an identity-based Controlled Redactable Signature Scheme (CRSS), enabling users to selectively disclose information under controlled conditions without revealing private information. We define a formal security model and prove that the proposed scheme achieves unforgeability, redaction controllability, privacy, and transparency. Furthermore, theoretical analysis and experimental evaluation demonstrate that our scheme offers superior efficiency and practicality compared to existing approaches.

sted, utgiver, år, opplag, sider
Elsevier BV, 2026
Emneord
Privacy preservation, Redactable signature, Redaction controllability, Smart grid
HSV kategori
Identifikatorer
urn:nbn:se:kth:diva-375708 (URN)10.1016/j.sysarc.2026.103688 (DOI)2-s2.0-105026665821 (Scopus ID)
Merknad

QC 20260119

Tilgjengelig fra: 2026-01-19 Laget: 2026-01-19 Sist oppdatert: 2026-01-19bibliografisk kontrollert
Zhou, Z., Jin, H. & Papadimitratos, P. (2025). Clogging DoS Resilient Bootstrapping of Efficient V2V Validation. In: 40th Annual ACM Symposium On Applied Computing: . Paper presented at 40th Symposium on Applied Computing-SAC, MAR 31-APR 04, 2025, Catania, ITALY (pp. 1857-1866). Association for Computing Machinery (ACM)
Åpne denne publikasjonen i ny fane eller vindu >>Clogging DoS Resilient Bootstrapping of Efficient V2V Validation
2025 (engelsk)Inngår i: 40th Annual ACM Symposium On Applied Computing, Association for Computing Machinery (ACM) , 2025, s. 1857-1866Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

In Vehicular Communication (VC) systems, neighboring vehicles exchange authenticated transportation safety messages, informing about own mobility and the environment. Verifying all received messages in a dense neighborhood introduces significant cryptographic computation overhead for resource-constrained vehicular On-Board Units (OBUs). Attackers can exploit this to launch Denial of Service (DoS) attacks to clog OBUs by broadcasting bogus messages at a high rate. This attack is particularly effective due to an inherent asymmetry and amplification factor: each safety message is to be validated by all receiving neighboring vehicles. This imbalance can lead to significant delays in sifting benign messages amidst a deluge of bogus messages. Even worse, failure to promptly verify a significant amount of benign messages can paralyze Vehicle-to-Vehicle (V2V) enabled applications. We address this challenge, proposing a mechanism that thwarts such attacks: puzzle-based pre-validation that prioritizes verification of potentially valid messages with yet unknown (i.e., unverified) Pseudonymous Certificates (PCs). Verification of such PCs (and their corresponding messages) can bootstrap the efficient pre-validation of follow-up messages authenticated by the same PCs. We show experimental results confirming our scheme can effectively mitigate unsophisticated clogging DoS attacks that do not attempt to solve puzzles. We further show our scheme also significantly raises the bar for sophisticated adversaries: it can be configured to force attackers to solve puzzles for their bogus messages actively - something possible only by investing in significantly higher (hundreds of times more) computational power than that of the targeted benign vehicles. Last but not least, our scheme can be adaptive while remaining compatible to standardized V2V security.

sted, utgiver, år, opplag, sider
Association for Computing Machinery (ACM), 2025
Emneord
Pseudonymous authentication, Puzzle, Neighbor discovery
HSV kategori
Identifikatorer
urn:nbn:se:kth:diva-368401 (URN)10.1145/3672608.3707914 (DOI)001497934400249 ()2-s2.0-105006438233 (Scopus ID)979-8-4007-0629-5 (ISBN)
Konferanse
40th Symposium on Applied Computing-SAC, MAR 31-APR 04, 2025, Catania, ITALY
Merknad

QC 20250818

Tilgjengelig fra: 2025-08-18 Laget: 2025-08-18 Sist oppdatert: 2025-08-18bibliografisk kontrollert
Jin, H., Zhou, Z. & Papadimitratos, P. (2024). Future-proofing Secure V2V Communication against Clogging DoS Attacks. In: ARES 2024 - 19th International Conference on Availability, Reliability and Security, Proceedings: . Paper presented at 19th International Conference on Availability, Reliability and Security, ARES 2024, Vienna, Austria, Jul 30 2024 - Aug 2 2024. Association for Computing Machinery (ACM), Article ID 94.
Åpne denne publikasjonen i ny fane eller vindu >>Future-proofing Secure V2V Communication against Clogging DoS Attacks
2024 (engelsk)Inngår i: ARES 2024 - 19th International Conference on Availability, Reliability and Security, Proceedings, Association for Computing Machinery (ACM) , 2024, artikkel-id 94Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Clogging Denial of Service (DoS) attacks have disrupted or disabled various networks, in spite of security mechanisms. External adversaries can severely harm networks, especially when high-overhead security mechanisms are deployed in resource-constrained systems. This can be especially true in the emerging standardized secure Vehicular Communication (VC) systems: mandatory message signature verification can be exploited to exhaust resources and prevent validating incoming messages sent by neighboring vehicles, information that is critical, often, for transportation safety. Efficient message verification schemes and better provisioned devices could serve as potential remedies, but existing solutions have limitations. We point out those and identify, challenges to address for scalable and resilient secure Vehicular Communication (VC) systems, and, most notably, the need for integrating defense mechanisms against clogging Denial of Service (DoS) attacks. We take the position that existing secure Vehicular Communication (VC) protocols are vulnerable to clogging Denial of Service (DoS) attacks and recommend symmetric key chain based pre-validation with mandatory signature verification to thwart clogging Denial of Service (DoS) attacks, while maintaining all key security properties, including non-repudiation to enable accountability.

sted, utgiver, år, opplag, sider
Association for Computing Machinery (ACM), 2024
Emneord
privacy, pseudonymous authentication, Security, vehicular communication
HSV kategori
Identifikatorer
urn:nbn:se:kth:diva-351968 (URN)10.1145/3664476.3670932 (DOI)001283894700181 ()2-s2.0-85200338275 (Scopus ID)
Konferanse
19th International Conference on Availability, Reliability and Security, ARES 2024, Vienna, Austria, Jul 30 2024 - Aug 2 2024
Merknad

Part of ISBN [9798400717185]

QC 20240830

Tilgjengelig fra: 2024-08-19 Laget: 2024-08-19 Sist oppdatert: 2025-12-05bibliografisk kontrollert
Yang, Y., Zhou, Z., Zhao, L. & Wang, X. (2023). Controller Sensitivity-Based Shaping Method for Grid Forming Inverter. In: 2023 IEEE Energy Conversion Congress and Exposition, ECCE 2023: . Paper presented at 2023 IEEE Energy Conversion Congress and Exposition, ECCE 2023, Nashville, United States of America, Oct 29 2023 - Nov 2 2023 (pp. 6273-6278). Institute of Electrical and Electronics Engineers (IEEE)
Åpne denne publikasjonen i ny fane eller vindu >>Controller Sensitivity-Based Shaping Method for Grid Forming Inverter
2023 (engelsk)Inngår i: 2023 IEEE Energy Conversion Congress and Exposition, ECCE 2023, Institute of Electrical and Electronics Engineers (IEEE) , 2023, s. 6273-6278Konferansepaper, Publicerat paper (Fagfellevurdert)
Abstract [en]

Parameter-based damping ratio sensitivity (DRS) is usually used for designing multi-loop complex control systems in grid-forming (GFM) inverters. However, it is found that this method will be affected not only by the interactions among parameters in a controller, but also by the change of the parameter itself, which makes the parameter design based on the parameter-based DRS unreliable. To address these issues, each controller is considered as a whole, which avoids the interactions among controller parameters in a controller. Then, the controller-based determinant sensitivity (DS) that calculates the sensitivity of each controller to system stability is proposed for designing the control system, which will not be affected by interactions among parameters since the sensitivity is calculated at the controller level. Then, combined with the proposed solution, a controller shaping method is also presented, which can improve system stability by shaping the controller. Finally, the effectiveness of the proposed scheme is validated through experimental results.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE), 2023
Emneord
controller sensitivity analysis, controller shaping, Grid-forming inverter
HSV kategori
Identifikatorer
urn:nbn:se:kth:diva-342809 (URN)10.1109/ECCE53617.2023.10362389 (DOI)2-s2.0-85182941019 (Scopus ID)
Konferanse
2023 IEEE Energy Conversion Congress and Exposition, ECCE 2023, Nashville, United States of America, Oct 29 2023 - Nov 2 2023
Merknad

Part of ISBN 9798350316445

QC 20240201

Tilgjengelig fra: 2024-01-31 Laget: 2024-01-31 Sist oppdatert: 2024-02-01bibliografisk kontrollert
Organisasjoner
Identifikatorer
ORCID-id: ORCID iD iconorcid.org/0000-0002-2022-1690