@inbook {19638,
title = {Improved Non-committing Encryption with Applications to Adaptively Secure Protocols},
booktitle = {Advances in Cryptology {\textendash} ASIACRYPT 2009},
series = {Lecture Notes in Computer Science},
year = {2009},
month = {2009/01/01/},
pages = {287 - 302},
publisher = {Springer Berlin Heidelberg},
organization = {Springer Berlin Heidelberg},
abstract = {We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC {\textquoteright}96) and of Damg{\r a}rd and Nielsen (Crypto {\textquoteright}00), our construction achieves all of the following properties: Optimal round complexity. Our encryption scheme is a 2-round protocol, matching the round complexity of Canetti et al. and improving upon that in Damg{\r a}rd and Nielsen. Weaker assumptions. Our construction is based on trapdoor simulatable cryptosystems, a new primitive that we introduce as a relaxation of those used in previous works. We also show how to realize this primitive based on hardness of factoring. Improved efficiency. The amortized complexity of encrypting a single bit is O(1) public key operations on a constant-sized plaintext in the underlying cryptosystem. As a result, we obtain the first non-committing public-key encryption schemes under hardness of factoring and worst-case lattice assumptions; previously, such schemes were only known under the CDH and RSA assumptions. Combined with existing work on secure multi-party computation, we obtain protocols for multi-party computation secure against a malicious adversary that may adaptively corrupt an arbitrary number of parties under weaker assumptions than were previously known. Specifically, we obtain the first adaptively secure multi-party protocols based on hardness of factoring in both the stand-alone setting and the UC setting with a common reference string.},
keywords = {adaptive corruption, Algorithm Analysis and Problem Complexity, Applications of Mathematics, Data Encryption, Data Structures, Cryptology and Information Theory, Discrete Mathematics in Computer Science, non-committing encryption, public-key encryption, secure multi-party computation, Systems and Data Security},
isbn = {978-3-642-10365-0, 978-3-642-10366-7},
url = {http://link.springer.com/chapter/10.1007/978-3-642-10366-7_17},
author = {Choi, Seung Geol and Dana Dachman-Soled and Malkin, Tal and Wee, Hoeteck},
editor = {Matsui, Mitsuru}
}