Ling Ren

Ling Ren

Auto-generated profile, based on publicly available information

Ling Ren

University of Illinois at Urbana-Champaign, Urbana, USA

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
24 December 2015
Verified
Book Chapter
Closed access
PDF file
SDSrinivas Devadas
Srinivas Devadas
MDMarten van Dijk
Marten van Dijk
CFChristopher W. Fletcher
Christopher W. Fletcher
LRLing Ren
Ling Ren
ESElaine Shi
Elaine Shi
DWDaniel Wichs
Daniel Wichs

15 November 2023
Verified
Conference Paper
Open access
SDSourav Das
Sourav Das
PCPhilippe Camacho
Philippe Camacho
ZXZhuolun Xiang
Zhuolun Xiang
JNJavier Nieto
Javier Nieto
BBBenedikt Bünz
Benedikt Bünz
LRLing Ren
Ling Ren
Threshold signatures protect the signing key by sharing it among a group of signers so that an adversary must corrupt a threshold number of signers to be able to forge signatures. Existing threshold signatures with succinct signatures and constant verification times do not work if signers have different weights. Such weighted settings are seeing increasing importance in decentralized systems, especially in the Proof-of-Stake blockchains. This paper presents a new paradigm for threshold signatures for pairing and discrete logarithm-based cryptosystems. Our scheme has a compact verification key consisting of only 7 group elements, and a signature consisting of 8 group elements. Verifying the signature requires 8 exponentiations and 8 bilinear pairings. Our scheme supports arbitrary weight distributions among signers and arbitrary thresholds. It requires non-interactive preprocessing after a universal powers-of-tau setup. We prove the security of our scheme in the Algebraic Group Model and implement it using Golang. Our evaluation shows that our scheme achieves a comparable signature size and verification time to a standard (unweighted) threshold signature. Compared to existing multisignature schemes, our scheme has a much smaller public verification key.


22 October 2016
Verified
Book Chapter
Closed access
PDF file
LRLing Ren
Ling Ren
SDSrinivas Devadas
Srinivas Devadas

15 November 2023
Verified
Conference Paper
Open access
DMDahlia Malkhi
Dahlia Malkhi
AMAtsuki Momose
Atsuki Momose
LRLing Ren
Ling Ren

15 November 2023
Verified
Conference Paper
Open access
XDXiaohai Dai
Xiaohai Dai
BZBolin Zhang
Bolin Zhang
HJHai Jin
Hai Jin
LRLing Ren
Ling Ren
To reduce latency and communication overhead of asynchronous Byzantine Fault Tolerance (BFT) consensus, an optimistic path is often added, with Ditto and BDT as state-of-the-art representatives. These protocols first attempt to run an optimistic path that is typically adapted from partially-synchronous BFT and promises good performance in good situations. If the optimistic path fails to make progress, these protocols switch to a pessimistic path after a timeout, to guarantee liveness in an asynchronous network. This design crucially relies on an accurate estimation of the network delay Δ to set the timeout parameter correctly. A wrong estimation of Δ can lead to either premature or delayed switching to the pessimistic path, hurting the protocol's efficiency in both cases. To address the above issue, we propose ParBFT, which employs a parallel optimistic path. As long as the leader of the optimistic path is non-faulty, ParBFT ensures low latency without requiring an accurate estimation of the network delay. We propose two variants of ParBFT, namely ParBFT1 and ParBFT2, with a trade-off between latency and communication. ParBFT1 simultaneously launches the two paths, achieves lower latency under a faulty leader, but has a quadratic message complexity even in good situations. ParBFT2 reduces the message complexity in good situations by delaying the pessimistic path, at the cost of a higher latency under a faulty leader. Experimental results demonstrate that ParBFT outperforms Ditto or BDT. In particular, when the network condition is bad, ParBFT can reach consensus through the optimistic path, while Ditto and BDT suffer from path switching and have to make progress using the pessimistic path.