Generating hard instances of the short basis problem
From MaRDI portal
Recommendations
Cited in
(78)- Two-message statistically sender-private OT from LWE
- Shortest vector from lattice sieving: a few dimensions for free
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Hardness of \(k\)-LWE and applications in traitor tracing
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- A lattice-based group signature scheme with verifier-local revocation
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}}
- Multiparty reusable non-interactive secure computation from LWE
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption
- Wildcarded identity-based encryption from lattices
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- An optimized GHV-type HE scheme: simpler, faster, and more versatile
- Generating cryptographically-strong random lattice bases and recognizing rotations of \(\mathbb{Z}^n\)
- Attribute-based access control for inner product functional encryption from LWE
- Lattice-based HRA-secure attribute-based proxy re-encryption in standard model
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- 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
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more
- Speeding-up verification of digital signatures
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Post-quantum cryptography: lattice signatures
- Lattice-based completely non-malleable public-key encryption in the standard model
- A lattice-based signcryption scheme without random oracles
- Scalable revocable identity-based signature over lattices in the standard model
- Lattice-based secret handshakes with reusable credentials
- Cryptanalysis of Boyen's attribute-based encryption scheme in TCC 2013
- Simulatable verifiable random function from the LWE assumption
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Lattice-based linearly homomorphic signatures in the standard model
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption
- Multi-key Homomorphic Authenticators
- Secure multi-source network coding scheme with lattice signature
- Policy-based signature scheme from lattices
- The geometry of lattice cryptography
- Two efficient tag-based encryption schemes on lattices
- Compact (targeted homomorphic) inner product encryption from LWE
- Simplified revocable hierarchical identity-based encryption from lattices
- scientific article; zbMATH DE number 5726469 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- Improved zero-knowledge proofs of knowledge for the ISIS problem, and applications
- Improved (hierarchical) inner-product encryption from lattices
- A lattice-based certificateless public key encryption with equality test in standard model
- Attribute-based keyword search from lattices
- Untraceability of partial blind and blind signature schemes
- Collusion resistant traitor tracing from learning with errors
- Cryptanalyses of Candidate Branching Program Obfuscators
- Generating shorter bases for hard random lattices
- Generating shorter bases for hard random lattices
- scientific article; zbMATH DE number 2196508 (Why is no real title available?)
- Short Stickelberger class relations and application to Ideal-SVP
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Watermarking cryptographic functionalities from standard lattice assumptions
- Multi-theorem preprocessing NIZKs from lattices
- Adaptively secure MPC with sublinear communication complexity
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance
- Revocable identity-based fully homomorphic signature scheme with signing key exposure resistance
- Generic constructions of master-key KDM secure attribute-based encryption
- Public key authenticated encryption with keyword search from LWE
- Lattice-based programmable hash functions and applications
- A lattice-based forward secure IBE scheme for Internet of things
- BS: Blockwise Sieve Algorithm for Finding Short Vectors from Sublattices
- Towards tightly secure short linearly homomorphic signatures
- Time-based attribute-based proxy re-encryption with decryption key update
- Module lattice based constant-size group signature with verifier local revocation and backward unlinkability
- Lattice-based logarithmic-size forward-secure ring signatures in QROM
- Smoothed analysis of deterministic discounted and Mean-payoff games
- Universal computational extractors and multi-bit AIPO from lattice assumptions
- Tight adaptive simulation security for identity-based inner-product FE in the (quantum) random oracle model
- Efficient verifiable mixnets from lattices, revisited
- Fully selective opening secure IBE from LWE
- Optimal threshold traitor tracing
- A quantum secure convertible ring signature scheme over SIS problem
- On the possibility of malicious obfuscation
- Dynamic puncturable encryption
This page was built for publication: Generating hard instances of the short basis problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4938616)
