arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2311.00847cs.CR
收藏

基于$\bot$-PRF的伪随机态签名构造

Signatures From Pseudorandom States via $\bot$-PRFs

Mohammed Barhoush, Amit Behera, Lior Ozer, Louis Salvail, Or Sattath

AI总结:

该研究提出$\bot$-PRG与$\bot$-PRF新定义,基于伪确定性PRG完成构造,并以此实现了带经典公钥与签名的量子数字签名,解决了领域未决问题,还构造了抗篡改量子公钥的CPA安全公钥加密方案。

摘要:

不同类型的量子伪随机性已被证明可用于多种密码学应用,其突出优势是这些密码原语的安全性假设可能弱于后量子单向函数。Ananth、Lin与Yuen(2023)已证明,对数长度的伪随机态可用于构造伪确定性PRG(伪随机生成器):通俗来说,对于固定种子,其输出相同的概率为$1-1/poly$。\n 在本研究中,我们提出了$\bot$-PRG和$\bot$-PRF的新定义。其正确性保证为:对于固定种子,除可忽略概率外,输出要么保持一致(概率为$1-1/poly$),要么为可识别的中止标记,记为$\bot$。我们的方法可自然定义多次PRG安全性,以及PRF的自适应安全性。我们基于任意伪确定性PRG构造了$\bot$-PRG,并进一步基于该$\bot$-PRG构造了$\bot$-PRF。\n 尽管大多数小型密码原语(如对称密钥加密、承诺、MAC(消息认证码)、长度受限的一次性数字签名)都已被证明可基于多种量子伪随机性假设实现,但数字签名的构造仍未得到解决。我们的核心应用是一种具备经典公钥与经典签名的(量子)数字签名方案,由此解决了Morimae与Yamakawa(Crypto 2022)的工作中提出的一个未决问题。此外,我们还构造了具备抗篡改量子公钥的CPA安全公钥加密方案。

英文摘要:

Different flavors of quantum pseudorandomness have proven useful for various cryptographic applications, with the compelling feature that these primitives are potentially weaker than post-quantum one-way functions. Ananth, Lin, and Yuen (2023) have shown that logarithmic pseudorandom states can be used to construct a pseudo-deterministic PRG: informally, for a fixed seed, the output is the same with $1-1/poly$ probability. In this work, we introduce new definitions for $\bot$-PRG and $\bot$-PRF. The correctness guarantees are that, for a fixed seed, except with negligible probability, the output is either the same (with probability $1-1/poly$) or recognizable abort, denoted $\bot$. Our approach admits a natural definition of multi-time PRG security, as well as the adaptive security of a PRF. We construct a $\bot$-PRG from any pseudo-deterministic PRG and, from that, a $\bot$-PRF. Even though most mini-crypt primitives, such as symmetric key encryption, commitments, MAC, and length-restricted one-time digital signatures, have been shown based on various quantum pseudorandomness assumptions, digital signatures remained elusive. Our main application is a (quantum) digital signature scheme with classical public keys and signatures, thereby addressing a previously unresolved question posed in Morimae and Yamakawa's work (Crypto, 2022). Additionally, we construct CPA secure public-key encryption with tamper-resilient quantum public keys.

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

↑