Hong-Sheng Zhou

Hong-Sheng Zhou

Auto-generated profile, based on publicly available information

Hong-Sheng Zhou

Virginia Commonwealth University

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 January 2014
Verified
Book Chapter
Closed access
PDF file
SGShafi Goldwasser
Shafi Goldwasser
SGS. Dov Gordon
S. Dov Gordon
VGVipul Goyal
Vipul Goyal
AJAbhishek Jain
Abhishek Jain
JKJonathan Katz
Jonathan Katz
HZHong-Sheng Zhou
Hong-Sheng Zhou


9 November 2016
Verified
Book Chapter
Closed access
PDF file
ARAlexander Russell
Alexander Russell
QTQiang Tang
Qiang Tang
MYMoti Yung
Moti Yung
HZHong-Sheng Zhou
Hong-Sheng Zhou

1 January 2012
Verified
Book Chapter
Closed access
PDF file
SCSeung Geol Choi
Seung Geol Choi
JKJonathan Katz
Jonathan Katz
RKRanjit Kumaresan
Ranjit Kumaresan
HZHong-Sheng Zhou
Hong-Sheng Zhou

30 October 2017
Verified
Conference Paper
Open access
ARAlexander Russell
Alexander Russell
QTQiang Tang
Qiang Tang
MYMoti Yung
Moti Yung
HZHong-Sheng Zhou
Hong-Sheng Zhou

6 June 2011
Verified
Conference Paper
Open access
PDF file
JGJuan A. Garay
Juan A. Garay
JKJonathan Katz
Jonathan Katz
RKRanjit Kumaresan
Ranjit Kumaresan
HZHong-Sheng Zhou
Hong-Sheng Zhou
We consider the classical problem of synchronous broadcast with dishonest majority, when a public-key infrastructure and digital signatures are available. In a surprising result, Hirt and Zikas (Eurocrypt 2010) recently observed that all existing protocols for this task are insecure against an adaptive adversary who can choose which parties to corrupt as the protocol progresses. Moreover, they prove an impossibility result for adaptively secure broadcast in their setting. We argue that the communication model adopted by Hirt and Zikas is unrealistically pessimistic. We revisit the problem of adaptively secure broadcast in a more natural synchronous model (with rushing), and show that broadcast is possible in this setting for an arbitrary number of corruptions. Our positive result holds under a strong, simulation-based definition in the universal-composability framework. We also study the impact of adaptive attacks on protocols for secure multi-party computation where broadcast is used as a sub-routine.