Shaoquan Jiang

Dr. Shaoquan Jiang

orcid

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

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

Representative Publications

View All Publications
29 April 2014 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
SJShaoquan Jiang
Shaoquan Jiang
We study a keyless authentication problem in a new noisy model, where there is a discrete memoryless channel (DMC) W 1 from sender Alice to receiver Bob and a DMC W 2 from adversary Oscar to Bob. In addition, there is an insecure noiseless channel between Alice and Bob. Under this model, we characterize the condition under which an authentication from Alice to Bob is possible. We also construct a secure authentication protocol that has an authentication rate approaching infinity. Finally, we prove that the authentication capacity of a noninteractive authentication over binary symmetric channels is exactly 1. This is an interesting result as Shannon capacity of channel W 1 is strictly less than 1 while the noiseless channel is completely unreliable.

24 August 2022 in IEEE Transactions on Information Forensics and Security
Verified
Journal Article
Closed access
DCDajiang Chen
Dajiang Chen
SJShaoquan Jiang
Shaoquan Jiang
NZNing Zhang
Ning Zhang
LLLei Liu
Lei Liu
KCKim-Kwang Raymond Choo
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.

10 January 2018 in Sensors
Verified
Journal Article
Open access
YLYongjian Liao
Yongjian Liao
YHYichuan He
Yichuan He
FLFagen Li
Fagen Li
SJShaoquan Jiang
Shaoquan Jiang
SZShijie Zhou
Shijie Zhou
Attribute-based encryption (ABE) is a popular cryptographic technology to protect the security of users’ data in cloud computing. In order to reduce its decryption cost, outsourcing the decryption of ciphertexts is an available method, which enables users to outsource a large number of decryption operations to the cloud service provider. To guarantee the correctness of transformed ciphertexts computed by the cloud server via the outsourced decryption, it is necessary to check the correctness of the outsourced decryption to ensure security for the data of users. Recently, Li et al. proposed a full verifiability of the outsourced decryption of ABE scheme (ABE-VOD) for the authorized users and unauthorized users, which can simultaneously check the correctness of the transformed ciphertext for both them. However, in this paper we show that their ABE-VOD scheme cannot obtain the results which they had shown, such as finding out all invalid ciphertexts, and checking the correctness of the transformed ciphertext for the authorized user via checking it for the unauthorized user. We first construct some invalid ciphertexts which can pass the validity checking in the decryption algorithm. That means their “verify-then-decrypt” skill is unavailable. Next, we show that the method to check the validity of the outsourced decryption for the authorized users via checking it for the unauthorized users is not always correct. That is to say, there exist some invalid ciphertexts which can pass the validity checking for the unauthorized user, but cannot pass the validity checking for the authorized user.

29 April 2020
Verified
Book Chapter
Closed access
PDF file
SJShaoquan Jiang
Shaoquan Jiang
GGGuang Gong
Guang Gong
JHJingnan He
Jingnan He
KNKhoa Nguyen
Khoa Nguyen
HWHuaxiong Wang
Huaxiong Wang

6 June 2024 in IEEE Transactions on Dependable and Secure Computing
Verified
Journal Article
Closed access
SJShaoquan Jiang
Shaoquan Jiang
DADima Alhadidi
Dima Alhadidi
HKHamid Fazli Khojir
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

6 May 2013 in The Computer Journal
Verified
Journal Article
Closed access
PDF file
SZShengke Zeng
Shengke Zeng
SJShaoquan Jiang
Shaoquan Jiang
Conditionally anonymous ring signatures are a variant of ring signatures such that the anonymity is conditional: if a user is the true signer, then he can claim this through a confirmation protocol; if he is not the signer, he can prove this through a disavowal protocol. Hence, this can preserve the anonymity of a signer while reserving the right to trace it when necessary. The security of such a signature also requires that an innocent non-signer will not be framed as a signer. In this paper, we propose a new framework for this type of signature without random oracles. Our construction can be realized under general complexity assumptions and has a simple structure. In contrast, previous works are based on non-standard assumptions or proved secure in the random oracle model.