A gapless code-based hash proof system based on RQC and its applications

DOI10.1007/S10623-022-01075-7MaRDI QIDQ2099170zbMATH OpenOpenAlexWikidataFDO

Authors Slim Bettaieb, Loïc Bidoux, Olivier Blazy, Yann Connan, Philippe Gaborit

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

zbMATH Keywords

code-based cryptographyhash proof systempassword authenticated key exchangeRQCwitness encryption

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Quantum cryptography (quantum-theoretic aspects) (81P94) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62) Linear codes (general theory) (94B05)

Recommendations

• Hash proof systems over lattices revisited
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Novel identity-based hash proof system with compact master public key from lattices in the standard model
• Breaking the Hardness Assumption and IND-CPA Security of HQC Submitted to NIST PQC Project
• Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric

Cites work

• A modular analysis of the Fujisaki-Okamoto transformation
• A new identification algorithm
• A new paradigm for public key identification
• A practical group signature scheme based on rank metric
• Adaptive oblivious transfer and generalization
• An algebraic attack on rank metric code-based cryptosystems
• Authenticated key exchange secure against dictionary attacks
• Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
• Disjunctions for Hash Proof Systems: New Constructions and Applications
• Efficient Encryption From Random Quasi-Cyclic Codes
• Full cryptanalysis of the Chen identification protocol
• Generic construction of UC-secure oblivious transfer
• Hash proof systems over lattices revisited
• How To Prove Yourself: Practical Solutions to Identification and Signature Problems
• scientific article; zbMATH DE number 2009978 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• Improved identification schemes based on error-correcting codes
• Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
• Improvements of algebraic attacks for solving the rank decoding and MinRank problems
• New techniques for SPHFs and efficient one-round PAKE protocols
• On a Special Class of Polynomials
• On the Complexity of the Rank Syndrome Decoding Problem
• On the Hardness of the Decoding and the Minimum Distance Problems for Rank Codes
• On the inherent intractability of certain coding problems (Corresp.)
• Round-optimal password-based authenticated key exchange
• Security proofs for signature schemes
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Smooth projective hashing and two-message oblivious transfer
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Theory of codes with maximum rank distance
• Two-round PAKE from approximate SPH and instantiations from lattices
• Witness encryption and its applications

Cited in

(2)

• Hash proof systems over lattices revisited
• A gapless post-quantum hash proof system in the Hamming metric

This page was built for publication: A gapless code-based hash proof system based on RQC and its applications

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2099170)