1 February 2019 in Queen Mary Journal of Intellectual Property
The past three centuries have witnessed copyright owners competing with distributors for the flow of income generated by new technologies. However, users have largely been excluded from this cake-cutting copyright game. The neglect of users’ interests has posed a serious challenge in the user generated content (‘UGC’) age. New technologies have empowered users to create UGC, whereas the existing law entitles copyright owners to block users’ access to source materials and allows UGC platforms to exploit UGC without remuneration. This article proposes a two-pronged solution in attempting to strike a better balance between copyright owners, UGC platforms and UGC creators. The first is an ex-post remuneration rule that confers on UGC creators the legal right to use copyrighted work without asking for permission but imposes an obligation to pay remuneration, both of which pass to future UGC creators. This rule incorporates elements of Creative Commons and compulsory licensing as part of the copyright rules generally applicable to all UGC creators. The second solution proposes a community-based approach, which imposes upon UGC platforms a common-law duty of monitoring infringement and includes some legal standards that ensure fair implementation of the terms of use/service of UGC platforms.
16 April 2021 in PLOS ONE
Current cloud computing causes serious restrictions to safeguarding users’ data privacy. Since users’ sensitive data is submitted in unencrypted forms to remote machines possessed and operated by untrusted service providers, users’ sensitive data may be leaked by service providers. Program obfuscation shows the unique advantages that it can provide for cloud computing. In this paper, we construct an encrypted threshold signature functionality, which can outsource the threshold signing rights of users to cloud server securely by applying obfuscation, while revealing no more sensitive information. The obfuscator is proven to satisfy the average case virtual black box property and existentially unforgeable under the decisional linear (DLIN) assumption and computational Diffie-Hellman (CDH) assumption in the standard model. Moreover, we implement our scheme using the Java pairing-based cryptography library on a laptop.
25 November 2024 in Telecommunication Systems
26 December 2022 in Research Square
Linearly homomorphic signature (LHS) enables linear computation on signed data, and they have been investigated in many flavors and settings, e.g., for network coding to resist pollution attacks and computation on outsourced data. The security of traditional LHS depends entirely on the assumption that the secret signing key is completely secure. Exposure of signing keys requires updating all signatures that have been generated. However, as relatively insecure mobile devices are increasingly used in network coding and data outsourcing systems, the key exposure issue is becoming more prevalent. To reduce the hazard of key exposure in LHS setting, we integrate key update into LHS, and present forward secure linearly homomorphic signature (FSLHS). Specifically, we first formalize the definition and security notions for the FSLHS scheme, and give a concrete scheme. We then prove our proposed scheme to be forward secure against adaptively chosen message attack in cases where the adversary is able to forge two types of signatures, assuming the CDH hardness problem. Moreover, compared with previous related works, the performance analysis shows that all parameters of our scheme enjoy complexities of log magnitude with respect to the total number of time periods.
12 March 2026 in IEEE Transactions on Vehicular Technology
Vehicular Ad Hoc Networks (VANETs) enable vehicles to report traffic conditions through vehicle to vehicle and vehicle to roadside communication. Such reports help traffic management systems estimate congestion and guide routing. Two main challenges arise in practical VANETs. Heterogeneous cryptographic systems hinder secure cross-domain communication and threaten vehicle privacy. Meanwhile, traffic management requires efficient aggregation without revealing individual routes. This paper proposes LPHTA, a lightweight and privacy preserving traffic aggregation scheme for fog and cloud assisted VANETs. LPHTA integrates heterogeneous signcryption to support secure communication between CLC and PKI entities. It also uses Paillier homomorphic encryption to aggregate encrypted reports at fog nodes, enabling the cloud to obtain intersection level traffic statistics. LPHTA also provides conditional privacy, ensuring anonymity during normal reporting while enabling traceability when necessary. Formal security analysis shows that LPHTA achieves IND-CCA2 and EUF-CMA under the elliptic curve discrete logarithm problem assumption. Simulation results demonstrate low computational and communication overhead, as well as stable network performance in dense and high mobility vehicular environments. These results indicate that LPHTA is suitable for practical traffic management applications.
21 December 2022 in Research Square
The property that linearly homomorphic signature (LHS) enables linear computation on signed data makes this primitive commonly used to secure the network coding based application against pollution attacks. The security of LHS wholly depends on the security of secret signing keys; once a secret key is compromised, the application system’ security will be broken. However, as relatively insecure mobile devices are increasingly used in network coding application systems, the key exposure issue is becoming more prevalent. On the other hand, with the quantum technology development, some existing LHS schemes based on some traditional number-theoretic primitives are susceptible to quantum cryptanalysis. Hence, facing the dual threats of the exposure of secret keys in reality and the future effiffifficient quantum computers, we integrate forward security into LHS, and present a forward-secure identity-based LHS scheme (FSIBLHS) based on lattice assumptions, which achieves post-quantum security, and even if the current secret key is compromised, the validity of signatures of previous time periods is still guaranteed. We defifine the fifirst security model on forward security of LHS, and prove that the proposed scheme can resist adaptively chosen identity and datasets attack under lattice assumption. Moreover, compared with previous related works, the performance analysis shows that our scheme enjoys a comparable computation cost and has a lower communication cost, and provides higher security and stronger functionality.