A gapless post-quantum hash proof system in the Hamming metric
From MaRDI portal
Publication:6535099
DOI10.1007/978-3-031-33488-7_25zbMATH Open1542.94144MaRDI QIDQ6535099
Publication date: 9 November 2023
code-based cryptographypost-quantum cryptographypassword-based authenticated key exchangehash proof systemwitness encryptionHamming quasi-cyclic
Quantum computation (81P68) Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62) Quantum cryptography (quantum-theoretic aspects) (81P94)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Smooth projective hashing and two-message oblivious transfer
- Improved identification schemes based on error-correcting codes
- Two-round PAKE from approximate SPH and instantiations from lattices
- Hash proof systems over lattices revisited
- A gapless code-based hash proof system based on RQC and its applications
- Two-round PAKE protocol over lattices without NIZK
- New Techniques for SPHFs and Efficient One-Round PAKE Protocols
- Security Proofs for Signature Schemes
- Round-Optimal Password-Based Authenticated Key Exchange
- A new paradigm for public key identification
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- A new identification scheme based on syndrome decoding
- A Practical Group Signature Scheme Based on Rank Metric
- Smooth Projective Hashing and Two-Message Oblivious Transfer
- Universally Composable Password-Based Key Exchange
- Witness encryption and its applications
This page was built for publication: A gapless post-quantum hash proof system in the Hamming metric
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6535099)
