Abstract
Aiming at the problem that it is difficult to flexibly realize, the sharing and efficient search of encrypted data in large data-bases, this paper proposes a deterministic threshold proxy re-encryption scheme under the auxiliary input model. This scheme uses Shamir's secret sharing technology to achieve threshold control, uses homomorphic signature technology to verify the legitimacy of ciphertext, and applies deterministic algorithms to solve the search problem in large databases, while ensuring the user's control over their own data, and proves its security can reach indistinguishable semantic security (PRIV1-INDr) under the standard model. Compared with other schemes, this scheme not only shortens the length of the ciphertext and improves the decryption efficiency, but it also has anti-auxiliary input, robustness, and multi-hop characteristics and can better meet actual needs.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
