Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
From MaRDI portal
(Redirected from Publication:2128574)
Recommendations
- ON THE RING OF ALGEBRAIC INTEGERS OF CYCLOTOMIC SUBFIELDS
- Lattices over cyclic groups and Noether settings
- scientific article; zbMATH DE number 1264940
- Lattices over integral group rings and abelian subquotients
- Cyclotomic schemes over finite rings
- A note on cyclotomic subfields
- On the structure of basic sets of Schur rings over cyclic groups
- On Dedekind subrings
- A generalization of Lüneburg's results to arithmetical rings
- On subtractive ideals of \((m,n)\)-semirings
Cites work
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 967875 (Why is no real title available?)
- A new identification scheme based on syndrome decoding
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Aurora: transparent succinct arguments for R1CS
- Better zero-knowledge proofs for lattice encryption and their application to group signatures
- Circuit amortization friendly encodingsand their application to statistically secure multiparty computation
- Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings
- Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications
- Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
- Expected-time cryptography: generic techniques and applications to concrete soundness
- Generalized Compact Knapsacks Are Collision Resistant
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Key homomorphic PRFs and their applications
- Lattice signatures without trapdoors
- More efficient algorithms for the NTRU key generation using the field norm
- On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings
- On the key equation over a commutative ring
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Short discrete log proofs for FHE and ring-LWE ciphertexts
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits
- Transparent SNARKs from DARK compilers
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
Cited in
(19)- \textsf{Orbweaver}: succinct linear functional commitments from lattices
- Lattice-based succinct arguments from vanishing polynomials (extended abstract)
- Two-round threshold signature from algebraic one-more learning with errors
- Fiat-Shamir transformation of multi-round interactive proofs
- Efficient laconic cryptography from learning with errors
- Practical sublinear proofs for R1CS from lattices
- Chainable functional commitments for unbounded-depth circuits
- Multilinear Schwartz-Zippel \(\operatorname{mod} \mathrm{N}\) and lattice-based succinct arguments
- Aggregating Falcon signatures with LaBRADOR
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Lattice-based SNARKs: publicly verifiable, preprocessing, and recursively composable (extended abstract)
- Lattice-based polynomial commitments: towards asymptotic and concrete efficiency
- SLAP: succinct lattice-based polynomial commitments from standard assumptions
- A compressed \(\varSigma \)-protocol theory for lattices
- Quantum rewinding for many-round protocols
- Fiat-Shamir transformation of multi-round interactive proofs (Extended version)
- Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup
- Lattice-based timed cryptography
- On the multi-user security of LWE-based NIKE
This page was built for publication: Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2128574)
