[This article belongs to Volume - 54, Issue - 01]
Gongcheng Kexue Yu Jishu/Advanced Engineering Science
Journal ID : AES-15-06-2022-210

Title : Anonymous Query Mechanism Construction of Timed-Release Encryption
YUAN Ke, WANG Zilin, DU Zhanfei, HE Xinzheng, JIA Chunfu, HE Yuan,

Abstract :

In the real world, many problems have the need to conduct relevant operations at a specific time. Timed-release encryption (TRE) is a cryptographic primitive in which the sender specifies the decryption time of the receiver, which can meet the above requirement. To address the problem that the current TRE schemes based on the periodic broadcast time trapdoor of the non-interactive time server cannot meet the user’s arbitrary specified decryption time, and the interactive time server mode meets the arbitrary decryption time but cannot guarantee the user’s identity privacy, a TRE scheme using onion routing network was proposed. In the scheme, when the decryption time approaches, the time trapdoor request was taken as the innermost onion, and the layer by layer encrypted onion was constructed and transmitted to the time server. The time server generates the corresponding time trapdoor and returns it to the receiver according to the original route, so that the user can hide the identity information when making a trapdoor query at any time. Meanwhile, for the node failure problem in the process of onion routing delivery, a method for constructing each layer of onion based on broadcast encryption was proposed, so that each layer of onion node can decrypt that layer of onion. The scheme achieves the trapdoor of successfully querying arbitrary time to the time server while ensuring the anonymity of user’s identity. Security analysis showed that the scheme is secure and robust against possible single-point speculation, monitoring attacks, replay attacks, and collusion attacks. Efficiency analysis showed that compared with the pairing-based onion routing scheme, the proposed scheme reduces the time consumption of solving the node failure problem by about 59%, thus realizing efficient anonymous query