| 1. |
- Akil, Mahdi, et al.
(författare)
-
A Privacy-Preserving Approach to Vehicle Renting and Driver Accountability in VANETs
- 2024
-
Ingår i: Privacy and Identity Management. Sharing in a Digital World. - : Springer. - 9783031579776 - 9783031579783 ; , s. 192-210
-
Konferensbidrag (refereegranskat)abstract
- Vehicular Ad Hoc Networks (VANETs) play a crucial rolein the evolution of Intelligent Transportation Systems. The problems ofrenting and drivers’ accountability still need to be answered in VANETs.Existing proposals do not consider renting vehicles, and there is nodistinction between renters and owners. This paper proposes privacy-preserving rental and accountability protocols to address these problems.The proposed rental protocol outputs an agreement between an ownerand a renter, which allows the renter to unlock and drive the vehicle.The privacy-preserving accountability protocol offers a robust solutionfor detecting and mitigating malicious behavior in VANETs. It provides aplatform for holding entities accountable for their actions without violating their privacy. The paper demonstrates that our solution successfullymeets the pre-set security and privacy requirements in VANETs. Thesefindings suggest promising potential for improving future vehicular networks’ safety, efficiency, and performance.
|
|
| 2. |
- Akil, Mahdi, et al.
(författare)
-
Non-Interactive Privacy-Preserving Sybil-Free Authentication Scheme in VANETs
- 2023
-
Ingår i: Network and Distributed System Security (NDSS) Symposium. - Reston, VA : Internet Society. - 1891562886
-
Konferensbidrag (refereegranskat)abstract
- In vehicular ad hoc networks (VANETs), vehicles exchange messages to improve traffic and passengers’ safety. In VANETs, (passive) adversaries can track vehicles (and their drivers) by analyzing the data exchanged in the network. The use of privacy-enhancing technologies can prevent vehicle tracking but solutions so far proposed either require an intermittent connection to a fixed infrastructure or allow vehicles to generate concurrent pseudonyms which could lead to identity-based (Sybil) attacks. In this paper, we propose an anonymous authentication scheme that does not require a connection to a fixed infrastructure during operation and is not vulnerable to Sybil attacks. Our scheme is built on attribute-based credentials and short lived pseudonyms. In it, vehicles interact with a central authority only once, for registering themselves, and then generate their own pseudonyms without interacting with other devices, or relying on a central authority or a trusted third party. The pseudonyms are periodically refreshed, following system wide epochs.
|
|
| 3. |
- Fischer-Hübner, Simone, 1963-, et al.
(författare)
-
Privacy-Enhancing Technologies and Anonymisation in Light of GDPR and Machine Learning
- 2023
-
Ingår i: Privacy and Identity Management. - : Springer. ; , s. 11-20
-
Konferensbidrag (refereegranskat)abstract
- The use of Privacy-Enhancing Technologies in the field of data anonymisation and pseudonymisation raises a lot of questions with respect to legal compliance under GDPR and current international data protection legislation. Here, especially the use of innovative technologies based on machine learning may increase or decrease risks to data protection. A workshop held at the IFIP Summer School on Privacy and Identity Management showed the complexity of this field and the need for further interdisciplinary research on the basis of an improved joint understanding of legal and technical concepts.
|
|
| 4. |
|
|
| 5. |
- Hoepman, Jaap-Henk, et al.
(författare)
-
Secure and Self-stabilizing Clock Synchronization in Sensor Networks
- 2009
-
Ingår i: Prooceedings of the 9th Scandinavian Workshop on Wireless Ad-hoc Networks (Adhoc 2009). ; , s. 78-82
-
Konferensbidrag (refereegranskat)abstract
- In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the clock synchronization by intercepting messages, replaying intercepted messages (after the adversary's choice of delay), and capturing nodes (i.e., revealing their secret keys and impersonating them). We present the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to such an adversary's attacks. Our algorithm tolerates random media noise, guarantees with high probability efficient communication overheads, and facilitates a variety of masking techniques against pulse-delay attacks in the presence of captured nodes.
|
|
| 6. |
- Hoepman, Jaap-Henk, et al.
(författare)
-
Secure and Self-Stabilizing Clock Synchronization in Sensor Networks
- 2007
-
Ingår i: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). - 1611-3349 .- 0302-9743. - 9783540766261 ; 4838/2007, s. 340-356
-
Konferensbidrag (refereegranskat)abstract
- In sensor networks, correct clocks have arbitrary starting offsetsand nondeterministic fluctuating skews. We consider an adversarythat aims at tampering with the clock synchronization by interceptingmessages, replaying intercepted messages (after the adversary’s choiceof delay), and capturing nodes (i.e., revealing their secret keys and impersonatingthem). We present the first self-stabilizing algorithm for secureclock synchronization in sensor networks that is resilient to suchan adversary’s attacks. Our algorithm tolerates random media noise,guarantees with high probability efficient communication overheads, andfacilitates a variety of masking techniques against pulse-delay attacks inthe presence of captured nodes.
|
|
| 7. |
- Hoepman, Jaap-Henk, et al.
(författare)
-
Secure and Self-stabilizing Clock Synchronization in Sensor Networks
- 2010
-
Ingår i: Theoretical Computer Science. - : Elsevier BV. - 0304-3975. ; 412:40, s. 5631-5647
-
Tidskriftsartikel (refereegranskat)abstract
- In sensor networks, correct clocks have arbitrary starting offsets and nondeterministic fluctuating skews. We consider an adversary that aims at tampering with the clock synchronization by intercepting messages, replaying intercepted messages (after the adversary’s choice of delay), and capturing nodes (i.e., revealing their secret keys and impersonating them). We present an efficient clock sampling algorithm which tolerates attacks by this adversary, collisions, a bounded amount of losses due to ambient noise, and a bounded number of captured nodes that can jam, intercept, and send fake messages. The algorithm is self-stabilizing, so if these bounds are temporarily violated, the system can efficiently stabilize back to a correct state. Using this clock sampling algorithm, we construct the first self-stabilizing algorithm for secure clock synchronization in sensor networks that is resilient to the aforementioned adversarial attacks.
|
|
| 8. |
- Hoepman, Jaap-Henk, et al.
(författare)
-
Self-Stabilization in Wait-Free Shared Memory Objects
- 2002
-
Ingår i: Journal of Parallel and Distributed Computing. - : Elsevier BV. - 1096-0848 .- 0743-7315. ; 62:5, s. 818-842
-
Tidskriftsartikel (refereegranskat)abstract
- This paper proposes a general definition of self-stabilizing wait-free shared memory objects. The definition ensures that, even in the face of processor failures, every execution after a transient memory failure is linearizable except for an a priori bounded number of actions. Shared registers have been used extensively as communication medium in self-stabilizing protocols. As an application of our theory, we therefore focus on self-stabilizing implementation of such registers, thus providing a large body of previous research with a more solid foundation. In particular, we prove that one cannot construct a self-stabilizing single-reader single-writer regular bit from self-stabilizing single-reader single-writer safe bits, using only a single bit for the writer. This leads us to postulate a self-stabilizing dual-reader single-writer safe bit as the minimal hardware needed to achieve self-stabilizing wait-free interprocess communication and synchronization. Based on this hardware, adaptations of well-known wait-free implementations of regular and atomic shared registers are proven to be self-stabilizing.
|
|
| 9. |
- Hoepman, Jaap-Henk
(författare)
-
Two faces of blindness
- 2023
-
Ingår i: Designs, Codes and Cryptography. - : Springer. - 0925-1022 .- 1573-7586. ; 91:8, s. 2705-2721
-
Tidskriftsartikel (refereegranskat)abstract
- Blind signatures are a decades-old privacy enhancing technology. It is not always clearly understood that blind signatures actually possess two separate properties: the intuitive understanding that the message to be signed is hidden from the signer, and the fact that the resulting signature is unlinkable (meaning that the signer cannot later tell in which session it created a particular signature). The question is: how exactly should these properties be defined, and can they be defined in a natural way such that they are mutually independent yet together imply blindness? In this paper we study this question, present formal definitions for message indistinguishability and signature unlinkability (and a few more related ones), and study their relationships. We show that these two properties are indeed mutually independent. Unfortunately their union is not equivalent to blindness in what appear to be only pathological cases.
|
|
| 10. |
- Pallas, Frank, et al.
(författare)
-
Privacy Engineering From Principles to Practice : A Roadmap
- 2024
-
Ingår i: IEEE Security and Privacy. - : Institute of Electrical and Electronics Engineers (IEEE). - 1540-7993 .- 1558-4046. ; 22:2, s. 86-92
-
Tidskriftsartikel (refereegranskat)abstract
- Privacy engineering is gaining momentum in industry and academia alike. So far, manifold low-level primitives and higher-level methods and strategies have successfully been established. Still, fostering adoption in real-world information systems calls for additional aspects to be consciously considered in research and practice.
|
|
