Covert authentication from lattices
From MaRDI portal
Publication:2096622
DOI10.1007/978-3-031-09234-3_24OpenAlexW4285242471MaRDI QIDQ2096622
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-031-09234-3_24
Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Authentication, digital signatures and secret sharing (94A62)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- New bounds in some transference theorems in the geometry of numbers
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
- Two-round PAKE from approximate SPH and instantiations from lattices
- Hash proof systems over lattices revisited
- More efficient commitments from structured lattice assumptions
- Lattice-based zero-knowledge proofs: new techniques for shorter and faster constructions and applications
- Algebraic techniques for short(er) exact lattice-based zero-knowledge proofs
- Worst-case to average-case reductions for module lattices
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- A Decade of Lattice Cryptography
- (Leveled) fully homomorphic encryption without bootstrapping
- On the round complexity of covert computation
- Lattice Signatures without Trapdoors
- Group Signatures from Lattices: Simpler, Tighter, Shorter, Ring-Based
- Predicate Encryption for Circuits from LWE
- Trapdoors for hard lattices and new cryptographic constructions
- Covert two-party computation
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
- Group Signatures
- The knowledge complexity of interactive proof-systems
- Improved Zero-Knowledge Proofs of Knowledge for the ISIS Problem, and Applications
- PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model
- Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
- Fully homomorphic encryption using ideal lattices
- Lattice-Based Group Signature Scheme with Verifier-Local Revocation
- Practical Covert Authentication
- Zero-Knowledge Arguments for Lattice-Based Accumulators: Logarithmic-Size Ring Signatures and Group Signatures Without Trapdoors
- On lattices, learning with errors, random linear codes, and cryptography
- Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
