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

Hongda Li 0001

dblp:49/6722-1 · also Hong-Da Li 0001, HongDa Li 0001 · DBLP profile ↗
← Back
22ranked-venue papers
7as first author
1since 2021 · last 2024
0000-0001-5589-4759ORCID · corroborated

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

Security and privacy · 13 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 8 · 6 first-authorHuman-computer interaction and ubiquitous computing · 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
6 papers
Cryptographic protocols and secure computation · 75% Blockchain and cryptocurrency security · 21% Cryptographic primitives and cryptanalysis · 4%
Theoretical computer science
5 papers
Computational complexity · 41% Distributed computing theory · 41% Mathematical optimization · 18%

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

TopicWeightPapersLastEvidence papers
Cryptographic protocols and secure computation › proof systems
zero-knowledge proofs
0.542014
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP · Sci. China Inf. Sci. 2014
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012
On constant-round zero-knowledge proofs of knowledge for NP-relations · Sci. China Inf. Sci. 2010
Blockchain and cryptocurrency security › consensus protocol
bitcoin backbone protocol
0.412020
Analysis of bitcoin backbone protocol in the non-flat model · Sci. China Inf. Sci. 2020
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs › proofs of knowledge
zero-knowledge proof of knowledge
0.322014
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP · Sci. China Inf. Sci. 2014
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012
Cryptographic protocols and secure computation
key exchange
0.312017
Attribute-based non-interactive key exchange · Sci. China Inf. Sci. 2017
Cryptographic protocols and secure computation › key exchange
non-interactive key exchange
0.312017
Attribute-based non-interactive key exchange · Sci. China Inf. Sci. 2017
Distributed computing theory
consensus
0.112020
Analysis of bitcoin backbone protocol in the non-flat model · Sci. China Inf. Sci. 2020
Cryptographic protocols and secure computation › proof systems › zero-knowledge proofs
proofs of knowledge
0.112010
On constant-round zero-knowledge proofs of knowledge for NP-relations · Sci. China Inf. Sci. 2010
Computational complexity › complexity classes
NP
0.122014
Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP · Sci. China Inf. Sci. 2014
Round-optimal zero-knowledge proofs of knowledge for NP · Sci. China Inf. Sci. 2012
Cryptographic primitives and cryptanalysis › public-key cryptography
attribute-based cryptography
0.112017
Attribute-based non-interactive key exchange · Sci. China Inf. Sci. 2017
Mathematical optimization
integer programming
0.122010
On constant-round zero-knowledge proofs of knowledge for NP-relations · Sci. China Inf. Sci. 2010
Existence of 3-round zero-knowledge proof systems for NP · Sci. China Ser. F Inf. Sci. 2008
Computational complexity › communication complexity
bounded-round protocols
0.012010
On constant-round zero-knowledge proofs of knowledge for NP-relations · Sci. China Inf. Sci. 2010

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

strict polynomial-time extractors · 0.4round-optimal protocols · 0.3
YearPublicationVenuePosition
2024 Sharding PoW-based Blockchains with Simple Cross-Shard Transaction Processing
abstract
Sharding is a promising solution to address the scalability challenge of blockchains by enabling parallel transaction processing across multiple shards. However, handling diverse cross-shard transactions with low inter-shard dependence remains a challenge. Existing approaches, such as two-phase commit and transaction decomposition, suffer from strong inter-shard dependencies or limited support for complex cross-shard transactions.This paper proposes a hierarchical sharded blockchain architecture with a root shard and multiple working shards, all using Nakamoto consensus. The verification and execution of cross-shard transactions are separated between the root shard and the working shards. The root shard, holding the final authority over the system state, endorses working chains and verifies cross-shard transactions, while working shards focus on executing operations related to their own shard. To ensure security, all operations of cross-shard transactions are executed based on the state used by the root shard during transaction validation. We extend the structure of working block which enables continuous intra-shard transaction processing alongside cross-shard transaction execution, even during root chain forks, thereby reducing processing delays and improving overall throughput.
Xianning Meng, Hongda Li 0001, Yao Zan
CSCWD2
2020 Analysis of bitcoin backbone protocol in the non-flat model
Peifang Ni, Hongda Li 0001, Dongxue Pan
Sci. China Inf. Sci.2
2019 Witness Encryption with (Weak) Unique Decryption and Message Indistinguishability: Constructions and Applications
Dongxue Pan, Bei Liang, Hongda Li 0001, Peifang Ni
ACISP3
2019 Hierarchical Functional Signcryption: Notion and Construction
Dongxue Pan, Bei Liang, Hongda Li 0001, Peifang Ni
ProvSec3
2018 Micropaying to a Distributed Payee with Instant Confirmation
Peifang Ni, Hongda Li 0001, Dongxue Pan
ICICS2
2017 Attribute-based non-interactive key exchange
Rui Zhang 0002, Hongda Li 0001
Sci. China Inf. Sci.3
2015 Constant-Round Leakage-Resilient Zero-Knowledge Argument for NP from the Knowledge-of-Exponent Assumption
Hongda Li 0001, Guifang Huang
ACISP2
2015 Verifiable Random Functions from (Leveled) Multilinear Maps
Bei Liang, Hongda Li 0001, Jinyong Chang
CANS2
2015 One-Round Witness Indistinguishability from Indistinguishability Obfuscation
Qihua Niu, Hongda Li 0001, Guifang Huang, Bei Liang
ISPEC2
2015 The Generic Transformation from Standard Signatures to Identity-Based Aggregate Signatures
Bei Liang, Hongda Li 0001, Jinyong Chang
ISC2
2015 Constrained Verifiable Random Functions from Indistinguishability Obfuscation
Bei Liang, Hongda Li 0001, Jinyong Chang
ProvSec2
2014 Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions
Bei Liang, Rui Zhang 0002, Hongda Li 0001
Inscrypt3
2014 Ring Signatures of Constant Size Without Random Oracles
Hongda Li 0001
Inscrypt2
2014 Efficient Leakage-Resilient Signature Schemes in the Generic Bilinear Group Model
Hongda Li 0001, Qihua Niu, Bei Liang
ISPEC2
2014 Attribute-Based Signatures for Circuits from Multilinear Maps
Hongda Li 0001, Bei Liang
ISC2
2014 Constant-round zero-knowledge proofs of knowledge with strict polynomial-time extractors for NP
Hongda Li 0001, Dengguo Feng
Sci. China Inf. Sci.1
2013 Leakage-Resilient Zero-Knowledge Proofs of Knowledge for NP
Hongda Li 0001, Qihua Niu, Bei Liang
NSS1
2012 Round-optimal zero-knowledge proofs of knowledge for NP
Hongda Li 0001, Dengguo Feng, Bao Li 0001, Haixia Xue
Sci. China Inf. Sci.1
2010 On constant-round zero-knowledge proofs of knowledge for NP-relations
Hongda Li 0001, Haixia Xu 0002, Bao Li 0001, Dengguo Feng
Sci. China Inf. Sci.1
2008 Existence of 3-round zero-knowledge proof systems for NP
Hongda Li 0001, Bao Li 0001
Sci. China Ser. F Inf. Sci.1
2004 Oblivious Polynomial Evaluation
Hongda Li 0001, Dongyao Ji, Dengguo Feng, Bao Li 0001
J. Comput. Sci. Technol.1
2004 Distributed Oblivious Function Evaluation and Its Applications
Hongda Li 0001, Dengguo Feng, Bao Li 0001
J. Comput. Sci. Technol.1