Pages that link to "Item:Q4924400"
From MaRDI portal
The following pages link to Candidate Multilinear Maps from Ideal Lattices (Q4924400):
Displaying 50 items.
- Verifiably encrypted signatures with short keys based on the decisional linear problem and obfuscation for encrypted VES (Q499658) (← links)
- Strongly full-hiding inner product encryption (Q511916) (← links)
- Obfuscating conjunctions (Q514475) (← links)
- Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation (Q527147) (← links)
- Verifiability-based conversion from CPA to CCA-secure predicate encryption (Q683914) (← links)
- Sender dynamic, non-repudiable, privacy-preserving and strong secure group communication protocol (Q778404) (← links)
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps (Q831181) (← links)
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials (Q887439) (← links)
- Efficient subtree-based encryption for fuzzy-entity data sharing (Q1626290) (← links)
- Cutting-edge cryptography through the lens of secret sharing (Q1627968) (← links)
- Impossibility of order-revealing encryption in idealized models (Q1631321) (← links)
- A ciphertext-size lower bound for order-preserving encryption with limited leakage (Q1631322) (← links)
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks (Q1631346) (← links)
- Return of GGH15: provable security against zeroizing attacks (Q1631349) (← links)
- On virtual grey box obfuscation for general circuits (Q1688397) (← links)
- Scalable zero knowledge via cycles of elliptic curves (Q1688401) (← links)
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation (Q1688405) (← links)
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications (Q1688406) (← links)
- A full RNS variant of FV like somewhat homomorphic encryption schemes (Q1698661) (← links)
- Identity-based aggregate signcryption in the standard model from multilinear maps (Q1712499) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) (Q1746982) (← 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)
- How to build time-lock encryption (Q1791669) (← links)
- Attribute-based fuzzy identity access control in multicloud computing environments (Q1800244) (← links)
- Generic hardness of inversion on ring and its relation to self-bilinear map (Q1989358) (← links)
- Efficient obfuscation for CNF circuits and applications in cloud computing (Q2001194) (← links)
- On the quantum attacks against schemes relying on the hardness of finding a short generator of an ideal in \(\mathbb{Q}(\zeta_{2^s})\) (Q2009413) (← links)
- Functional encryption for cascade automata (Q2013591) (← links)
- Obfuscating circuits via composite-order graded encoding (Q2039401) (← links)
- Simple and efficient FE for quadratic functions (Q2043408) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- Candidate iO from homomorphic encryption schemes (Q2055602) (← links)
- Indistinguishability obfuscation without maps: attacks and fixes for noisy linear FE (Q2055603) (← links)
- Tightly CCA-secure inner product functional encryption scheme (Q2055966) (← links)
- Candidate obfuscation via oblivious LWE sampling (Q2056783) (← links)
- Chosen ciphertext attacks secure inner-product functional encryption from learning with errors assumption (Q2057139) (← links)
- Universal proxy re-encryption (Q2061932) (← links)
- Fast reduction of algebraic lattices over cyclotomic fields (Q2096520) (← links)
- On instantiating the algebraic group model from falsifiable assumptions (Q2119007) (← links)
- Lower bounds on lattice sieving and information set decoding (Q2128585) (← links)
- Practical witness-key-agreement for blockchain-based dark pools financial trading (Q2147265) (← links)
- Cryptanalysis of candidate obfuscators for affine determinant programs (Q2170024) (← links)
- Optimal broadcast encryption and CP-ABE from evasive lattice assumptions (Q2170046) (← links)
- Matrix PRFs: constructions, attacks, and applications to obfuscation (Q2175904) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- Attribute based encryption for deterministic finite automata from DLIN (Q2175933) (← links)
- New approaches to traitor tracing with embedded identities (Q2175935) (← links)
- On the smoothing parameter and last minimum of random orthogonal lattices (Q2182065) (← links)
