Lattice Signatures without Trapdoors
From MaRDI portal
Publication:2894441
DOI10.1007/978-3-642-29011-4_43zbMath1295.94111OpenAlexW121367636MaRDI QIDQ2894441
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
Related Items (only showing first 100 items - show all)
DualRing: generic construction of ring signatures with efficient instantiations ⋮ Lattice-based key exchange on small integer solution problem ⋮ Lattice-based proof of shuffle and applications to electronic voting ⋮ Efficient multi-party concurrent signature from lattices ⋮ Untraceability of Partial Blind and Blind Signature Schemes ⋮ Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography ⋮ Compact Privacy Protocols from Post-quantum and Timed Classical Assumptions ⋮ Efficient Post-quantum SNARKs for RSIS and RLWE and Their Applications to Privacy ⋮ Short Zero-Knowledge Proof of Knowledge for Lattice-Based Commitment ⋮ Subtractive sets over cyclotomic rings. Limits of Schnorr-like arguments over lattices ⋮ A compressed \(\varSigma \)-protocol theory for lattices ⋮ A new simple technique to bootstrap various lattice zero-knowledge proofs to QROM secure NIZKs ⋮ SMILE: set membership from ideal lattices with applications to ring signatures and confidential transactions ⋮ How to meet ternary LWE keys ⋮ Lattice-based zero-knowledge arguments for additive and multiplicative relations ⋮ Efficient lattice-based polynomial evaluation and batch ZK arguments ⋮ LESS is More: Code-Based Signatures Without Syndromes ⋮ Lattice-based certificateless encryption scheme ⋮ Does Fiat-Shamir require a cryptographic hash function? ⋮ Policy-based signature scheme from lattices ⋮ Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite ⋮ Tightly secure signatures from lossy identification schemes ⋮ Coded-BKW: Solving LWE Using Lattice Codes ⋮ BlindOR: an efficient lattice-based blind signature scheme from OR-proofs ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem ⋮ Survey of information security ⋮ A generic construction of fuzzy signature ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ Integer LWE with non-subgaussian error and related attacks ⋮ A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ Scalable revocable identity-based signature over lattices in the standard model ⋮ Duplication free public keys based on SIS-type problems ⋮ Efficient Verifiable Partially-Decryptable Commitments from Lattices and Applications ⋮ Post-quantum online voting scheme ⋮ Shorter lattice-based zero-knowledge proofs for the correctness of a shuffle ⋮ Asymptotically efficient lattice-based digital signatures ⋮ A Novel Certificateless Multi-signature Scheme over NTRU Lattices ⋮ When NTT meets Karatsuba: preprocess-then-NTT technique revisited ⋮ Finding shortest lattice vectors faster using quantum search ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013 ⋮ A novel identity-based multi-signature scheme over NTRU lattices ⋮ On the hardness of module learning with errors with short distributions ⋮ Digital Signatures Based on the Hardness of Ideal Lattice Problems in All Rings ⋮ Towards Tightly Secure Lattice Short Signature and Id-Based Encryption ⋮ From Identification to Signatures, Tightly: A Framework and Generic Transforms ⋮ A signature scheme from the finite field isomorphism problem ⋮ A code-based signature scheme from the Lyubashevsky framework ⋮ Forward-secure ID based digital signature scheme with forward-secure private key generator ⋮ Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures ⋮ A full RNS variant of FV like somewhat homomorphic encryption schemes ⋮ Cryptanalysis of a code-based one-time signature ⋮ Practical exact proofs from lattices: new techniques to exploit fully-splitting rings ⋮ Secret handshakes: full dynamicity, deniability and lattice-based design ⋮ Simulatable verifiable random function from the LWE assumption ⋮ Multi-bit Leveled Homomorphic Encryption via $$\mathsf {Dual.LWE}$$ -Based ⋮ Speeding-up verification of digital signatures ⋮ Lossy Identification Schemes from Decisional RSA ⋮ Analysis of Error Terms of Signatures Based on Learning with Errors ⋮ The lattice-based digital signature scheme qTESLA ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ A Signcryption Scheme Based Learning with Errors over Rings Without Trapdoor ⋮ Minimal condition for shortest vectors in lattices of low dimension ⋮ Cryptanalysis of a code-based full-time signature ⋮ Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance ⋮ Finite interval-time transition system for real-time actors ⋮ On the Semantic Security of Functional Encryption Schemes ⋮ One-Shot Verifiable Encryption from Lattices ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Unnamed Item ⋮ A framework for cryptographic problems from linear algebra ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ Identity-based proxy re-signatures from lattices ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Modular lattice signatures, revisited ⋮ An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ 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 ⋮ Cryptanalysis of a rank-based signature with short public keys ⋮ Shorter lattice-based zero-knowledge proofs via one-time commitments ⋮ Banquet: short and fast signatures from AES ⋮ Round-optimal verifiable oblivious pseudorandom functions from ideal lattices ⋮ Quantum-resistant identity-based signature with message recovery and proxy delegation ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes ⋮ Tightly secure signature schemes from the LWE and subset sum assumptions ⋮ Lattice-based revocable certificateless signature ⋮ A non-PCP approach to succinct quantum-safe zero-knowledge ⋮ Practical product proofs for lattice commitments ⋮ Lattice-based blind signatures, revisited ⋮ Covert authentication from lattices ⋮ Rank-Metric Codes and Their Applications ⋮ The security of the code-based signature scheme based on the Stern identification protocol ⋮ 0-RTT Key Exchange with Full Forward Secrecy ⋮ Quantum key search for ternary LWE ⋮ Short identity-based signatures with tight security from lattices ⋮ On removing rejection conditions in practical lattice-based signatures
This page was built for publication: Lattice Signatures without Trapdoors
