Universally Composable Symmetric Encryption
Universally Composable Symmetric Encryption
复制标题
通用可组合对称加密
DOI：
--
复制
发表时间：
2009
期刊：
影响因子：
--
通讯作者：
Max Tuengerthal
中科院分区：
文献类型：
--
作者：
Ralf Küsters;Max Tuengerthal
对于大多数基本的密码任务，如公钥加密、数字签名、身份验证、密钥交换和许多其他更复杂的任务，理想的功能已经在基于仿真的安全方法中制定，沿着它们的实现。然而，令人惊讶的是，除了更抽象的Dolev-Yao风格的功能之外，对称加密不存在这样的功能。在本文中，我们填补了这一空白。我们提出了两个功能的对称加密，未经认证和认证的版本，并表明它们可以实现基于标准的密码学假设对称加密方案，即IND-CCA安全和认证加密，分别提供的环境不创建密钥周期或导致这些所谓的承诺问题。我们还说明了我们的功能在应用程序中的有用性，无论是在基于模拟和基于游戏的安全设置。
For most basic cryptographic tasks, such as public-key encryption, digital signatures, authentication, key exchange, and many other more sophisticated tasks, ideal functionalities have been formulated in the simulation-based security approach, along with their realizations. Surprisingly, however, no such functionality exists for symmetric encryption, except for a more abstract Dolev-Yao style functionality. In this paper, we fill this gap. We propose two functionalities for symmetric encryption, an unauthenticated and an authenticated version, and show that they can be implemented based on standard cryptographic assumptions for symmetric encryption schemes, namely IND-CCA security and authenticated encryption, respectively, provided that the environment does not create key cycles or cause these-called commitment problem. We also illustrate the usefulness of our functionalities in applications, both in simulation-based and game-based security settings.