Covert authentication from lattices (Q2096622)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Covert authentication from lattices	scientific article

Statements

scholarly article

0 references

Covert authentication from lattices (English)

0 references

0 references

publication date

9 November 2022

0 references

zbMATH Keywords

Jarecki's blueprint

0 references

module learning with errors

0 references

module short integer solution

0 references

describes a project that uses

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-09234-3_24

0 references

0 references

New bounds in some transference theorems in the geometry of numbers

0 references

More efficient commitments from structured lattice assumptions

0 references

Hash proof systems over lattices revisited

0 references

Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings

0 references

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

0 references

(Leveled) fully homomorphic encryption without bootstrapping

0 references

Group Signatures

0 references

0 references

0 references

Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices

0 references

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

0 references

Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications

0 references

Fully homomorphic encryption using ideal lattices

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

The knowledge complexity of interactive proof-systems

0 references

Predicate Encryption for Circuits from LWE

0 references

On the round complexity of covert computation

0 references

0 references

Practical Covert Authentication

0 references

PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model

0 references

Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices

0 references

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

0 references

0 references

Lattice-Based Group Signature Scheme with Verifier-Local Revocation

0 references

Worst-case to average-case reductions for module lattices

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

Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based

0 references

Lattice Signatures without Trapdoors

0 references

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

0 references

Generalized compact knapsacks, cyclic lattices, and efficient one-way functions

0 references

A Decade of Lattice Cryptography

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

0 references

Covert two-party computation

0 references

Two-round PAKE from approximate SPH and instantiations from lattices

0 references

Identifiers

10.1007/978-3-031-09234-3_24

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2096622

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