All-But-Many Encryption - A New Framework for Fully-Equipped UC Commitments.
ADVANCES IN CRYPTOLOGY - ASIACRYPT 2014, PT II(2014)
摘要
We present a general framework for constructing non-interactive universally composable (UC) commitment schemes that are secure against adaptive adversaries in the non-erasure model under a reusable common reference string. Previously, such "fully-equipped" UC commitment schemes have been known only in [5, 6], with strict expansion factor O(kappa); meaning that to commit lambda bits, communication strictly requires O(lambda kappa) bits, where kappa denotes the security parameter. Efficient construction of a fully-equipped UC commitment scheme is a long-standing open problem. We introduce new abstraction, called all-but-many encryption (ABME), and prove that it captures a fully-equipped UC commitment scheme. We propose the first fully-equipped UC commitment scheme with optimal expansion factor Omega(1) from our ABME scheme related to the DCR assumption. We also provide an all-but-many lossy trapdoor function (ABM-LTF) [18] from our DCR-based ABME scheme, with a better lossy rate than [18].
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络