A new paradigm for public key identification
From MaRDI portal
Publication:3129463
Recommendations
- A new NP-complete problem and public-key identification
- scientific article; zbMATH DE number 1950355
- Identification schemes from key encapsulation mechanisms
- Public Key Identification Based on the Equivalence of Quadratic Forms
- A NEW METHOD FOR REALIZING PUBLIC-KEY CRYPTOSYSTEM
- scientific article; zbMATH DE number 176557
- Secret Key-Based Identification and Authentication With a Privacy Constraint
- An isogeny-based ID protocol using structured public keys
- Public-key identification schemes based on multivariate cubic polynomials
Cited in
(73)- Identity based identification from algebraic coding theory
- SoK: how (not) to design and implement post-quantum cryptography
- An efficient statistical zero-knowledge authentication protocol for smart cards
- Speeding-up verification of digital signatures
- A gapless code-based hash proof system based on RQC and its applications
- Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions
- A new NP-complete problem and public-key identification
- Quasi-dyadic Girault identification scheme
- Bicameral and auditably private signatures
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Zero-knowledge proofs for committed symmetric Boolean functions
- Public key compression for constrained linear signature schemes
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Post-quantum secure fully-dynamic logarithmic-size deniable group signature in code-based setting
- From 5-pass \(\mathcal {MQ}\)-based identification to \(\mathcal {MQ}\)-based signatures
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- scientific article; zbMATH DE number 67084 (Why is no real title available?)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Memory lower bounds of reductions revisited
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- A zero-knowledge identification scheme based on the \(q\)-ary syndrome decoding problem
- A lattice-based group signature scheme with verifier-local revocation
- Identity-based identification and signature schemes using error correcting codes
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Group encryption: full dynamicity, message filtering and code-based instantiation
- Policy-based signature scheme from lattices
- Zero-knowledge range arguments for signed fractional numbers from lattices
- Lattice-Based Group Signatures: Achieving Full Dynamicity with Ease
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Cryptanalysis of Harari's identification scheme
- Verifiable Decryption for Fully Homomorphic Encryption
- Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy
- A rank metric code-based group signature scheme
- Multimodal private signatures
- A lattice-based group signature scheme with message-dependent opening
- Lattice-Based Identification Schemes Secure Under Active Attacks
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- An Attack on Some Signature Schemes Constructed from Five-Pass Identification Schemes
- Traceable ring signatures: general framework and post-quantum security
- scientific article; zbMATH DE number 1796970 (Why is no real title available?)
- Traceable policy-based signatures and instantiation from lattices
- An identification system based on the explicit isomorphism problem
- Fully dynamic attribute-based signatures for circuits from codes
- scientific article; zbMATH DE number 1676653 (Why is no real title available?)
- Adaptive oblivious transfer with access control from lattice assumptions
- Non-interactive composition of sigma-protocols via Share-then-Hash
- Efficient code-based fully dynamic group signature scheme
- Short code-based one-out-of-many proofs and applications
- On tightly-secure (linkable) ring signatures
- A NEW BATCH IDENTIFICATION SCHEME
- Code-Based Zero Knowledge PRF Arguments
- Secure Stern Signatures in Quantum Random Oracle Model
- Post-quantum cryptosystems: open problems and current solutions. Isogeny-based and code-based cryptosystems
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- scientific article; zbMATH DE number 2081078 (Why is no real title available?)
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- New results on the Stern identification and signature scheme
- Disjunctive delimited control
- Black-box accumulation based on lattices
- Acyclicity programming for sigma-protocols
- Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Argument of knowledge of a Goppa codeword and of a bounded error
- A code-based group signature scheme
- A gapless post-quantum hash proof system in the Hamming metric
- A multi-group signature scheme from lattices
- A New Efficient Threshold Ring Signature Scheme Based on Coding Theory
- Secret handshakes: full dynamicity, deniability and lattice-based design
- Efficient unique ring signatures from lattices
- Public Key Identification Based on the Equivalence of Quadratic Forms
- scientific article; zbMATH DE number 5012438 (Why is no real title available?)
- Full cryptanalysis of the Chen identification protocol
- A correction to a code-based blind signature scheme
This page was built for publication: A new paradigm for public key identification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3129463)
