A new paradigm for public key identification
From MaRDI portal
Publication:3129463
DOI10.1109/18.556672zbMath0944.94008OpenAlexW2129725231MaRDI QIDQ3129463
Publication date: 26 September 2000
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/1736691fb664c8766197117788609d6ee730700b
Related Items (44)
SoK: how (not) to design and implement post-quantum cryptography ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Policy-based signature scheme from lattices ⋮ Black-box accumulation based on lattices ⋮ Memory lower bounds of reductions revisited ⋮ A rank metric code-based group signature scheme ⋮ A correction to a code-based blind signature scheme ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ Identity based identification from algebraic coding theory ⋮ On tightly-secure (linkable) ring signatures ⋮ Lattice-Based Group Encryption with Full Dynamicity and Message Filtering Policy ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ From 5-Pass $$\mathcal {MQ}$$-Based Identification to $$\mathcal {MQ}$$-Based Signatures ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Disjunctive delimited control ⋮ Multimodal private signatures ⋮ Entanglement Between Hash Encodings and Signatures from ID Schemes with Non-binary Challenges: A Case Study on Lightweight Code-Based Signatures ⋮ Verifiable Decryption for Fully Homomorphic Encryption ⋮ Efficient unique ring signatures from lattices ⋮ Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors ⋮ Zero-knowledge range arguments for signed fractional numbers from lattices ⋮ Traceable policy-based signatures and instantiation from lattices ⋮ Efficient code-based fully dynamic group signature scheme ⋮ Non-interactive composition of sigma-protocols via Share-then-Hash ⋮ Acyclicity programming for sigma-protocols ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ A New Efficient Threshold Ring Signature Scheme Based on Coding Theory ⋮ Speeding-up verification of digital signatures ⋮ Public key compression for constrained linear signature schemes ⋮ Almost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptions ⋮ A code-based group signature scheme ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications ⋮ Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems ⋮ Lattice-Based Identification Schemes Secure Under Active Attacks ⋮ Traceable ring signatures: general framework and post-quantum security ⋮ An efficient statistical zero-knowledge authentication protocol for smart cards ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Group encryption: full dynamicity, message filtering and code-based instantiation ⋮ Lattice-based group signatures: achieving full dynamicity (and deniability) with ease ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ Zero-knowledge proofs for committed symmetric Boolean functions
This page was built for publication: A new paradigm for public key identification
