Pages that link to "Item:Q2953793"
From MaRDI portal
The following pages link to Partitioning via Non-linear Polynomial Functions: More Compact IBEs from Ideal Lattices and Bilinear Maps (Q2953793):
Displaying 30 items.
- IBE and function-private IBE under linear assumptions with shorter ciphertexts and private keys, and extensions (Q1626119) (← links)
- Adaptively secure distributed PRFs from LWE (Q1631339) (← links)
- Asymptotically compact adaptively secure lattice IBEs and verifiable random functions via generalized partitioning techniques (Q1675199) (← links)
- Deterministic identity-based encryption from lattices with more compact public parameters (Q1800838) (← links)
- A more efficient leveled strongly-unforgeable fully homomorphic signature scheme (Q2004727) (← 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)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Efficient adaptively-secure IB-KEMs and VRFs via near-collision resistance (Q2061937) (← links)
- Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
- Adaptively secure constrained pseudorandom functions in the standard model (Q2096499) (← links)
- Attribute-based access control for inner product functional encryption from LWE (Q2146083) (← links)
- Revocable identity-based encryption with bounded decryption key exposure resistance: lattice-based construction and more (Q2215969) (← links)
- Efficient public-key encryption with equality test from lattices (Q2235763) (← links)
- Ring-based identity based encryption -- asymptotically shorter MPK and tighter security (Q2697891) (← links)
- Direct computation of branching programs and its applications to more efficient lattice-based cryptography (Q2698337) (← links)
- Compact Hierarchical IBE from Lattices in the Standard Model (Q3297499) (← links)
- Almost Tight Security in Lattices with Polynomial Moduli – PRF, IBE, All-but-many LTF, and More (Q5041173) (← links)
- Tighter security proofs for GPV-IBE in the quantum random oracle model (Q5925501) (← links)
- Lattice-based revocable (hierarchical) IBE with decryption key exposure resistance (Q5970987) (← links)
- Fully collusion resistant trace-and-revoke functional encryption for arbitrary identities (Q6122595) (← links)
- (Inner-product) functional encryption with updatable ciphertexts (Q6141858) (← links)
- Efficient lattice-based inner-product functional encryption (Q6169033) (← links)
- Generic construction of trace-and-revoke inner product functional encryption (Q6173290) (← links)
- Lattice-based programmable hash functions and applications (Q6182001) (← links)
- Anonymous Lattice Identity-Based Encryption with Traceable Identities (Q6488400) (← links)
- Adaptively secure identity-based encryption from middle-product learning with errors (Q6535491) (← links)
- Ring/module learning with errors under linear leakage -- hardness and applications (Q6635772) (← links)
- Identity-based encryption from LWE with more compact master public key (Q6636117) (← links)
- Towards compact identity-based encryption on ideal lattices (Q6636118) (← links)
