Pages that link to "Item:Q2894439"
From MaRDI portal
The following pages link to Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller (Q2894439):
Displaying 50 items.
- Policy-based signature scheme from lattices (Q306050) (← links)
- Tightly secure signatures from lossy identification schemes (Q315555) (← links)
- Strongly secure authenticated key exchange from factoring, codes, and lattices (Q494585) (← links)
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- Why you cannot even hope to use Gröbner bases in cryptography: an eternal golden braid of failures (Q780363) (← links)
- SoK: how (not) to design and implement post-quantum cryptography (Q826276) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions (Q831176) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- Obfuscating finite automata (Q832331) (← links)
- Finding shortest lattice vectors faster using quantum search (Q887421) (← links)
- Lattice-based key exchange on small integer solution problem (Q1616180) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Review of cryptographic schemes applied to remote electronic voting systems: remaining challenges and the upcoming post-quantum paradigm (Q1643980) (← links)
- Memory lower bounds of reductions revisited (Q1648781) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← 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)
- Zero-knowledge arguments for matrix-vector relations and lattice-based group encryption (Q1711842) (← links)
- Public key compression for constrained linear signature schemes (Q1726681) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- CPA/CCA2-secure PKE with squared-exponential DFR from low-noise LPN (Q1981773) (← links)
- A multi-key SMC protocol and multi-key FHE based on some-are-errorless LWE (Q2001181) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← links)
- On the structure of Boolean functions with small spectral norm (Q2012184) (← links)
- Discretisation and product distributions in ring-LWE (Q2027267) (← links)
- Collusion-resistant identity-based proxy re-encryption: lattice-based constructions in standard model (Q2031043) (← links)
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key (Q2037197) (← links)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\) (Q2043324) (← links)
- Adaptively secure lattice-based revocable IBE in the QROM: compact parameters, tight security, and anonymity (Q2043417) (← links)
- Revocable attribute-based proxy re-encryption (Q2048189) (← links)
- CCA-security from adaptive all-but-one lossy trapdoor functions (Q2049981) (← links)
- Optimal broadcast encryption from pairings and LWE (Q2055600) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- Decentralized multi-authority \textbf{\textsf{ABE}} for \textbf{\textsf{DNF}}s from \textbf{\textsf{LWE}} (Q2056681) (← links)
- New lattice two-stage sampling technique and its applications to functional encryption -- stronger security and smaller ciphertexts (Q2056698) (← links)
- Multiparty reusable non-interactive secure computation from LWE (Q2056764) (← links)
- Unbounded multi-party computation from learning with errors (Q2056765) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Exact lattice sampling from non-Gaussian distributions (Q2061936) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Non-interactive CCA2-secure threshold cryptosystems: achieving adaptive security in the standard model without pairings (Q2061939) (← links)
- Round-optimal verifiable oblivious pseudorandom functions from ideal lattices (Q2061957) (← links)
- Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
- LWE from non-commutative group rings (Q2068391) (← links)
- Chosen-ciphertext lattice-based public key encryption with equality test in standard model (Q2072076) (← links)
- Incompressible encodings (Q2096497) (← links)
