Experimental quantum e-commerce
- PMID: 38215202
- PMCID: PMC12697565
- DOI: 10.1126/sciadv.adk3258
Experimental quantum e-commerce
Abstract
E-commerce, a type of trading that occurs at a high frequency on the internet, requires guaranteeing the integrity, authentication, and nonrepudiation of messages through long distance. As current e-commerce schemes are vulnerable to computational attacks, quantum cryptography, ensuring information-theoretic security against adversary's repudiation and forgery, provides a solution to this problem. However, quantum solutions generally have much lower performance compared to classical ones. Besides, when considering imperfect devices, the performance of quantum schemes exhibits a notable decline. Here, we demonstrate the whole e-commerce process of involving the signing of a contract and payment among three parties by proposing a quantum e-commerce scheme, which shows resistance of attacks from imperfect devices. Results show that with a maximum attenuation of 25 dB among participants, our scheme can achieve a signature rate of 0.82 times per second for an agreement size of approximately 0.428 megabit. This proposed scheme presents a promising solution for providing information-theoretic security for e-commerce.
Figures
References
-
- Shor P. W., Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM Rev. 41, 303–332 (1999).
-
- Martin-Lopez E., Laing A., Lawson T., Alvarez R., Zhou X.-Q., O’brien J. L., Experimental realization of shor’s quantum factoring algorithm using qubit recycling. Nat. Photonics 6, 773–776 (2012).
-
- F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, P. Zimmermann, Comparing the difficulty of factorization and discrete logarithm: A 240-digit experiment, in Advances in Cryptology–CRYPTO 2020 (Springer, 2020), pp. 62–91.
-
- Gouzien É., Sangouard N., Factoring 2048-bit rsa integers in 177 days with 13,436 qubits and a multimode memory. Phys. Rev. Lett. 127, 140503 (2021). - PubMed
-
- Rivest R. L., Shamir A., Adleman L., A method for obtaining digital signatures and public-key cryptosystems. Commun. ACM 21, 120–126 (1978).
LinkOut - more resources
Full Text Sources
Research Materials
Miscellaneous
