EDBT 2026 Demo / reviewers in the wild / expert
Yile Chen 0007
dblp:424/4107
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
0009-0002-8929-8829ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Computer networks · 1 · 1 first-author · 1 since 2021Security and privacy · 1 · 1 first-author · 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
1 paper |
Blockchain and cryptocurrency security · 70% Cryptographic primitives and cryptanalysis · 30% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Blockchain and cryptocurrency security
off-chain payment |
1.0 | 1 | 2026 | Secure Off-Chain Payment Protocol From Ciphertext Unlinkable Autonomous Path Proxy Re-Encryption in Blockchain · IEEE Trans. Inf. Forensics Secur. 2026 |
Blockchain and cryptocurrency security
payment channel network |
1.0 | 1 | 2026 | Secure Off-Chain Payment Protocol From Ciphertext Unlinkable Autonomous Path Proxy Re-Encryption in Blockchain · IEEE Trans. Inf. Forensics Secur. 2026 |
Cryptographic primitives and cryptanalysis
proxy re-encryption |
1.0 | 1 | 2026 | Secure Off-Chain Payment Protocol From Ciphertext Unlinkable Autonomous Path Proxy Re-Encryption in Blockchain · IEEE Trans. Inf. Forensics Secur. 2026 |
Blockchain and cryptocurrency security › smart contract
hashed timelock contracts |
0.3 | 1 | 2026 | Secure Off-Chain Payment Protocol From Ciphertext Unlinkable Autonomous Path Proxy Re-Encryption in Blockchain · IEEE Trans. Inf. Forensics Secur. 2026 |
Methods — techniques the papers use, named apart from their topics
random oracle model · 1.0DBDH assumption · 1.0CUAP-PRE · 1.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Generalized Collusion and Hop-Skipping Resistant Autonomous Path Proxy Re-Encryption for BlockchainabstractBlockchain has become a superior carrier for data storage due to its decentralization and immutability. How to realize privacy-preserving data sharing and controlled transfer of blockchain data access rights has become a challenging issue. Autonomous path proxy re-encryption allows the delegator to designate a series of delegatees to obtain decryption privileges according to a predefined sequence in a multi-hop manner. However, it faces the hop-skipping issue, where a malicious proxy can directly re-encrypt the ciphertext to the delegatees several hops afterwards, by skipping one or more delegatees in between, destroying the decryption privileges of the skipped delegatees. Furthermore, the intrinsic nature of proxy re-encryption makes it vulnerable to collusion attack, wherein the proxy and a delegatee might collude to construct a decryption device which can decrypt all the delegator’s ciphertexts, posing a serious threat to the delegator’s privacy. To address these challenging issues, we propose a generalized collusion and hop-skipping resistant autonomous path proxy re-encryption for blockchain (CHRAP-PRE). First, we decentralize the proxy’s privileges of re-encrypting ciphertexts to resist collusion attack. Second, we carefully design the decryption token mechanism so that only the person who gets the correct token can do the decryption, which is authorized by all previous persons in the path, thus controlling the decryption privileges to solve the hop-skipping problem. Finally, we formally prove that our proposed CHRAP-PRE achieves IND-HRA security under the Decisional Bilinear Diffie-Hellman (DBDH) assumption, resisting both collusion and hop-skipping attacks. Our comprehensive performance evaluation demonstrates that our scheme offers enhanced security while reducing communication overhead compared to the state-of-the-art. Yile Chen 0007, Jun Zhou 0018, Zhenfu Cao, Xiaolei Dong, Chunpeng Ge 0001 |
IEEE Internet Things J. | 1 |
| 2026 | Secure Off-Chain Payment Protocol From Ciphertext Unlinkable Autonomous Path Proxy Re-Encryption in BlockchainabstractSecure off-chain payment plays an important role in blockchain ecosystems, requiring atomicity guarantees where either all payment channels update their balances or none do. While the Lightning Network achieves this through multi-hop Hash Time-Lock Contracts (HTLCs), a critical flaw persists. Specifically, contract conditions (e.g., hash preimages) are transmitted in plaintext across payment paths. Consequently, malicious intermediate nodes can launch interception attacks by claiming funds from predecessors without releasing the corresponding coins to successors. To mitigate this risk, we propose a secure off-chain payment protocol. Firstly, a new cryptographic primitive, namely ciphertext unlinkable autonomous path proxy re-encryption scheme (CUAP-PRE), is proposed. Unlike traditional multi-hop proxy re-encryption, it prevents malicious nodes by enabling the delegator to designate all delegatees he trusts. In addition, ciphertext unlinkability resists homology inference attacks and delegation path tracing to ensure anonymity. Building on CUAP-PRE, a secure off-chain payment protocol (SOCP) in blockchain is designed with an enhanced multi-hop Hash Time-Lock Contract of the Payment-Channel Network (PCN). The receiver at the end of one path of payment channel can control the decryption rights of payment condition in multi-hop delegation manner with reversed order, to unlock the corresponding bitcoins on hold. We then present formal security proofs to demonstrate that the proposed CUAP-PRE and SOCP are postcompromise secure under the Decisional Bilinear Diffie-Hellman (DBDH) assumption in the random oracle model. Comprehensive evaluations also demonstrate the effectiveness and practicability of our proposal. Yile Chen 0007, Jun Zhou 0018, Zhenfu Cao, Xiaolei Dong, Kim-Kwang Raymond Choo |
IEEE Trans. Inf. Forensics Secur. | 1 |