Dawei Li 0009

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with Yuan Lu 0001

> Home > Persons > Dawei Li 0009

Publications

2025
[j26]
- view
  authority control:
- export record
  dblp key:
  - journals/tdsc/XingLWGLLLS25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tdsc/XingLWGLLLS25
Xinxin Xing, Yizhong Liu, Qianhong Wu, Zhenyu Guan, Dongyu Li, Dawei Li, Yuan Lu, Willy Susilo:
Multi-Committee ABE Based Decentralized Access Control With Sharding Blockchain for Web 3.0. IEEE Trans. Dependable Secur. Comput. 22(3): 2533-2549 (2025)
[c28]
- view
  authority control:
- export record
  dblp key:
  - conf/ccs/LiuLPHL0L00Q25
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ccs/LiuLPHL0L00Q25
Yizhong Liu, Andi Liu, Zhuocheng Pan, Yuxuan Hu, Jianwei Liu, Song Bian, Yuan Lu, Zhenyu Guan, Dawei Li, Meikang Qiu:
Realizing Corrupted-Shard Tolerance: A Sharding Blockchain with Preserving Global Resilience. CCS 2025: 2099-2113
[c26]
- view
  - electronic edition @ usenix.org (open access)
  - details & citations
- export record
  dblp key:
  - conf/uss/LiuJC0X0025
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/uss/LiuJC0X0025
Yizhong Liu, Zixiao Jia, Xiao Chen, Song Bian, Runhua Xu, Dawei Li, Yuan Lu:
Aion: Robust and Efficient Multi-Round Single-Mask Secure Aggregation Against Malicious Participants. USENIX Security Symposium 2025: 3025-3044

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.