Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
type: Item
instance of: scholarly article
title: Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
zbMATH Open document ID: 1423.94087
DOI: 10.1007/978-3-319-78381-9_8
author: Vadim Lyubashevsky
author: Gregor Seiler
publication date: 2018-07-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
Mathematics Subject Classification ID: 94B25
zbMATH DE Number: 6900678
MaRDI profile type: Publication
full work available at URL: 978-3-319-78381-9 8
OpenAlex ID: W2795220856
cites work: NTRU prime: reducing attack surface at low cost
cites work: Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
cites work: Practical Lattice-Based Cryptography: A Signature Scheme for Embedded Systems
cites work: Generalized Compact Knapsacks Are Collision Resistant
cites work: One-Shot Verifiable Encryption from Lattices
cites work: On Ideal Lattices and Learning with Errors over Rings
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Worst-case to average-case reductions for module lattices
cites work: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures
cites work: Lattice Signatures without Trapdoors
cites work: Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
cites work: Towards Practical Lattice-Based Public-Key Encryption on Reconfigurable Hardware
cites work: Theory of Cryptography
cites work: Q3549647
cites work: Making NTRU as Secure as Worst-Case Problems over Ideal Lattices
cites work: Efficient Public Key Encryption Based on Ideal Lattices
cites work: Kurosawa-Desmedt meets tight security
cites work: Extended Nested Dual System Groups, Revisited
cites work: Efficient Implementation of Bilinear Pairings on ARM Processors
cites work: Simulation-Sound NIZK Proofs for a Practical Language and Constant Size Group Signatures
cites work: A Non-interactive Shuffle with Pairing Based Verifiability
cites work: New Techniques for Noninteractive Zero-Knowledge
cites work: Efficient Non-interactive Proof Systems for Bilinear Groups
cites work: Adaptive Partitioning
cites work: Algebraic Partitioning: Fully Compact and (almost) Tightly Secure Cryptography
cites work: Tightly Secure Signatures and Public-Key Encryption
cites work: Identity-Based Encryption with (Almost) Tight Security in the Multi-instance, Multi-ciphertext Setting
cites work: Improved Structure Preserving Signatures Under Standard Bilinear Assumptions
cites work: Switching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
cites work: Structure-Preserving Signatures from Standard Assumptions, Revisited
cites work: Quasi-Adaptive NIZK for Linear Subspaces Revisited
cites work: Advances in Cryptology – CRYPTO 2004
cites work: Concise Multi-challenge CCA-Secure Encryption and Signatures with Almost Tight Security
cites work: Compactly Hiding Linear Spans
cites work: Short Group Signatures via Structure-Preserving Signatures: Standard Model Security from Simple Assumptions
cites work: The Kernel Matrix Diffie-Hellman Assumption
cites work: Stretching Groth-Sahai: NIZK Proofs of Partial Satisfiability
cites work: Prover-Efficient Commit-and-Prove Zero-Knowledge SNARKs
cites work: Algebraic methods for interactive proof systems
cites work: Computationally Sound Proofs
cites work: Polylogarithmic two-round argument systems
cites work: Advances in Cryptology - CRYPTO 2003
cites work: How to use indistinguishability obfuscation
cites work: Time-Optimal Interactive Proofs for Circuit Evaluation
cites work: Incrementally Verifiable Computation or Proofs of Knowledge Imply Time/Space Efficiency
cites work: Automata, Languages and Programming
description: scientific article; zbMATH DE number 6900678