Hui Yu

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 Yizhong Liu

> Home > Persons > Hui Yu

Publications

2022
[j78]
- view
  authority control:
- export record
  dblp key:
  - journals/tdsc/LiuLWYHZ22
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tdsc/LiuLWYHZ22
Yizhong Liu, Jianwei Liu, Qianhong Wu, Hui Yu, Yiming Hei, Ziyu Zhou:
SSHC: A Secure and Scalable Hybrid Consensus Protocol for Sharding Blockchains With a Formal Security Framework. IEEE Trans. Dependable Secur. Comput. 19(3): 2070-2088 (2022)
2020
[j53]
- view
  authority control:
- export record
  dblp key:
  - journals/compsec/LiuLZY20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/compsec/LiuLZY20
Yizhong Liu, Jianwei Liu, Zongyang Zhang, Hui Yu:
A fair selection protocol for committee-based permissionless blockchains. Comput. Secur. 91: 101718 (2020)
[c83]
- view
  authority control:
- export record
  dblp key:
  - conf/ica3pp/LiuLYLYW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ica3pp/LiuLYLYW20
Yizhong Liu, Jianwei Liu, Jiayuan Yin, Geng Li, Hui Yu, Qianhong Wu:
Cross-shard Transaction Processing in Sharding Blockchains. ICA3PP (3) 2020: 324-339
[c82]
- view
  authority control:
- export record
  dblp key:
  - conf/ica3pp/LiuLLYW20
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/ica3pp/LiuLLYW20
Yizhong Liu, Jianwei Liu, Dawei Li, Hui Yu, Qianhong Wu:
FleetChain: A Secure Scalable and Responsive Blockchain Achieving Optimal Sharding. ICA3PP (3) 2020: 409-425

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.