QROM에서 아이소제니 기반 그룹 서명과 책임 링 서명
본 논문에서는 양자 랜덤 오라클 모델(QROM)에서 증명 가능한 보안을 제공하는 최초의 아이소제니 기반 그룹 서명(GS) 및 책임 링 서명(ARS)을 제시합니다.
量子ランダムオラクルモデルにおけるアイソジェニーベースのグループ署名とアカウンタブルリング署名
本稿では、量子コンピュータ時代においても安全なデジタル署名方式である、アイソジェニーベースのグループ署名とアカウンタブルリング署名を、量子ランダムオラクルモデルを用いて初めて実現した。
Provably Secure Isogeny-Based Group and Accountable Ring Signatures in the Quantum Random Oracle Model
This paper introduces the first provably secure group signature and accountable ring signature schemes based on isogenies that achieve security in the quantum random oracle model (QROM), offering a robust post-quantum alternative to lattice-based schemes.
IOP ベースの簡潔な議論のための量子巻き戻し
本稿では、インタラクティブオラクルプルーフ（IOP）とベクトルコミットメントスキームから構築された簡潔なインタラクティブ議論の、量子コンピュータに対する安全性を分析し、ベクトルコミットメントスキームが「コラプシング」である場合、IBCS変換のインタラクティブな変種が、量子的な攻撃者に対して標準モデルで安全であることを証明しています。
Quantum Security of Interactive Oracle Proof-Based Succinct Arguments
This paper proves the security of a class of highly efficient succinct interactive arguments, constructed from interactive oracle proofs (IOPs), against quantum adversaries, addressing a key open problem in post-quantum cryptography.
Pseudorandom Function-like States from Common Haar Unitary: Achieving Adaptive Security in the Quantum Random Oracle Model
This paper introduces a novel construction of pseudorandom function-like state generators (PRFSGs) that achieve adaptive security in the idealized setting of the invertible quantum Haar random oracle (QHRO) model, showcasing the potential of common random unitaries in building secure quantum cryptographic primitives.
Quantum-Computable Trapdoor One-Way Functions Exist Even if P=NP (Relative to an Oracle)
This paper demonstrates that even if P=NP, there exists a specially constructed oracle relative to which quantum computers could still have a cryptographic advantage over classical computers, enabling functionalities like public-key encryption and digital signatures.
A Comprehensive Overview of Post-Quantum Security
This article provides a pedagogical overview of post-quantum security, emphasizing the vulnerabilities of current cryptographic systems to quantum computers and introducing lattice-based cryptography as a viable solution.
行列符号上のMinRank Gabidulin暗号化スキーム
本稿では、古典的なMcElieceフレームワークを、行列符号とMinRank問題に一般化した新しい公開鍵暗号化スキームを提案する。特に、Gabidulin行列符号（行列符号とみなされるGabidulinランク符号）に適用し、従来のGoppa符号を用いたMcElieceスキームよりも優れた、暗号文サイズと公開鍵サイズのトレードオフを実現する。
BIKE 암호 시스템에서 약한 키를 방지하기 위한 조합적 접근 방식
본 논문에서는 BIKE 암호 시스템의 약점으로 알려진 4-사이클 구조를 분석하고, 이를 기반으로 약한 키를 효율적으로 필터링하는 새로운 기법을 제시합니다.
© 2024 by Linnk AI