Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications

From MaRDI portal
Publication:4916004

DOI10.1007/978-3-642-36362-7_8zbMath1314.94087OpenAlexW147565578MaRDI QIDQ4916004

Khoa Nguyen, Damien Stehlé, San Ling, Huaxiong Wang

Publication date: 19 April 2013

Published in: Public-Key Cryptography – PKC 2013 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-36362-7_8




Related Items

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based CryptographyCompact Privacy Protocols from Post-quantum and Timed Classical AssumptionsEfficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to PrivacySubtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over latticesLattice-based zero-knowledge arguments for additive and multiplicative relationsPolicy-based signature scheme from latticesA Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third PartiesMore efficient amortization of exact zero-knowledge proofs for LWEMemory lower bounds of reductions revisitedFaster Gaussian sampling for trapdoor lattices with arbitrary modulusToward non-interactive zero-knowledge proofs for NP from LWELattice-Based Group Encryption with Full Dynamicity and Message Filtering PolicyZero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group EncryptionSignature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice AssumptionsLattice-based zero-knowledge proofs and applications: shorter, simpler, and more generalMultimodal private signaturesVerifiable decryption in the headZero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoorsZero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejectionBLOOM: bimodal lattice one-out-of-many proofs and applicationsForward-secure revocable secret handshakes from latticesTraceable policy-based signatures and instantiation from latticesEfficient code-based fully dynamic group signature schemeStatistical zero-knowledge and analysis of rank-metric zero-knowledge proofs of knowledgeSecret handshakes: full dynamicity, deniability and lattice-based designGroup signature from lattices preserving forward security in dynamic settingZero-knowledge arguments for matrix-vector relations and lattice-based group encryptionLattice-Based Group Signatures with Verifier-Local Revocation: Achieving Shorter Key-Sizes and Explicit Traceability with EaseAlmost fully anonymous attribute-based group signatures with verifier-local revocation and member registration from lattice assumptionsA lattice-based group signature scheme with verifier-local revocationOne-Shot Verifiable Encryption from LatticesA framework for cryptographic problems from linear algebraMulti-theorem preprocessing NIZKs from latticesTraceable ring signatures: general framework and post-quantum securityAdaptive oblivious transfer with access control from lattice assumptionsSigma protocols for MQ, PKP and SIS, and fishy signature schemesA Lattice-Based Group Signature Scheme with Message-Dependent OpeningShorter lattice-based zero-knowledge proofs via one-time commitmentsGroup encryption: full dynamicity, message filtering and code-based instantiationHow to Prove Knowledge of Small SecretsLattice-based group signatures: achieving full dynamicity (and deniability) with easeA new Gaussian sampling for trapdoor lattices with arbitrary modulusRevocable hierarchical attribute-based signatures from latticesCovert authentication from latticesA gapless code-based hash proof system based on RQC and its applicationsZero-knowledge proofs for committed symmetric Boolean functions



Cites Work


This page was built for publication: Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications