Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs

DOI10.1007/978-3-319-78381-9_8zbMath1423.94087OpenAlexW2795220856MaRDI QIDQ1648790

Gregor Seiler, Vadim Lyubashevsky

Publication date: 9 July 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-78381-9_8

Mathematics Subject Classification ID

Cryptography (94A60) Combinatorial codes (94B25)

Related Items (28)

Lattice-based proof of shuffle and applications to electronic voting ⋮ On the hardness of module-LWE with binary secret ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ Practical post-quantum few-time verifiable random function with applications to Algorand ⋮ Lattice-based public-key encryption with equality test supporting flexible authorization in standard model ⋮ Asymptotically quasi-optimal cryptography ⋮ Efficient lattice-based traceable ring signature scheme with its application in blockchain ⋮ On the hardness of module learning with errors with short distributions ⋮ A thorough treatment of highly-efficient NTRU instantiations ⋮ Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general ⋮ MuSig-L: lattice-based multi-signature with single-round online phase ⋮ Lattice signature with efficient protocols, application to anonymous credentials ⋮ Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs ⋮ Lattice-based inner product argument ⋮ Efficient hybrid exact/relaxed lattice proofs and applications to rounding and VRFs ⋮ LaBRADOR: compact proofs for R1CS from Module-SIS ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Chosen-ciphertext lattice-based public key encryption with equality test in standard model ⋮ Practical product proofs for lattice commitments ⋮ Lattice-based blind signatures, revisited ⋮ Covert authentication from lattices ⋮ Improved lattice-based mix-nets for electronic voting ⋮ Implementation of lattice trapdoors on modules and applications

Cites Work

• Unnamed Item
• Kurosawa-Desmedt meets tight security
• NTRU prime: reducing attack surface at low cost
• Worst-case to average-case reductions for module lattices
• Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
• Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
• Extended Nested Dual System Groups, Revisited
• Compactly Hiding Linear Spans
• Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
• Time-Optimal Interactive Proofs for Circuit Evaluation
• Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
• Lattice Signatures without Trapdoors
• Tightly Secure Signatures and Public-Key Encryption
• Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
• Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
• Quasi-Adaptive NIZK for Linear Subspaces Revisited
• Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
• The Kernel Matrix Diffie-Hellman Assumption
• Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
• Efficient Implementation of Bilinear Pairings on ARM Processors
• Structure-Preserving Signatures from Standard Assumptions, Revisited
• Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
• On Ideal Lattices and Learning with Errors over Rings
• Generalized Compact Knapsacks Are Collision Resistant
• Polylogarithmic two-round argument systems
• Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
• Efficient Public Key Encryption Based on Ideal Lattices
• Algebraic methods for interactive proof systems
• Computationally Sound Proofs
• Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
• A Toolkit for Ring-LWE Cryptography
• Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
• How to use indistinguishability obfuscation
• Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
• Adaptive Partitioning
• Advances in Cryptology – CRYPTO 2004
• A Non-interactive Shuffle with Pairing Based Verifiability
• New Techniques for Noninteractive Zero-Knowledge
• Advances in Cryptology - CRYPTO 2003
• Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
• Efficient Non-interactive Proof Systems for Bilinear Groups
• Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
• Automata, Languages and Programming
• Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
• One-Shot Verifiable Encryption from Lattices
• Theory of Cryptography

This page was built for publication: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs