(2020) Constant Ciphertext-Rate Non-committing Encryption from Standard Assumptions.
|
Text
Non_committing_encryption-2.pdf Download (485kB) | Preview |
Abstract
Non-committing encryption (NCE) is a type of public key encryption which comes with the ability to equivocate ciphertexts to encryptions of arbitrary messages, i.e., it allows one to find coins for key generation and encryption which “explain” a given ciphertext as an encryption of any message. NCE is the cornerstone to construct adaptively secure multiparty computation [Canetti et al. STOC’96] and can be seen as the quintessential notion of security for public key encryption to realize ideal communication channels. A large body of literature investigates what is the best message-to-ciphertext ratio (i.e., the rate) that one can hope to achieve for NCE. In this work we propose a near complete resolution to this question and we show how to construct NCE with constant rate in the plain model from a variety of assumptions, such as the hardness of the learning with errors (LWE), the decisional Diffie-Hellman (DDH), or the quadratic residuosity (QR) problem. Prior to our work, constructing NCE with constant rate required a trusted setup and indistinguishability obfuscation [Canetti et al. ASIACRYPT’17].
| Item Type: | Conference or Workshop Item (A Paper) (Paper) |
|---|---|
| Divisions: | Nico Döttling (Cryptographic Algorithms, CA) |
| Conference: | TCC Theory of Cryptography Conference |
| Depositing User: | Nico Döttling |
| Date Deposited: | 04 Feb 2021 09:11 |
| Last Modified: | 11 May 2021 17:16 |
| Primary Research Area: | NRA1: Trustworthy Information Processing |
| URI: | https://publications.cispa.saarland/id/eprint/3355 |
Actions
Actions (login required)
 |
View Item |