Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Longwen Lan

dblp:357/3865 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
3since 2021 · last 2025
0009-0004-0930-7321ORCID · reported

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

Security and privacy · 2 · 2 since 2021Software engineering, systems software and programming languages · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Network and information security
3 papers
Cryptographic primitives and cryptanalysis · 61% Cryptographic protocols and secure computation · 22% Blockchain and cryptocurrency security · 18%
Theoretical computer science
1 paper
Algorithmic game theory and mechanism design · 100%

Topics — the 9 heaviest of 10, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Blockchain and cryptocurrency security
blockchain interoperability
0.912025
Multi-Signature and Game Based Blockchain Interoperability Oracle · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › public-key cryptography
digital signatures
0.912025
Multi-Signature and Game Based Blockchain Interoperability Oracle · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › public-key cryptography › digital signatures
multi-signature
0.912025
Multi-Signature and Game Based Blockchain Interoperability Oracle · IEEE Trans. Dependable Secur. Comput. 2025
Algorithmic game theory and mechanism design
incentive mechanism
0.912025
Multi-Signature and Game Based Blockchain Interoperability Oracle · IEEE Trans. Dependable Secur. Comput. 2025
Cryptographic primitives and cryptanalysis › hash functions
chameleon hash
0.712023
Chameleon Hash Based Efficiently Updatable Oblivious Key Management · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › public-key cryptography › public-key encryption
identity-based encryption
0.712023
Online/Offline and History Indexing Identity-Based Fuzzy Message Detection · IEEE Trans. Inf. Forensics Secur. 2023
Cryptographic protocols and secure computation
key management
0.712023
Chameleon Hash Based Efficiently Updatable Oblivious Key Management · IEEE Trans. Serv. Comput. 2023
Cryptographic protocols and secure computation › key management
oblivious key management
0.712023
Chameleon Hash Based Efficiently Updatable Oblivious Key Management · IEEE Trans. Serv. Comput. 2023
Cryptographic primitives and cryptanalysis › pseudorandom functions
verifiable random functions
0.712023
Online/Offline and History Indexing Identity-Based Fuzzy Message Detection · IEEE Trans. Inf. Forensics Secur. 2023

Methods — techniques the papers use, named apart from their topics

schnorr multisignature · 1.7repeated dynamic game · 1.7semidefinite relaxation · 0.7oblivious pseudorandom function · 0.7differential privacy · 0.7chameleon hash · 0.7
YearPublicationVenuePosition
2025 Multi-Signature and Game Based Blockchain Interoperability Oracle
abstract
To solve the problem of blockchain interoperability, we propose an efficient decentralization oracle solution. We design a subgroup Schnorr multisignature for the off-chain aggregation mechanism of our system, which is proven to be secure and robust. Compared with threshold signature-based schemes, the subgroup multisignature-based scheme does not require the execution of the distributed key generation protocol, which greatly reduces off-chain costs. The on-chain verification of the Schnorr signature is also more efficient than the pairing-based signatures. Then, we design a fair incentive mechanism to encourage the oracle nodes to work hard to validate the external data, which is based on a repeated dynamic game. Compared with the existing incentive mechanisms, our mechanism considers the real actions of each node to determine whether it should be rewarded or penalized. We implement our system over the Ethereum blockchain, and the experiments show its good performance.
Zhiwei Wang 0003, Siu-Ming Yiu, Longwen Lan
IEEE Trans. Dependable Secur. Comput.3
2023 Online/Offline and History Indexing Identity-Based Fuzzy Message Detection
abstract
Fuzzy message detection is a novel cryptographic primitive in which the remote storage cloud can help the client carry out fuzzy detections with some false-positive rate. This primitive protects the privacy of clients and does not reveal exactly the matching messages to the untrusted cloud. However, the existing public-key-based schemes require many public keys to generate a single flag ciphertext. This introduces heavy costs in terms of public-key certificate management. In this paper, we propose an efficient identity-based fuzzy message detection method based on a novel identity-based online/offline encryption scheme. All heavy cost computation operations are carried out in the offline phase without the knowledge of the identities for each message, and the single flag ciphertext can be generated quickly with the message’s identities since only light cost computations are required in the online phase. We apply our scheme to the blockchain-based fuzzy message detection systems. Additionally, we design a new history indexing scheme based on Dodis’ verifiable random function and Schnorr’s signature. The transactions history and order of accessing storage cloud (storing and detecting messages) are indexed, and signed by each client. We provide the analysis of privacy guarantees and differential privacy requirements for our online/offline ID-FMD scheme, and implement our FMD system over the Fibos platform and the Huawei Elastic Cloud.
Zhiwei Wang 0003, Feng Liu 0005, Siu-Ming Yiu, Longwen Lan
IEEE Trans. Inf. Forensics Secur.4
2023 Chameleon Hash Based Efficiently Updatable Oblivious Key Management
abstract
Updatable oblivious key management (UOKM) schemes are considered an important backbone of key management for large storage systems, which allows the key management server to periodically update all its clients’ ciphertexts stored in the remote storage cloud without interacting with the clients. All the encrypted data can only be decrypted by the current key (tag), which ensures security against forward and post compromise. In this paper, we propose two UOKM schemes: the first is public key-based, while the second is identity-based. Compared with Jarecki et al.'s UOKM scheme from oblivious pseudorandom functions, the implementations show that our chameleon hash-based schemes have faster updating processes. Moreover, our identity-based UOKM scheme does require ”heavy” public key certificate management and maintains a secure channel from the key management server to the storage cloud, which greatly enhances security and efficiency. Our proofs show that theunconditional obliviousandsecurityof our schemes are based on the security of chameleon hash functions.
Zhiwei Wang 0003, Longwen Lan, Siu-Ming Yiu
IEEE Trans. Serv. Comput.2