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

后量子世界中序贯工作证明的安全性

On the Security of Proofs of Sequential Work in a Post-Quantum World

Jeremiah Blocki, Seunghoon Lee, Samson Zhou

摘要:

顺序工作证明(PoSW)允许证明者说服资源受限的验证者,证明者投入了大量的顺序时间来执行一些底层计算。PoSW有许多应用,包括时间戳,区块链设计和通用可验证的CPU基准。Mahmoody,Moran和Vadhan(ITCS 2013)在随机预言模型中首次构建了PoSW,尽管该构建依赖于昂贵的深度鲁棒图。在最近的一项突破中,Cohen和Pietrzak(EUROPENTAL PT 2018)给出了一种高效的PoSW构造,不需要昂贵的深度鲁棒图。在经典的并行随机预言模型中,可以直接论证任何成功的PoSW攻击者必须产生长的$\mathcal{H}$ -序列,并且任何在顺序时间$T-1$中运行的恶意方将无法产生长度为$T$的$\mathcal{H}$ -序列,除非具有可忽略的概率。在本文中,我们证明了任何量子攻击者在顺序时间$T-1$将无法产生一个$\mathcal{H}$ -序列,除非可以忽略不计的概率-即使攻击者提交了大量的量子查询在每一轮。这个证明更具挑战性,并突出了Zhandry最近压缩的oracle技术的强大功能(NIPPTO 2019)。我们进一步扩展了这一结果,通过将Fiat-Shamir变换应用于Cohen和Pietrzak的有效构造来建立非交互式PoSW的后量子安全性(EUROPHOTOPT 2018)。

英文摘要:

A Proof of Sequential Work (PoSW) allows a prover to convince a resource-bounded verifier that the prover invested a substantial amount of sequential time to perform some underlying computation. PoSWs have many applications including time-stamping, blockchain design, and universally verifiable CPU benchmarks. Mahmoody, Moran, and Vadhan (ITCS 2013) gave the first construction of a PoSW in the random oracle model though the construction relied on expensive depth-robust graphs. In a recent breakthrough, Cohen and Pietrzak (EUROCRYPT 2018) gave an efficient PoSW construction that does not require expensive depth-robust graphs. In the classical parallel random oracle model, it is straightforward to argue that any successful PoSW attacker must produce a long $\mathcal{H}$-sequence and that any malicious party running in sequential time $T-1$ will fail to produce an $\mathcal{H}$-sequence of length $T$ except with negligible probability. In this paper, we prove that any quantum attacker running in sequential time $T-1$ will fail to produce an $\mathcal{H}$-sequence except with negligible probability -- even if the attacker submits a large batch of quantum queries in each round. The proof is substantially more challenging and highlights the power of Zhandry's recent compressed oracle technique (CRYPTO 2019). We further extend this result to establish post-quantum security of a non-interactive PoSW obtained by applying the Fiat-Shamir transform to Cohen and Pietrzak's efficient construction (EUROCRYPT 2018).

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

↑