TY - CHAP
T1 - Improved Non-committing Encryption with Applications to Adaptively Secure Protocols
T2 - Advances in Cryptology – ASIACRYPT 2009
Y1 - 2009
A1 - Choi, Seung Geol
A1 - Dana Dachman-Soled
A1 - Malkin, Tal
A1 - Wee, Hoeteck
ED - Matsui, Mitsuru
KW - adaptive corruption
KW - Algorithm Analysis and Problem Complexity
KW - Applications of Mathematics
KW - Data Encryption
KW - Data Structures, Cryptology and Information Theory
KW - Discrete Mathematics in Computer Science
KW - non-committing encryption
KW - public-key encryption
KW - secure multi-party computation
KW - Systems and Data Security
AB - We present a new construction of non-committing encryption schemes. Unlike the previous constructions of Canetti et al. (STOC ’96) and of Damgård and Nielsen (Crypto ’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å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.
JA - Advances in Cryptology – ASIACRYPT 2009
T3 - Lecture Notes in Computer Science
PB - Springer Berlin Heidelberg
SN - 978-3-642-10365-0, 978-3-642-10366-7
UR - http://link.springer.com/chapter/10.1007/978-3-642-10366-7_17
ER -