Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
From MaRDI portal
Publication:1633440
DOI10.1007/978-3-030-03326-2_3zbMath1446.94124arXiv1804.02556OpenAlexW2898448716MaRDI QIDQ1633440
Jean-Pierre Tillich, Thomas Debris-Alazard
Publication date: 20 December 2018
Full work available at URL: https://arxiv.org/abs/1804.02556
Related Items (13)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Cryptanalysis of the rank preserving signature ⋮ A rank metric code-based group signature scheme ⋮ Compact post-quantum signatures from proofs of knowledge leveraging structure for the \textsf{PKP, SD} and \textsf{RSD} problems ⋮ Revisiting algebraic attacks on MinRank and on the rank decoding problem ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ LRPC codes with multiple syndromes: near ideal-size KEMs without ideals ⋮ Improvements of algebraic attacks for solving the rank decoding and MinRank problems ⋮ Statistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledge ⋮ An algebraic attack on rank metric code-based cryptosystems ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ The security of the code-based signature scheme based on the Stern identification protocol ⋮ An algebraic approach to the rank support learning problem
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Yet another compiler for active security or: efficient MPC over arbitrary rings
- Security and composition of multiparty cryptographic protocols
- Asymptotic behaviour of codes in rank metric over finite fields
- Secure multi-party computation without agreement
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae
- Efficient Three-Party Computation from Cut-and-Choose
- Multiparty Computation from Somewhat Homomorphic Encryption
- A New Approach to Practical Active-Secure Two-Party Computation
- On Computing Nearest Neighbors with Applications to Decoding of Binary Linear Codes
- Identity-Based Cryptosystems and Signature Schemes
- Semi-homomorphic Encryption and Multiparty Computation
- Decoding Random Linear Codes in $\tilde{\mathcal{O}}(2^{0.054n})$
- Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
- Perfectly Secure Multiparty Computation and the Computational Overhead of Cryptography
- Scalable Multiparty Computation with Nearly Optimal Work and Resilience
- Founding Cryptography on Oblivious Transfer – Efficiently
- Asynchronous Multiparty Computation: Theory and Implementation
- Foundations of Cryptography
- Circuits resilient to additive attacks with applications to secure computation
- Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator
- High-Throughput Secure Three-Party Computation for Malicious Adversaries and an Honest Majority
- Scalable Secure Multiparty Computation
- Public Key Cryptography - PKC 2006
This page was built for publication: Two attacks on rank metric code-based schemes: RankSign and an IBE scheme
