arXivDaily arXiv每日学术速递 周一至周五更新
北美退伍军人节(Veterans Day),12 日无更新
arXiv 2410.08367quant-phcs.CR
收藏

基于噪声量子存储的非交互式不经意传输与一次性程序

Non-Interactive Oblivious Transfer and One-Time Programs from Noisy Quantum Storage

Ricardo Faleiro, Manuel Goulão, Leonardo Novo, Emmanuel Zambrini Cruzeiro

AI总结:

本研究在噪声量子存储模型下利用量子资源,实现了消息数最少的无条件安全双消息非交互式OT、无需可信硬件等的永久安全计算安全单次OT/OTM,以及无需硬件或QROM的一次性程序。

摘要:

很少有密码学原语像不经意传输(Oblivious Transfer,OT)那样与密码学基础紧密交织。不出所料,随着量子信息处理的兴起,一条重要的研究路径已然形成:其旨在利用量子资源最小化实现OT所需的前提条件,同时探索其对安全计算的影响。实际上,鉴于OT在量子领域新发现的可能性(以及不可能性),它已成为计算复杂度和通信复杂度两方面重新关注的焦点。例如,经典条件下已知不可能实现的非交互式OT,一直是学界大力研究的方向。在其最极端的形式中,非交互式选择输入OT(单次OT)等价于一次性存储器(One-Time Memory,OTM)。OTM已被提出作为防篡改硬件解决方案,用于构建一次性程序——这类程序可在任意输入上执行,且不会泄露任何内部工作机制的信息,仅能使用一次。在本研究中,我们在噪声量子存储模型(Noisy-Quantum-Storage Model)中利用量子资源实现了以下成果:1. 无条件安全的双消息非交互式OT——这是目前已知的无条件安全选择输入OT所需的最少消息数。2. 具有永久安全性的计算安全单次OT/OTM,仅需假设单向函数和序列函数存在,无需可信硬件、量子随机谕言机模型(QROM)或预共享纠缠。3. 通过将我们的OTM构造与[GKR08, GIS+10]编译器相结合,无需基于硬件的解决方案或QROM即可实现一次性程序。

英文摘要:

Few primitives are as intertwined with the foundations of cryptography as Oblivious Transfer (OT). Not surprisingly, with the advent of quantum information processing, a major research path has emerged, aiming to minimize the requirements necessary to achieve OT by leveraging quantum resources, while also exploring the implications for secure computation. Indeed, OT has been the target of renewed focus regarding its newfound quantum possibilities (and impossibilities), both towards its computation and communication complexity. For instance, non-interactive OT, known to be impossible classically, has been strongly pursued. In its most extreme form, non-interactive chosen-input OT (one-shot OT) is equivalent to a One-Time Memory (OTM). OTMs have been proposed as tamper-proof hardware solutions for constructing One-Time Programs -- single-use programs that execute on an arbitrary input without revealing anything about their internal workings. In this work, we leverage quantum resources in the Noisy-Quantum-Storage Model to achieve: 1. Unconditionally-secure two-message non-interactive OT -- the smallest number of messages known to date for unconditionally-secure chosen-input OT. 2. Computationally-secure one-shot OT/OTM, with everlasting security, assuming only one-way functions and sequential functions -- without requiring trusted hardware, QROM, or pre-shared entanglement. 3. One-Time Programs without the need for hardware-based solutions or QROM, by compiling our OTM construction with the [GKR08, GIS+10] compiler.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑