Practical multilinear maps over the integers
From MaRDI portal
Publication:2845689
Recommendations
Cited in
(98)- New approaches to traitor tracing with embedded identities
- Quantum lightning never strikes the same state twice. Or: quantum money from cryptographic assumptions
- Duality in ABE: Converting Attribute Based Encryption for Dual Predicate and Dual Policy via Computational Encodings
- Matrix PRFs: constructions, attacks, and applications to obfuscation
- Zeroizing Attacks on Indistinguishability Obfuscation over CLT13
- Generalized hardness assumption for self-bilinear map with auxiliary information
- (In)security of concrete instantiation of Lin17's functional encryption scheme from noisy multilinear maps
- Polynomial-time cryptanalysis of the subspace flooding assumption for post-quantum \(i\mathcal{O} \)
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Candidate iO from homomorphic encryption schemes
- Cryptanalysis of the CLT13 multilinear map
- Lattice-based succinct arguments for NP with polylogarithmic-time verification
- Fast practical lattice reduction through iterated compression
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Efficient obfuscation for CNF circuits and applications in cloud computing
- Revisiting orthogonal lattice attacks on approximate common divisor problems
- Simultaneous diagonalization of incomplete matrices and applications
- Key-policy attribute-based encryption for Boolean circuits from bilinear maps
- Fully secure functional encryption for inner products, from standard assumptions
- Impossibility of order-revealing encryption in idealized models
- Return of GGH15: provable security against zeroizing attacks
- The MMap strikes back: obfuscation and new multilinear maps immune to CLT13 zeroizing attacks
- How to build time-lock encryption
- Multilinear maps from obfuscation
- Functional encryption without obfuscation
- Cryptanalysis of GGH15 multilinear maps
- Indistinguishability obfuscation from compact functional encryption
- CHQS: Publicly Verifiable Homomorphic Signatures Beyond the Linear Case
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- How to avoid obfuscation using witness PRFs
- Delegating RAM computations with adaptive soundness and privacy
- Compactness vs collusion resistance in functional encryption
- Algorithms for CRT-variant of approximate greatest common divisor problem
- Practical order-revealing encryption with limited leakage
- Breaking the sub-exponential barrier in obfustopia
- Lattice-based SNARGs and their application to more efficient obfuscation
- Constraining pseudorandom functions privately
- Projective arithmetic functional encryption and indistinguishability obfuscation from degree-5 multilinear maps
- Probability that the \(k\)-gcd of products of positive integers is \(B\)-friable
- Algebraic generalization of Diffie-Hellman key exchange
- Cryptanalysis of the co-ACD assumption
- Curves with Fast Computations in the First Pairing Group
- Implementing candidate graded encoding schemes from ideal lattices
- A survey on functional encryption
- On the correlation intractability of obfuscated pseudorandom functions
- GGHLite: more efficient multilinear maps from ideal lattices
- Multilinear maps from obfuscation
- Multiparty noninteractive key exchange from ring key-homomorphic weak PRFs
- Cryptographic multilinear maps using pro-\(p\) groups
- scientific article; zbMATH DE number 1996402 (Why is no real title available?)
- Obfuscating circuits via composite-order graded encoding
- Constrained (Verifiable) Pseudorandom Function from Functional Encryption
- On the complexity of compressing obfuscation
- Lattice-based programmable hash functions and applications
- The random oracle model: a twenty-year retrospective
- Predicate encryption for circuits from LWE
- Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
- A Subfield Lattice Attack on Overstretched NTRU Assumptions
- Beyond the Csiszár-Körner bound: best-possible wiretap coding via obfuscation
- New Multilinear Maps Over the Integers
- Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
- Indistinguishability obfuscation
- An algorithm for NTRU problems and cryptanalysis of the GGH multilinear map without a low-level encoding of zero
- Functional encryption: deterministic to randomized functions from simple assumptions
- Cryptanalysis of candidate obfuscators for affine determinant programs
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries
- Candidate iO from homomorphic encryption schemes
- Proofs of Work from worst-case assumptions
- Secure Obfuscation in a Weak Multilinear Map Model
- Homomorphic encryption
- Shorter circuit obfuscation in challenging security models
- Constructions for quantum indistinguishability obfuscation
- Dual system framework in multilinear settings and applications to fully secure (compact) ABE for unbounded-size circuits
- Attribute-based fuzzy identity access control in multicloud computing environments
- Universal proxy re-encryption
- Candidate Multilinear Maps from Ideal Lattices
- Bad directions in cryptographic hash functions
- On Kilian's randomization of multilinear map encodings
- Fine-grained non-interactive key exchange, revisited
- (Compact) adaptively secure FE for attribute-weighted sums from \(k\)-lin
- Multiparty key exchange, efficient traitor tracing, and more from indistinguishability obfuscation
- On virtual grey box obfuscation for general circuits
- Self-bilinear map on unknown order groups from indistinguishability obfuscation and its applications
- Cryptanalysis of multilinear maps from ideal lattices: revisited
- Constrained pseudorandom functions from functional encryption
- Towards faster polynomial-time lattice reduction
- Succinct multi-authority attribute-based access control for circuits with authenticated outsourcing
- One-Way Functions and (Im)perfect Obfuscation
- Indistinguishability obfuscation: from approximate to exact
- Broadcast, trace and revoke with optimal parameters from polynomial hardness
- Obfuscating conjunctions
- Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
- Beyond the Csiszár-Korner bound: best-possible wiretap coding via obfuscation
- A polynomial-time algorithm for solving the hidden subset sum problem
- Cryptanalyses of Candidate Branching Program Obfuscators
- Separating IND-CPA and Circular Security for Unbounded Length Key Cycles
- Directly revocable key-policy attribute-based encryption with verifiable ciphertext delegation
- Robust transforming combiners from indistinguishability obfuscation to functional encryption
This page was built for publication: Practical multilinear maps over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2845689)
