Generating Shorter Bases for Hard Random Lattices
From MaRDI portal
Publication:5389967
DOI10.4230/LIPIcs.STACS.2009.1832zbMath1236.94049OpenAlexW1520749523MaRDI QIDQ5389967
Publication date: 24 April 2012
Full work available at URL: http://subs.emis.de/LIPIcs/frontdoor_df0c.html
Related Items
PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Lattice-based linearly homomorphic signatures in the standard model ⋮ Lattice-based certificateless encryption scheme ⋮ Policy-based signature scheme from lattices ⋮ Attribute-based access control for inner product functional encryption from LWE ⋮ Attribute-based conditional proxy re-encryption in the standard model under LWE ⋮ Lattice-based HRA-secure attribute-based proxy re-encryption in standard model ⋮ Black-box accumulation based on lattices ⋮ Lattice-based IBE with equality test supporting flexible authorization in the standard model ⋮ Puncturable identity-based and attribute-based encryption from lattices ⋮ Lattice-based public-key encryption with equality test supporting flexible authorization in standard model ⋮ A novel model for lattice-based authorized searchable encryption with special keyword ⋮ Scalable revocable identity-based signature over lattices in the standard model ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ Succinct vector, polynomial, and functional commitments from lattices ⋮ Zero-Knowledge Arguments for Matrix-Vector Relations and Lattice-Based Group Encryption ⋮ Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions ⋮ Puncturable signature: a generic construction and instantiations ⋮ Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance ⋮ Identity-based interactive aggregate signatures from lattices ⋮ \(\mathrm{mR}_{\mathrm{LWE}}\)-CP-ABE: a revocable CP-ABE for post-quantum cryptography ⋮ Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption ⋮ An efficient homomorphic aggregate signature scheme based on lattice ⋮ Lattice-based completely non-malleable public-key encryption in the standard model ⋮ Public key compression for constrained linear signature schemes ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Watermarking cryptographic functionalities from standard lattice assumptions ⋮ Multi-theorem preprocessing NIZKs from lattices ⋮ Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key ⋮ Novel Identity-Based Hash Proof System with Compact Master Public Key from Lattices in the Standard Model ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE ⋮ Adaptively secure MPC with sublinear communication complexity ⋮ Multiparty reusable non-interactive secure computation from LWE ⋮ Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption ⋮ A Lattice-Based Group Signature Scheme with Message-Dependent Opening ⋮ Wildcarded identity-based encryption from lattices ⋮ Chosen-ciphertext lattice-based public key encryption with equality test in standard model ⋮ Lattice-based linearly homomorphic signature scheme over binary field
