A gapless code-based hash proof system based on RQC and its applications
From MaRDI portal
Publication:2099170
DOI10.1007/s10623-022-01075-7zbMath1502.94030OpenAlexW3126830295WikidataQ113903984 ScholiaQ113903984MaRDI QIDQ2099170
Olivier Blazy, Philippe Gaborit, Loïc Bidoux, Slim Bettaieb, Yann Connan
Publication date: 23 November 2022
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10623-022-01075-7
Linear codes (general theory) (94B05) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Smooth projective hashing and two-message oblivious transfer
- Theory of codes with maximum rank distance
- Improved identification schemes based on error-correcting codes
- A modular analysis of the Fujisaki-Okamoto transformation
- Two-round PAKE from approximate SPH and instantiations from lattices
- Hash proof systems over lattices revisited
- An algebraic attack on rank metric code-based cryptosystems
- Improvements of algebraic attacks for solving the rank decoding and MinRank problems
- Generic Construction of UC-Secure Oblivious Transfer
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- Security Proofs for Signature Schemes
- Disjunctions for Hash Proof Systems: New Constructions and Applications
- Adaptive Oblivious Transfer and Generalization
- On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
- On the Complexity of the Rank Syndrome Decoding Problem
- Round-Optimal Password-Based Authenticated Key Exchange
- Full Cryptanalysis of the Chen Identification Protocol
- A new paradigm for public key identification
- Smooth Projective Hashing for Conditionally Extractable Commitments
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- On the inherent intractability of certain coding problems (Corresp.)
- On a Special Class of Polynomials
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- A new identification algorithm
- A Practical Group Signature Scheme Based on Rank Metric
- Efficient Encryption From Random Quasi-Cyclic Codes
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Witness encryption and its applications
