Optimal-rate non-committing encryption

Ran Canetti*, Oxana Poburinnaya, Mariana Raykova

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

4 Scopus citations


Non-committing encryption (NCE) was introduced in order to implement secure channels under adaptive corruptions in situations when data erasures are not trustworthy. In this paper we are interested in the rate of NCE, i.e. in how many bits the sender and receiver need to send per plaintext bit. In initial constructions the length of both the receiver message, namely the public key, and the sender message, namely the ciphertext, is m·poly(λ) for an m-bit message, where λ is the security parameter. Subsequent work improve efficiency significantly, achieving rate poly log(λ). We show the first construction of a constant-rate NCE. In fact, our scheme has rate 1+o(1), which is comparable to the rate of plain semantically secure encryption. Our scheme operates in the common reference string (CRS) model. Our CRS has size poly(m·λ), but it is reusable for an arbitrary polynomial number of m-bit messages. In addition, ours is the first NCE construction with perfect correctness. We assume one way functions and indistinguishability obfuscation for circuits.

Original languageEnglish
Title of host publicationAdvances in Cryptology – ASIACRYPT 2017 - 23rd International Conference on the Theory and Applications of Cryptology and Information Security, Proceedings
EditorsTsuyoshi Takagi, Thomas Peyrin
PublisherSpringer Verlag
Number of pages30
ISBN (Print)9783319706993
StatePublished - 2017
Event23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017 - Hong Kong, Hong Kong
Duration: 3 Dec 20177 Dec 2017

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10626 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference23rd Annual International Conference on Theory and Application of Cryptology and Information Security, ASIACRYPT 2017
Country/TerritoryHong Kong
CityHong Kong


FundersFunder number
National Science Foundation-1523467
Defense Advanced Research Projects AgencyW911NF-16-1-0389, W911NF-15-C-0236
Simons Foundation
Israel Science Foundation1421102, 1523/14, 1562888, 1633282


    • Adaptive security
    • Non-committing encryption


    Dive into the research topics of 'Optimal-rate non-committing encryption'. Together they form a unique fingerprint.

    Cite this