An Efficient Certificate-Based Encryption Scheme Without Random Oracles

Guo, Lan; Lu, Yang; Miao, Qing; Zu, Guangao; Wang, Zhongqi

doi:10.1007/978-3-031-06791-4_8

Cited by 1 publication

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The goal of this scheme is to improve encryption efficiency and security in big data scenarios. In order to avoid relying on random oracles for security analysis, Guo et al [10] introduced an efficient CBE scheme without random oracles. On the other hand, to enable secure keyword searching in cloud environments, Uyyala [24] presented a secure channel-independent certificate-based searchable encryption scheme that can withstand outside and inside keyword guessing attacks.…”

Section: Introductionmentioning

confidence: 99%

CBEET: Constructing Certificate-based Encryption with Equality Test in the CB-PKS

Tsai,

LIN,

2023

ITC

View full text Add to dashboard Cite

To maintain the confidentiality of private data, encryption mechanisms have become prevalent. Researchers always strive to design secure and efficient encryption mechanisms in both symmetric and asymmetric key systems. Certificate-based public key systems (CB-PKS) belong to the family of asymmetric key systems. CB-PKS offers solutions to both the key escrow problem present in identity-based public key systems, and the need to construct a public key infrastructure in traditional public key systems. The past saw a wealth of research into the encryption mechanisms in the CB-PKS, called certificate-based encryption (CBE). Indeed, encrypted data (ciphertext) can be used in other applications such as the comparison of personal medical data as two ciphertexts can be compared to determine if they contain the same data (plaintext). However, the equality test of two ciphertexts in the CB-PKS is an open issue since research which has empirically studied is scant. The purpose of this paper is to propose the first certificate-based encryption with equality test (CBEET), and to prove that it is secure under the bilinear Diffie-Hellman (BDH) assumption.

show abstract

Section: Introductionmentioning

confidence: 99%