Download now Free registration required
Semantic-security of individual bits under a ciphertext is fundamental notion in modern cryptography. In this paper, the authors present the first results about this fundamental problem for Order-Preserving Encryption (OPE): \"What plaintext information can be semantically hidden by OPE encryptions?\" While OPE has gained much attention in recent years due to its usefulness in secure databases, any partial-plaintext indistinguishability (semantic security) result for it was open. Here, they propose a new indistinguishability-based security notion for OPE, which can ensure secrecy of lower bits of a plaintext (under essentially a random ciphertext probing setting).
- Format: PDF
- Size: 546.6 KB