scientific article; zbMATH DE number 1256724
From MaRDI portal
Publication:4228459
Recommendations
Cited in
(only showing first 100 items - show all)- A relation of primal--dual lattices and the complexity of shortest lattice vector problem
- On the limits of nonapproximability of lattice problems
- A note on the non-NP-hardness of approximate lattice problems under general Cook reductions.
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- On the distribution of the Diffie-Hellman pairs
- Lattice-based key exchange on small integer solution problem
- On basing search SIVP on \(\mathbf{NP}\)-hardness
- Fiat-Shamir and correlation intractability from strong KDM-secure encryption
- A pseudorandom number generator based on worst-case lattice problems
- Scalable zero knowledge via cycles of elliptic curves
- Hardness of \(k\)-LWE and applications in traitor tracing
- The hunting of the SNARK
- Post-quantum key exchange for the Internet and the open quantum safe project
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- A lattice-based identity-based proxy blind signature scheme in the standard model
- STP-LWE: A variant of learning with error for a flexible encryption
- Reductions in \textbf{PPP}
- Minimal condition for shortest vectors in lattices of low dimension
- A lattice-based group signature scheme with verifier-local revocation
- FPT-algorithms for some problems related to integer programming
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- A lattice-based public-key cryptosystem
- A new transference theorem in the geometry of numbers and new bounds for Ajtai's connection factor
- A note on the minimal volume of almost cubic parallelepipeds
- The inapproximability of lattice and coding problems with preprocessing
- Approximating the SVP to within a factor \((1+1/\dim^\varepsilon)\) is NP-hard under randomized reductions
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- A framework for cryptographic problems from linear algebra
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model
- Traceable ring signatures: general framework and post-quantum security
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures
- CCA-security from adaptive all-but-one lossy trapdoor functions
- An efficient anti-quantum lattice-based blind signature for blockchain-enabled systems
- Verifiable single-server private information retrieval from LWE with binary errors
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Tweaking the asymmetry of asymmetric-key cryptography on lattices: KEMs and signatures of smaller sizes
- On the ideal shortest vector problem over random rational primes
- Multiparty reusable non-interactive secure computation from LWE
- Candidate obfuscation via oblivious LWE sampling
- Bifurcated signatures: folding the accountability vs. anonymity dilemma into a single private signing scheme
- Single-to-multi-theorem transformations for non-interactive statistical zero-knowledge
- LWE from non-commutative group rings
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model
- Incompressible encodings
- Fast reduction of algebraic lattices over cyclotomic fields
- Lattice reduction for modules, or how to reduce ModuleSVP to ModuleSVP
- Slide reduction, revisited -- filling the gaps in SVP approximation
- A non-PCP approach to succinct quantum-safe zero-knowledge
- Revocable hierarchical attribute-based signatures from lattices
- Covert authentication from lattices
- Short identity-based signatures with tight security from lattices
- On removing rejection conditions in practical lattice-based signatures
- Hardness of LWE on general entropic distributions
- On the possibility of basing cryptography on \(\mathsf{EXP}\ne \mathsf{BPP} \)
- \textsf{Halo Infinite}: proof-carrying data from additive polynomial commitments
- A compressed \(\varSigma \)-protocol theory for lattices
- Lattice reduction with approximate enumeration oracles. Practical algorithms and concrete performance
- A trace map attack against special ring-LWE samples
- Attribute-based signatures from lattices: unbounded attributes and semi-adaptive security
- Solving the search-LWE problem over projected lattices
- Black-box accumulation based on lattices
- The matrix reloaded: multiplication strategies in FrodoKEM
- On the higher-bit version of approximate inhomogeneous short integer solution problem
- The Modular Subset-Sum Problem and the size of deletion correcting codes
- Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems
- Approximate CVP in time \(2^{0.802 n}\) -- now in any norm!
- Efficient proof composition for verifiable computation
- A Ring-LWE-based digital signature inspired by Lindner-Peikert scheme
- Property-preserving hash functions for Hamming distance from standard assumptions
- Quantum algorithms for variants of average-case lattice problems via filtering
- Permuted puzzles and cryptographic hardness
- Improved broadcast attacks against subset sum problems via lattice oracle
- Group signature from lattices preserving forward security in dynamic setting
- An efficient and batch verifiable conditional privacy-preserving authentication scheme for VANETs using lattice
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- The projection games conjecture and the hardness of approximation of Super-SAT and related problems
- Generating hard instances for robust combinatorial optimization
- Lattice-based group signatures: achieving full dynamicity (and deniability) with ease
- Lattice-based revocable certificateless signature
- Sharing privacy protected and statistically sound clinical research data using outsourced data storage
- Worst-case to average-case reductions for module lattices
- Post-quantum cryptography: lattice signatures
- Duplication free public keys based on SIS-type problems
- Asymptotically efficient lattice-based digital signatures
- Improved analysis of the reduction from BDD to uSVP
- On the probability of generating a lattice
- Reduced Gröbner bases and Macaulay-Buchberger basis theorem over Noetherian rings
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- Hardness of approximating the shortest vector problem in high \(\ell_{p}\) norms
- Identity-based proxy re-signatures from lattices
- Counting lattice vectors
- Effective lattice point counting in rational convex polytopes
- On random nonsingular Hermite normal form
- Post-quantum online voting scheme
- Lattice-based secret handshakes with reusable credentials
- Predicting the concrete security of LWE against the dual attack using binary search
- A novel identity-based multi-signature scheme over NTRU lattices
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228459)
