Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices - MaRDI portal

Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (Q2128574)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices	scientific article

Statements

scholarly article

0 references

Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices (English)

0 references

Martin R. Albrecht

0 references

Russell W. F. Lai

0 references

publication date

22 April 2022

0 references

zbMATH Keywords

lattice-based cryptography

0 references

Schnorr-like protocols

0 references

describes a project that uses

0 references

0 references

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-030-84245-1_18

0 references

Efficient information-theoretic secure multiparty computation over \(\mathbb{Z}/p^k\mathbb{Z}\) via Galois rings

0 references

Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits

0 references

Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography

0 references

Aurora: transparent succinct arguments for R1CS

0 references

Better Zero-Knowledge Proofs for Lattice Encryption and Their Application to Group Signatures

0 references

Sigma protocols for MQ, PKP and SIS, and fishy signature schemes

0 references

Key Homomorphic PRFs and Their Applications

0 references

Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting

0 references

A non-PCP approach to succinct quantum-safe zero-knowledge

0 references

Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs

0 references

Transparent SNARKs from DARK compilers

0 references

Circuit amortization friendly encodingsand their application to statistically secure multiparty computation

0 references

Short discrete log proofs for FHE and ring-LWE ciphertexts

0 references

Practical exact proofs from lattices: new techniques to exploit fully-splitting rings

0 references

0 references

0 references

Expected-time cryptography: generic techniques and applications to concrete soundness

0 references

Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems

0 references

Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors

0 references

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

0 references

Lattice Signatures without Trapdoors

0 references

Generalized Compact Knapsacks Are Collision Resistant

0 references

On the key equation over a commutative ring

0 references

More efficient algorithms for the NTRU key generation using the field norm

0 references

On Generalized Reed–Solomon Codes Over Commutative and Noncommutative Rings

0 references

A new identification scheme based on syndrome decoding

0 references

0 references

Efficient lattice-based zero-knowledge arguments with standard soundness: construction and applications

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-030-84245-1_18

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2128574

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q2128574&oldid=36792977"