Lattice signatures without trapdoors

DOI10.1007/978-3-642-29011-4_43zbMATH Open1295.94111OpenAlexW121367636MaRDI QIDQ2894441FDOQ2894441

Authors: Vadim Lyubashevsky 

Publication date: 29 June 2012

Published in: Advances in Cryptology – EUROCRYPT 2012 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-29011-4_43

Recommendations

• Asymptotically Efficient Lattice-Based Digital Signatures
• Asymptotically efficient lattice-based digital signatures
• Improved short lattice signatures in the standard model
• Trapdoors for hard lattices and new cryptographic constructions
• Approximate trapdoors for lattices and smaller hash-and-sign signatures

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60)

Cited In (only showing first 100 items - show all)

• Speeding-up verification of digital signatures
• Tightly secure signature schemes from the LWE and subset sum assumptions
• High-speed signatures from standard lattices
• Analysis of error terms of signatures based on learning with errors
• Lattice-based revocable certificateless signature
• On removing rejection conditions in practical lattice-based signatures
• Quantum key search for ternary LWE
• Short identity-based signatures with tight security from lattices
• SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions
• Post-quantum asynchronous deniable key exchange and the signal handshake
• SETLA: Signature and Encryption from Lattices
• Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
• A compressed \(\varSigma \)-protocol theory for lattices
• A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs
• How to meet ternary LWE keys
• Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices
• Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
• Efficient lattice-based blind signatures via Gaussian one-time signatures
• Does Fiat-Shamir require a cryptographic hash function?
• Efficient lattice-based inner-product functional encryption
• BlindOR: an efficient lattice-based blind signature scheme from OR-proofs
• On the higher-bit version of approximate inhomogeneous short integer solution problem
• On the semantic security of functional encryption schemes
• Group signatures and more from isogenies and lattices: generic, simple, and efficient
• Lattice-based signatures with tight adaptive corruptions and more
• Scalable revocable identity-based signature over lattices in the standard model
• A signcryption scheme based learning with errors over rings without trapdoor
• Compact privacy protocols from post-quantum and timed classical assumptions
• A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
• An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
• Signatures from sequential-OR proofs
• Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
• Efficient range proofs with transparent setup from bounded integer commitments
• Short signatures with short public keys from homomorphic trapdoor functions
• Lattice-based blind signatures, revisited
• Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
• Lossy identification schemes from decisional RSA
• Short zero-knowledge proof of knowledge for lattice-based commitment
• The lattice-based digital signature scheme qTESLA
• Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices
• Round-optimal verifiable oblivious pseudorandom functions from ideal lattices
• Shorter lattice-based zero-knowledge proofs via one-time commitments
• The whole is less than the sum of its parts: constructing more efficient lattice-based AKEs
• Duplication free public keys based on SIS-type problems
• Cryptanalysis of a rank-based signature with short public keys
• Universally composable \(\varSigma \)-protocols in the global random-oracle model
• A signature scheme from the finite field isomorphism problem
• Practical exact proofs from lattices: new techniques to exploit fully-splitting rings
• Asymptotically efficient lattice-based digital signatures
• Quantum-resistant identity-based signature with message recovery and proxy delegation
• Covert authentication from lattices
• Integer LWE with non-subgaussian error and related attacks
• A code-based signature scheme from the Lyubashevsky framework
• Lattice-based proof of shuffle and applications to electronic voting
• Cryptanalysis of a code-based one-time signature
• Ring signatures with user-controlled linkability
• A Digital Signature Scheme Based on CVP  ∞
• Finding shortest lattice vectors faster using quantum search
• Augmented Learning with Errors: The Untapped Potential of the Error Term
• Lattice-based zero-knowledge arguments for additive and multiplicative relations
• Efficient lattice-based polynomial evaluation and batch ZK arguments
• When NTT meets Karatsuba: preprocess-then-NTT technique revisited
• Lattice-based zero-knowledge proofs and applications: shorter, simpler, and more general
• Post-quantum online voting scheme
• A framework for cryptographic problems from linear algebra
• Finite interval-time transition system for real-time actors
• Lattice-based cryptography: a survey
• Lattice-based key exchange on small integer solution problem
• Digital signatures from the middle-product LWE
• Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs
• Shorter and faster identity-based signatures with tight security in the (Q)ROM from lattices
• Efficient multi-party concurrent signature from lattices
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
• One-shot verifiable encryption from lattices
• A full RNS variant of FV like somewhat homomorphic encryption schemes
• Concretely-efficient zero-knowledge arguments for arithmetic circuits and their application to lattice-based cryptography
• Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications
• Survey of information security
• Banquet: short and fast signatures from AES
• From Identification to Signatures, Tightly: A Framework and Generic Transforms
• Practical product proofs for lattice commitments
• Approximate trapdoors for lattices and smaller hash-and-sign signatures
• Shorter hash-and-sign lattice-based signatures
• Efficient lattice-based traceable ring signature scheme with its application in blockchain
• Lattice-based certificateless encryption scheme
• Efficient lattice-based signature scheme
• Lattice-Based DAPS and Generalizations: Self-enforcement in Signature Schemes
• Policy-based signature scheme from lattices
• SKCN: practical and flexible digital signature from module lattice
• Verifiable Decryption for Fully Homomorphic Encryption
• Asymptotically Efficient Lattice-Based Digital Signatures
• Cryptanalysis of a round optimal lattice-based multisignature scheme
• Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013
• Multi-bit leveled homomorphic encryption via dual LWE-based
• A generic construction of fuzzy signature
• Tightly secure signatures from lossy identification schemes
• Improvement and efficient implementation of a lattice-based signature scheme
• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Practical signatures from the Partial Fourier Recovery problem revisited: a provably-secure and Gaussian-distributed construction

This page was built for publication: Lattice signatures without trapdoors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2894441)