Pages that link to "Item:Q3549701"
From MaRDI portal
The following pages link to Trapdoors for hard lattices and new cryptographic constructions (Q3549701):
Displaying 50 items.
- An efficient IBE scheme with tight security reduction in the random oracle model (Q264126) (← links)
- Cryptanalysis and improvement of verifiable quantum \((k,n)\) secret sharing (Q264629) (← links)
- On random nonsingular Hermite normal form (Q266588) (← links)
- Comment on ``A strong provably secure IBE scheme without bilinear map'' by M. Zheng, Y. Xiang and H. Zhou (Q269479) (← links)
- Lattice-based linearly homomorphic signatures in the standard model (Q284579) (← links)
- Signature schemes secure against hard-to-invert leakage (Q290397) (← links)
- Policy-based signature scheme from lattices (Q306050) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- New transference theorems on lattices possessing \(n^\varepsilon\)-unique shortest vectors (Q393183) (← links)
- Shorter identity-based encryption via asymmetric pairings (Q404944) (← links)
- Programmable hash functions and their applications (Q434345) (← links)
- Algebraic (trapdoor) one-way functions: constructions and applications (Q500981) (← links)
- Generating shorter bases for hard random lattices (Q537918) (← links)
- Efficient selective identity-based encryption without random oracles (Q656924) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials (Q887439) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Learning a parallelepiped: Cryptanalysis of GGH and NTRU signatures (Q1015359) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Efficient subtree-based encryption for fuzzy-entity data sharing (Q1626290) (← links)
- On basing search SIVP on \(\mathbf{NP}\)-hardness (Q1629401) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
- Lattice-based certificateless encryption scheme (Q1633051) (← links)
- Regular lossy functions and their applications in leakage-resilient cryptography (Q1643156) (← links)
- On the ring-LWE and polynomial-LWE problems (Q1648786) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Anonymous IBE, leakage resilience and circular security from new assumptions (Q1648813) (← links)
- A novel model for lattice-based authorized searchable encryption with special keyword (Q1665334) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- On the asymptotic complexity of solving LWE (Q1692148) (← links)
- Loop-abort faults on lattice-based Fiat-Shamir and hash-and-sign signatures (Q1698622) (← links)
- Cryptanalysis and improvement of a quantum private set intersection protocol (Q1701936) (← links)
- Practical fully secure unrestricted inner product functional encryption modulo \(p\) (Q1710625) (← links)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- A lattice-based identity-based proxy blind signature scheme in the standard model (Q1718090) (← links)
- An efficient homomorphic aggregate signature scheme based on lattice (Q1718616) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- Minimal condition for shortest vectors in lattices of low dimension (Q1739940) (← links)
- Optimal security proofs for full domain hash. Revisited (Q1747667) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance (Q1753174) (← links)
- Security analysis of cryptosystems using short generators over ideal lattices (Q1756730) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- A simple provably secure AKE from the LWE problem (Q1992397) (← links)
