Xin Sun

Xin Sun

Auto-generated profile, based on publicly available information

Xin Sun

University of Luxembourg

Research Focus & Metrics

Academic Career Length

12Years (2015-Present)

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

Representative Publications

View All Publications
12 September 2019 in Entropy
Verified
Journal Article
Open access
PDF file
XSXin Sun
Xin Sun
MSMirek Sopek
Mirek Sopek
QWQuanlong Wang
Quanlong Wang
PKPiotr Kulicki
Piotr Kulicki
While Blockchain technology is universally considered as a significant technology for the near future, some of its pillars are under a threat of another thriving technology, Quantum Computing. In this paper, we propose important safeguard measures against this threat by developing a framework of a quantum-secured, permissioned blockchain called Logicontract (LC). LC adopts a digital signature scheme based on Quantum Key Distribution (QKD) mechanisms and a vote-based consensus algorithm to achieve consensus on the blockchain. The main contribution of this paper is in the development of: (1) unconditionally secure signature scheme for LC which makes it immune to the attack of quantum computers; (2) scalable consensus protocol used by LC; (3) logic-based scripting language for the creation of smart contracts on LC; (4) quantum-resistant lottery protocol which illustrates the power and usage of LC.

18 October 2018 in International Journal of Theoretical Physics
Verified
Journal Article
Open access
PDF file
XSXin Sun
Xin Sun
QWQuanlong Wang
Quanlong Wang
PKPiotr Kulicki
Piotr Kulicki
MSMirek Sopek
Mirek Sopek
This paper proposes a simple voting protocol based on Quantum Blockchain. Despite its simplicity, our protocol satisfies the most important properties of secure voting protocols: is anonymous, binding, non-reusable, verifiable, eligible, fair and self-tallying. The protocol could also be implemented using presently available technology.

14 October 2020 in Entropy
Verified
Journal Article
Open access
PDF file
XSXin Sun
Xin Sun
PKPiotr Kulicki
Piotr Kulicki
MSMirek Sopek
Mirek Sopek
In this paper, we propose a protocol of quantum communication to achieve Byzantine agreement among multiple parties. Our protocol’s striking feature compared to the existing protocols is that we do not use entanglement to achieve the agreement. The role played by entangled states in other protocols is replaced in our protocol by a group of semi-honest list distributors. Such a replacement makes the implementation of our protocol more feasible. Moreover, our protocol is efficient in the sense that it achieves agreement in only three rounds which is a significant improvement with respect to the alternative agreement protocol not using entanglement. In the first round, a list of numbers that satisfies some special properties is distributed to every participant by list distributors via quantum secure communication. Then, in the second and third rounds, those participants exchange some information to reach an agreement.

1 April 2017 in Journal of Logic and Computation
Verified
Journal Article
Open access
PDF file
LRLivio Robaldo
Livio Robaldo
XSXin Sun
Xin Sun
In this article, we propose to combine Input/Output logic, a well-known formalism for normative reasoning, with the reification-based approach of Jerry R. Hobbs. The latter is a wide-coverage logic for Natural Language Semantics (NLS) able to handle a fairly large set of linguistic phenomena into a simple logical formalism. The result is a new framework that we will call ‘reified Input/Output logic’. This article represents the first step of a long-term research aiming at filling the gap between Input/Output logic and the richness of NLS. We plan in our future work to use reified Input/Output logic as the underlying formalism for applications in legal informatics to process and reason on existing legal texts, which are available in natural language only.

2 April 2019 in Information Sciences
Verified
Journal Article
Closed access
LZLu Zhou
Lu Zhou
XSXin Sun
Xin Sun
Chunhua SuChunhua Su
Chunhua Su
ZLZhe Liu
Zhe Liu
KCKim-Kwang Raymond Choo
Kim-Kwang Raymond Choo

9 March 2020 in Axioms
Verified
Journal Article
Open access
PDF file
XSXin Sun
Xin Sun
FHFeifei He
Feifei He
QWQuanlong Wang
Quanlong Wang
Bit commitment is a cryptographic task in which Alice commits a bit to Bob such that she cannot change the value of the bit after her commitment and Bob cannot learn the value of the bit before Alice opens her commitment. According to the Mayers–Lo–Chau (MLC) no-go theorem, ideal bit commitment is impossible within quantum theory. In the information theoretic-reconstruction of quantum theory, the impossibility of quantum bit commitment is one of the three information-theoretic constraints that characterize quantum theory. In this paper, we first provide a very simple proof of the MLC no-go theorem and its quantitative generalization. Then, we formalize bit commitment in the theory of dagger monoidal categories. We show that in the setting of dagger monoidal categories, the impossibility of bit commitment is equivalent to the unitary equivalence of purification.