Hong-Sheng Zhou

Orcid: 0000-0003-3534-6629

According to our database1, Hong-Sheng Zhou authored at least 70 papers between 2005 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Single-Input Functionality against a Dishonest Majority: Practical and Round-Optimal.
IACR Cryptol. ePrint Arch., 2024

On the Complexity of Cryptographic Groups and Generic Group Models.
IACR Cryptol. ePrint Arch., 2024

Maximizing the Utility of Cryptographic Setups: Secure PAKEs, with either functional RO or CRS.
IACR Cryptol. ePrint Arch., 2024

Scalable Private Set Union, with Stronger Security.
IACR Cryptol. ePrint Arch., 2024

Distributed Point Function with Constraints, Revisited.
IACR Cryptol. ePrint Arch., 2024

Column-wise Garbling, and How to Go Beyond the Linear Model.
IACR Cryptol. ePrint Arch., 2024

Brief Announcement: Best-Possible Unpredictable Proof-Of-Stake.
Proceedings of the 38th International Symposium on Distributed Computing, 2024

2023
Practical Constructions for Single Input Functionality against a Dishonest Majority.
IACR Cryptol. ePrint Arch., 2023

2022
Scriptable and composable SNARKs in the trusted hardware model.
J. Comput. Secur., 2022

Endemic Oblivious Transfer via Random Oracles, Revisited.
IACR Cryptol. ePrint Arch., 2022

GUC-Secure Commitments via Random Oracles: New Impossibility and Feasibility.
IACR Cryptol. ePrint Arch., 2022

An Analysis of the Algebraic Group Model.
IACR Cryptol. ePrint Arch., 2022

The Ideal Functionalities for Private Set Union, Revisited.
IACR Cryptol. ePrint Arch., 2022

Shuffle-based Private Set Union: Faster and More Secure.
IACR Cryptol. ePrint Arch., 2022

A Universally Composable Non-interactive Aggregate Cash System.
Proceedings of the Advances in Cryptology - ASIACRYPT 2022, 2022

2021
Towards Quantum One-Time Memories from Stateless Hardware.
Quantum, 2021

From Random Oracles to Ideal Signatures, and Back.
IACR Cryptol. ePrint Arch., 2021

Correcting Subverted Random Oracles.
IACR Cryptol. ePrint Arch., 2021

Indifferentiable Signatures: High Performance and Fallback Security.
IACR Cryptol. ePrint Arch., 2021

A Permissionless Proof-of-Stake Blockchain with Best-Possible Unpredictability.
IACR Cryptol. ePrint Arch., 2021

Succinct Scriptable NIZK via Trusted Hardware.
Proceedings of the Computer Security - ESORICS 2021, 2021

Correlated Randomness Teleportation via Semi-trusted Hardware - Enabling Silent Multi-party Computation.
Proceedings of the Computer Security - ESORICS 2021, 2021

2020
Locally Decodable and Updatable Non-malleable Codes and Their Applications.
J. Cryptol., 2020

2-hop Blockchain: Combining Proof-of-Work and Proof-of-Stake Securely.
Proceedings of the Computer Security - ESORICS 2020, 2020

2019
Leakage Resilience from Program Obfuscation.
J. Cryptol., 2019

(Efficient) Universally Composable Oblivious Transfer Using a Minimal Number of Stateless Tokens.
J. Cryptol., 2019

Let a Non-barking Watchdog Bite: Cliptographic Signatures with an Offline Watchdog.
Proceedings of the Public-Key Cryptography - PKC 2019, 2019

Statement Voting.
Proceedings of the Financial Cryptography and Data Security, 2019

Fractal: A New Paradigm for High-Performance Proof-of-Stake Blockchains.
Proceedings of the 7th International Workshop on Security in Cloud Computing, 2019

2018
Multi-mode Cryptocurrency Systems.
IACR Cryptol. ePrint Arch., 2018

Leakage-Resilient Cryptography from Puncturable Primitives and Obfuscation.
IACR Cryptol. ePrint Arch., 2018

Multi-key FHE for multi-bit messages.
Sci. China Inf. Sci., 2018

A Generic Paradigm for Blockchain Design.
Proceedings of the 15th EAI International Conference on Mobile and Ubiquitous Systems: Computing, 2018

Correcting Subverted Random Oracles.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

2017
Digital Liquid Democracy: How to Vote Your Delegation Statement.
IACR Cryptol. ePrint Arch., 2017

iChing: A Scalable Proof-of-Stake Blockchain in the Open Setting (or, How to Mimic Nakamoto's Design via Proof-of-Stake).
IACR Cryptol. ePrint Arch., 2017

TwinsCoin: A Cryptocurrency via Proof-of-Work and Proof-of-Stake.
IACR Cryptol. ePrint Arch., 2017

Brief Announcement: Statement Voting and Liquid Democracy.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2017

Generic Semantic Security against a Kleptographic Adversary.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
Destroying Steganography via Amalgamation: Kleptographically CPA Secure Public Key Encryption.
IACR Cryptol. ePrint Arch., 2016

Securing Bitcoin-like Backbone Protocols against a Malicious Majority of Computing Power.
IACR Cryptol. ePrint Arch., 2016

Leakage-Resilient Public-Key Encryption from Obfuscation.
IACR Cryptol. ePrint Arch., 2016

Designing Proof of Human-work Puzzles for Cryptocurrency and Beyond.
IACR Cryptol. ePrint Arch., 2016

Cryptography for Parallel RAM from Indistinguishability Obfuscation.
Proceedings of the 2016 ACM Conference on Innovations in Theoretical Computer Science, 2016

2015
Cliptography: Clipping the Power of Kleptographic Attacks.
IACR Cryptol. ePrint Arch., 2015

Fair and Robust Multi-Party Computation using a Global Transaction Ledger.
IACR Cryptol. ePrint Arch., 2015

Feasibility and Infeasibility of Adaptively Secure Fully Homomorphic Encryption.
IACR Cryptol. ePrint Arch., 2015

Multi-Client Verifiable Computation with Stronger Security Guarantees.
IACR Cryptol. ePrint Arch., 2015

Feasibility and Completeness of Cryptographic Tasks in the Quantum World.
IACR Cryptol. ePrint Arch., 2015

Functional Encryption from (Small) Hardwae Tokens.
IACR Cryptol. ePrint Arch., 2015

Computation-Trace Indistinguishability Obfuscation and its Applications.
IACR Cryptol. ePrint Arch., 2015

Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting.
Proceedings of the Advances in Cryptology - CRYPTO 2015, 2015

2014
A Unified Approach to Idealized Model Separations via Indistinguishability Obfuscation.
IACR Cryptol. ePrint Arch., 2014

Leakage-Resilient Circuits Revisited - Optimal Number of Computing Components without Leak-free Hardware.
IACR Cryptol. ePrint Arch., 2014

Distributing the setup in universally composable multi-party computation.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Multi-input Functional Encryption.
Proceedings of the Advances in Cryptology - EUROCRYPT 2014, 2014

2013
Multi-Input Functional Encryption.
IACR Cryptol. ePrint Arch., 2013

Functional Encryption from (Small) Hardware Tokens.
Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012
Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS.
IACR Cryptol. ePrint Arch., 2012

2011
On the Security of the Free-XOR Technique.
IACR Cryptol. ePrint Arch., 2011

Adaptively secure broadcast, revisited.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

2009
Hidden identity-based signatures.
IET Inf. Secur., 2009

Zero-Knowledge Proofs with Witness Elimination.
Proceedings of the Public Key Cryptography, 2009

Secure Function Collection with Sublinear Storage.
Proceedings of the Automata, Languages and Programming, 36th Internatilonal Colloquium, 2009

2008
Somewhat Non-Committing Encryption and Efficient Adaptively Secure Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2008

A Framework for the Sound Specification of Cryptographic Tasks.
IACR Cryptol. ePrint Arch., 2008

Sound and Fine-grain Specification of Ideal Functionalities.
Proceedings of the Theoretical Foundations of Practical Information Security, 30.11., 2008

2007
Equivocal Blind Signatures and Adaptive UC-Security.
IACR Cryptol. ePrint Arch., 2007

Trading Static for Adaptive Security in Universally Composable Zero-Knowledge.
Proceedings of the Automata, Languages and Programming, 34th International Colloquium, 2007

2005
Concurrent Blind Signatures without Random Oracles.
IACR Cryptol. ePrint Arch., 2005


  Loading...