Hassan Khodaiemehr, Khadijeh Bagheri, Chen Feng · 2026 · arXiv (Cornell University)
DOI: 10.48550/arxiv.2610.29230 · cited by 0 works (OpenAlex) · open-access PDF
양자 서명 단일 컴퓨터는 공공 키가 체인에 나타나는 모든 Ethereum 계정의 열쇠를 복구 할 수 있습니다. 우리는 Ethereum의 규칙을 변하지 않고 확인하는 사이드 체인이나 브릿지가 그러한 계정을 보호 할 수 있음을 증명합니다 : 그들의 자금은 납품 조건이 양자 안전 원시에만 의존하는 계약으로 이동해야합니다. 우리는 이 보드를 결합하는 변형되지 않은 Ethereum의 보관 시스템 인 \emph{PQ-Vault}를 설계하고, 양자 공격자에 대한 컴팩트 인증서의 첫 번째 보안 증거를 제공합니다 : 고전적으로 선택된 매개 변수로 보증은 128에서 약 60 비트로 떨어지며, 간단한 규칙은 그것을 복원합니다. 우리는 양자 공격자가 가스 기반 인
Machine translation (Meta M2M100); the English original follows.
A quantum computer could recover the key of any Ethereum account whose public key appears on chain. We prove that no sidechain or bridge that leaves Ethereum's rules unchanged can protect such accounts: their funds must move into a contract whose release condition relies only on quantum-safe primitives. We design \emph{PQ-Vault}, a custody system for unmodified Ethereum combining this vault, a quantum-safe proof-of-stake sidechain whose checkpoints carry compact certificates, and an optimistic dispute protocol. We give the first security proof of compact certificates against quantum attackers and a matching attack: with classically chosen parameters, the guarantee falls from 128 to about 60 bits, and a simple rule restores it. We show that a common seed-update rule in hash-chain proof of stake lets an attacker steer chosen slots and profit from splitting its stake, and give an election whose steering gain and inclusion delay are provably bounded against quantum attackers. Since compressing certificates with a pairing-based SNARK breaks quantum security, we use fraud proofs that need a single signature check. For 65,536 validators, a certificate is 0.8 MB, 260 times smaller than all signatures, and verifies in about 20 ms; the vault accepts a checkpoint for about 420,000 gas.
Read in: English · Spanish · Chinese · Hindi · Arabic · Portuguese · French · German · Japanese · Russian · Korean · Indonesian · Vietnamese
Topics: Mathematical proof, Computer security, Computer science, Bounded function, Certificate, Key (lock)
GET https://store.agentexchange.work/gw/papers/verify?title=...&year=... (0.003 USD), fetch this record as JSON with /gw/papers/paper?id=2610.29230, or list what it cites with /gw/papers/references?id=.... Pay per call in USDC (x402) or with a 19 USD card key for 1,000 calls. Catalogue · llms.txtSources: OpenAlex (CC0), arXiv, Crossref. Agent Exchange