SJShaoquan Jiang

Shaoquan Jiang

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Shaoquan Jiang has a total of 28 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Robust and Reusable Fuzzy Extractor for Low-Entropy Distributions and Application to User Authentication

    by Somnath Panja, Nikita Tripathi, Shaoquan Jiang, Reihaneh Safavi-Naini

    Fuzzy extractors (FEs) are cryptographic primitives that generate a random key from a sample of a randomness source, together with some helper data that can be used to reproduce the key from a second sample of the source that is “close” to the first one. Reusable FEs can be used securely to derive multiple keys. Robust FEs detect any tempering with the helper data with overwhelming probability. In this paper we make two contributions. First, we construct a computationally secure, robust, and reusable FE (rrFE) that satisfies the strongest notion of reusability security, and its security reduces to the hardness of a new computational assumption that is closely related to LPN problem, for which no efficient quantum algorithm is known. The proof is in the standard model, answering an open question of Canetti et al. (Journal of Cryptology 2021). We implement and evaluate our rrFE using a widely used data set of iris data as the randomness source and compare its performance with a reusable only scheme for the same source. We also introduce and formalize password-protected fuzzy extractors (PPFEs), which use passwords as an additional source of entropy to enhance the security of biometric data against offline attacks (by a constant amount). We further present a PPFE construction with proved security. Second, we motivate and propose a new cryptographic primitive called Password Protected Message Retrieval (PPMR) that enables a user to securely store the helper data on a remote server and later securely recover it on a local device, using one round of communication without requiring a secret key and only relying on a retrieval password. The helper data is used to recover a biometric-based pre-shared key with the server. This removes the need to store sensitive biometric data on the device and allows the AKE protocol to be securely executed from any device that can correctly execute a code (e.g. an uncorrupted terminal).

  • Open Access

    Quantum Security of a Compact Multi-Signature

    by Shaoquan Jiang

    With the rapid advances in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first give a variant of Zhandry’s compressed random oracle (CStO), called a compressed quantum random oracle with adaptive special points (CStOs). Then, we extend the on-line extraction technique of Don et al. (EUROCRYPT’22) from CStO to CStOs. We also extend the random experiment technique of Liu and Zhandry (CRYPTO’19) for extracting the CStO query that witnesses the future adversarial output. With these preparations, a systematic security proof in the quantum random oracle model can start with a random CStO experiment (that extracts the witness for the future adversarial output) and then converts this game to one involving CStOs. Next, the online extraction technique for CStOs can be applied to extract the witness for any online commitment. With this strategy, we give a security proof of our recent compact multi-signature framework that is converted from any weakly secure linear ID scheme. We also prove the quantum security of our recent lattice realization of this linear ID scheme by iteratively applying the weakly collapsing protocol technique of Liu and Zhandry (CRYPTO 2019). Combining these two results, we obtain the first quantum security proof for a compact multi-signature.

  • Open Access

    Quantum Security of A Compact Multi-Signature

    by Shaoquan Jiang

    With the rapid advance in quantum computing, quantum security is now an indispensable property for any cryptographic system. In this paper, we study how to prove the security of a complex cryptographic system in the quantum random oracle model. We first give a variant of Zhandry’s compressed quantum random oracle (CStO), called compressed quantum random oracle with adaptive special points (CStOs). Then, we extend the on-line extraction technique of Don et al (EUROCRYPT’22) from CStO to CStOs. We also extend the random experiment technique of Liu and Zhandry (CRYPTO’19) for extracting the CStO query that witnesses the future adversarial output. With these preparations, a systematic security proof in the quantum random oracle model can start with a random CStO experiment (that extracts the witness for the future adversarial output) and then convert this game to one involving CStOs. Next, the on-line extraction technique for CStOs can be applied to extract the witness for any on-line commitment. With this strategy, we give a security proof of our recent compact multi-signature framework that is converted from any weakly secure linear ID scheme. We also prove the quantum security of our recent lattice realization of this linear ID scheme, by iteratively applying the weakly collapsing protocol technique of Liu and Zhandry (CRYPTO 2019). Combining these two results, we obtain the first quantum security proof for a compact multi-signature.

  • Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler With Realizations

    by Shaoquan Jiang, Dima Alhadidi, Hamid Fazli Khojir

    Multi-signature is a protocol where a set of signatures jointly sign a message so that the final signature is significantly shorter than concatenating individual signatures together. Recently, it finds applications in blockchain, where several users want to jointly authorize a payment through a multi-signature. However, in this setting, there is no centralized authority and it could suffer from a rogue key attack where the attacker can generate his own public keys. Further, to minimize the storage on blockchain, it is desired that the aggregated public-key and the aggregated signature are both as short as possible. In this paper, we find a compiler that converts a kind of identification (ID) scheme (which we call a linear ID) to a multi-signature so that both the aggregated public-key and the aggregated signature have a size independent of the number of signers. Our compiler is provably secure. The advantage of our result is that we reduce a multi-party problem to a weakly secure two-party problem. We realize our compiler with two ID schemes. The first is Schnorr ID. The second is a new lattice-based ID scheme, which via our compiler gives the first regular lattice-based multi-signature scheme with a key-and-signature size independent of the number of signers without a restart during the signing process


  • A Lower Bound on the Share Size of Leakage-Resilient Secret-Sharing Schemes

    by Sabyasachi Dutta, Shaoquan Jiang, Reihaneh Safavi-Naini

  • Lower Bounds on the Share Size of Leakage Resilient Cheating Detectable Secret Sharing

    by Sabyasachi Dutta, Shaoquan Jiang, Reihaneh Safavi-Naini

  • Open Access

    Key-and-Signature Compact Multi-Signatures for Blockchain: A Compiler with Realizations

    by Shaoquan Jiang, Dima Alhadidi, Hamid Fazli Khojir

    Multi-signature is a protocol where a set of signatures jointly sign a message so that the final signature is significantly shorter than concatenating individual signatures together. Recently, it finds applications in blockchain, where several users want to jointly authorize a payment through a multi-signature. However, in this setting, there is no centralized authority and it could suffer from a rogue key attack where the attacker can generate his own keys arbitrarily. Further, to minimize the storage on blockchain, it is desired that the aggregated public-key and the aggregated signature are both as short as possible. In this paper, we find a compiler that converts a kind of identification (ID) scheme (which we call a linear ID) to a multi-signature so that both the aggregated public-key and the aggregated signature have a size independent of the number of signers. Our compiler is provably secure. The advantage of our results is that we reduce a multi-party problem to a weakly secure two-party problem. We realize our compiler with two ID schemes. The first is Schnorr ID. The second is a new lattice-based ID scheme, which via our compiler gives the first regular lattice-based multi-signature scheme with key-and-signature compact without a restart during signing process.

  • On Message Authentication Channel Capacity Over a Wiretap Channel

    by Dajiang Chen, Shaoquan Jiang, Ning Zhang, Lei Liu, Kim-Kwang Raymond Choo

    In this paper, a novel message authentication model using the same key over wiretap channel is proposed to achieve information-theoretic security . Specifically, in the proposed model, there is a discrete memoryless channel $W_{1}\!: \! \mathscr {X}\!\!\rightarrow \!\!{ \mathscr {Y}}$ between transmitter Alice and receiver Bob, while an attacker Oscar is connected with Alice via discrete memoryless channel $W_{2}\!:\! \mathscr {X}\!\rightarrow \! { \mathscr {Z}}$ . Alice encodes message $M$ to codeword $(\!S,X^{n}\!)$ , using an encoding function with secret key $K$ . Then, $S$ is sent to Bob over a one-way noiseless channel (fully controlled by Oscar), and $X^{n}$ is sent over the wiretap channel, say ${X}\!\rightarrow \!{(Y,Z)}$ . Building on this model, a new message authentication scheme is proposed. The scheme incorporates a secure channel coding, which uses random coding techniques to detect man-in-the-middle (MITM) attacks. The authentication channel capacity is studied in a specific channel model when $W_{2}$ is not less noisy than $W_{1}$ . We theoretically demonstrate that the authentication channel capacity is much larger than the secrecy capacity, since Bob does not need to recover information transmitted over the noisy channel.


  • Open Access

    Physical‐Layer Authentication via a Dynamic Scaling

    by Min Li, Shaoquan Jiang, Yongjian Liao

    Message authentication is a process that allows sender Alice to transmit a source state to receiver Bob such that the latter is assured of the authenticity. We study this problem in the physical-layer where the channel is degraded by a Rayleigh fading and a Gaussian noise. We propose an efficient construction for our problem. Our idea is to amplify a basic codeword of the source state with a small but dynamic scaling factor. This scaling factor is asymptotically 1. It thus essentially incurs no power expansion. Our authentication is achieved through a statistical test. Our scheme is provably secure and performs better than the related existing schemes. Further, our error analysis allows it to be realized with very practical parameters.