Lattice-Based Identification Schemes Secure Under Active Attacks
From MaRDI portal
Recommendations
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Improved Zero-Knowledge Identification with Lattices
- Adaptively secure identity-based identification from lattices without random oracles
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Post-quantum cryptography: lattice identification schemes
Cites work
- A new paradigm for public key identification
- A sieve algorithm for the shortest lattice vector problem
- Advances in Cryptology - CRYPTO 2003
- Efficient signature generation by smart cards
- Generalized Compact Knapsacks Are Collision Resistant
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 4170086 (Why is no real title available?)
- scientific article; zbMATH DE number 5764780 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 708798 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 1440053 (Why is no real title available?)
- New lattice based cryptographic constructions
- On lattices, learning with errors, random linear codes, and cryptography
- On Polynomial-Factor Approximations to the Shortest Lattice Vector Length
- On the complexity of computing short linearly independent vectors and short bases in a lattice
- On the fly authentication and signature schemes based on groups of unknown order
- On the security of a practical identification scheme
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Sampling Methods for Shortest Vectors, Closest Vectors and Successive Minima
- SWIFFT: A Modest Proposal for FFT Hashing
- Theory of Cryptography
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Zero-knowledge proofs of identity
Cited in
(47)- Lattice-based key exchange on small integer solution problem
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A lattice-based group signature scheme with verifier-local revocation
- Security analysis of cryptosystems using short generators over ideal lattices
- Improved attacks on knapsack problem with their variants and a knapsack type ID-scheme
- On lattice-based interactive protocols: an approach with less or no aborts
- Achievable upper bound for the sup-norm of the product of elements of the ring of truncated polynomials and its application to the analysis of NTRU-like cryptosystems
- Does Fiat-Shamir require a cryptographic hash function?
- Practical non-interactive publicly verifiable secret sharing with thousands of parties
- Algebraic lattices via polynomial rings
- Asymptotically efficient lattice-based digital signatures
- Key-homomorphic signatures: definitions and applications to multiparty signatures and non-interactive zero-knowledge
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
- Lattice-based e-cash, revisited
- Secret handshakes: full dynamicity, deniability and lattice-based design
- How to prove knowledge of small secrets
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
- Analysis of error terms of signatures based on learning with errors
- The geometry of lattice cryptography
- Tightly secure signatures from lossy identification schemes
- Adaptively secure identity-based identification from lattices without random oracles
- Concurrently Secure Identification Schemes Based on the Worst-Case Hardness of Lattice Problems
- Rigorous and Efficient Short Lattice Vectors Enumeration
- On ideal lattices, Gröbner bases and generalized hash functions
- The linear transformation that relates the canonical and coefficient embeddings of ideals in cyclotomic integer rings
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Improved Zero-Knowledge Identification with Lattices
- Untraceability of partial blind and blind signature schemes
- A Lattice-Based Approach to Privacy-Preserving Biometric Authentication Without Relying on Trusted Third Parties
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Cryptographic functions from worst-case complexity assumptions
- On the Security of Beth’s Identification Schemes against Active and Concurrent Adversaries
- Amortized complexity of zero-knowledge proofs revisited: achieving linear soundness slack
- Survey of lattice-based group signature
- Lattice-based accumulator with constant time list update and constant time verification
- A lightweight identification protocol based on lattices
- Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors
- Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
- Enhancing Code Based Zero-Knowledge Proofs Using Rank Metric
- Improved lattice blind signatures from recycled entropy
- Adaptor signatures: new security definition and a generic construction for NP relations
- Lattice-based group signatures in the standard model, revisited
- A practical framework for lattice-based non-interactive publicly verifiable secret sharing
- Beyond the circuit -- how to minimize foreign arithmetic in ZKP circuits
This page was built for publication: Lattice-Based Identification Schemes Secure Under Active Attacks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5445452)
