Accurate and tamper-resistant timestamps are essential for applications demanding verifiable chronological ordering,such as legal documentation and digital intellectual property protection.Classical timestamp protocol...Accurate and tamper-resistant timestamps are essential for applications demanding verifiable chronological ordering,such as legal documentation and digital intellectual property protection.Classical timestamp protocols rely on computational assumptions for security,rendering them vulnerable to quantum attacks,which is a critical limitation given the rapid progress in quantum computing.To address this,we propose an information-theoretically secure quantum timestamping protocol based on one-time universal hashing with quantum keys.Our protocol simultaneously achieves information-theoretic security and high efficiency,enabling secure timestamping for arbitrarily long documents.Simulations demonstrate a generation rate exceeding 100 timestamps per second over intercity distances.In addition,our protocol only requires weak coherent states,making it practical for large-scale deployment.This work advances the field of quantum timestamping and contributes to the broader development of quantum cryptography and the future quantum internet.展开更多
Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal ...Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.12274223)the Program for Innovative Talents,Entrepreneurs in Jiangsu(Grant No.JSSCRC2021484)the Key Research and Development Program of Nanjing Jiangbei New Area(Grant No.ZDYD20210101)。
文摘Accurate and tamper-resistant timestamps are essential for applications demanding verifiable chronological ordering,such as legal documentation and digital intellectual property protection.Classical timestamp protocols rely on computational assumptions for security,rendering them vulnerable to quantum attacks,which is a critical limitation given the rapid progress in quantum computing.To address this,we propose an information-theoretically secure quantum timestamping protocol based on one-time universal hashing with quantum keys.Our protocol simultaneously achieves information-theoretic security and high efficiency,enabling secure timestamping for arbitrarily long documents.Simulations demonstrate a generation rate exceeding 100 timestamps per second over intercity distances.In addition,our protocol only requires weak coherent states,making it practical for large-scale deployment.This work advances the field of quantum timestamping and contributes to the broader development of quantum cryptography and the future quantum internet.
基金Acknowledgements This work was supported by the National Natural Science Foundation of China （Grant Nos. 61173151, 61173152） and the Fundamental Research Funds for the Central Universities （K5051270003）.
文摘Key-dependent message （KDM） security is an important security issue that has attracted much research in recent years. In this paper, we present a new construction of the symmetric encryption scheme in the the ideal cipher model （ICM）; we prove that our scheme is KDM secure against active attacks with respect to arbitrary polynomialtime challenge functions. Our main idea is to introduce a universal hash function （UHF） h as a random value for each encrypfion, and then use s = h（sk） as the key of the ideal cipher F, where sk is the private key of our symmetric encryption scheme. Although many other schemes that are secure against KDM attacks have already been proposed, in both the ideal standard models, the much more significance of our paper is the simplicity in which we implement KDM security against active attacks.
