SCB Mode: Semantically Secure Length-Preserving Encryption
نویسندگان
چکیده
To achieve semantic security, symmetric encryption schemes classically require ciphertext expansion. In this paper we provide a means to security while preserving the length of messages at cost mildly sacrificing correctness. Concretely, propose new scheme that can be interpreted as secure alternative (or wrapper around) plain Electronic Codebook (ECB) mode encryption, and for reason name it Secure (SCB). Our is first length-preserving effectively security.
منابع مشابه
Semantically Secure Anonymity: Foundations of Re-encryption
The notion of universal re-encryption is an established primitive used in the design of many anonymity protocols. It allows anyone to randomize a ciphertext without changing its size, without decrypting it, and without knowing the receiver’s public key. By design it prevents the randomized ciphertext from being correlated with the original ciphertext. We revisit and analyze the security foundat...
متن کاملArx: A DBMS with Semantically Secure Encryption
In recent years, encrypted databases have emerged as a promising direction that provides data confidentiality without sacrificing functionality: queries are executed on encrypted data. However, existing practical proposals rely on a set of weak encryption schemes that have been shown to leak sensitive data. In this paper, we propose Arx, a practical and functionally rich database system that en...
متن کاملStructure Preserving CCA Secure Encryption and Applications
In this paper we present the first CCA-secure public key encryption scheme that is structure preserving, i.e., our encryption scheme uses only algebraic operations. In particular, it does not use hashfunctions or interpret group elements as bit-strings. This makes our scheme a perfect building block for cryptographic protocols where parties for instance want to prove properties about ciphertext...
متن کاملOrder-Preserving Encryption Secure Beyond One-Wayness
Semantic-security of individual plaintext bits given the corresponding ciphertext is a fundamental notion in modern cryptography. We initiate the study of this basic problem for Order-Preserving Encryption (OPE), asking “what plaintext information can be semantically hidden by OPE encryptions?” OPE has gained much attention in recent years due to its usefulness for secure databases, and has rec...
متن کاملPolynomial-Time, Semantically-Secure Encryption Achieving the Secrecy Capacity
In the wiretap channel setting, one aims to get information-theoretic privacy of communicated data based only on the assumption that the channel from sender to adversary is noisier than the one from sender to receiver. The secrecy capacity is the optimal (highest possible) rate of a secure scheme, and the existence of schemes achieving it has been shown. For thirty years the ultimate and unreac...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IACR transaction on symmetric cryptology
سال: 2022
ISSN: ['2519-173X']
DOI: https://doi.org/10.46586/tosc.v2022.i4.1-23